|Listed in category:
This listing sold on Fri, Jul 18 at 21:12.
Data Structures and Algorithm Analysis in Java
Sold
Data Structures and Algorithm Analysis in Java
US $11.74US $11.74
Fri, Jul 18, 09:12 PMFri, Jul 18, 09:12 PM
Have one to sell?

Data Structures and Algorithm Analysis in Java

US $11.74
ApproximatelyC $16.23
Condition:
Good
    Shipping:
    Free USPS Media MailTM.
    Located in: Feasterville Trevose, Pennsylvania, United States
    Delivery:
    Estimated between Thu, Aug 28 and Thu, Sep 4 to 94104
    Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
    Returns:
    No returns accepted.
    Payments:
         Diners Club

    Shop with confidence

    eBay Money Back Guarantee
    Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
    Seller assumes all responsibility for this listing.
    eBay item number:177236205530
    Last updated on Jul 18, 2025 13:18:24 EDTView all revisionsView all revisions

    Item specifics

    Condition
    Good: A book that has been read but is in good condition. Very minimal damage to the cover including ...
    Release Year
    2011
    Book Title
    Data Structures and Algorithm Analysis in Java
    ISBN
    9780132576277

    About this product

    Product Identifiers

    Publisher
    Pearson Education
    ISBN-10
    0132576279
    ISBN-13
    9780132576277
    eBay Product ID (ePID)
    109275384

    Product Key Features

    Number of Pages
    648 Pages
    Publication Name
    Data Structures and Algorithm Analysis in Java
    Language
    English
    Subject
    Programming / General, Programming / Algorithms, Programming Languages / Java, Algebra / General, Software Development & Engineering / Systems Analysis & Design
    Publication Year
    2011
    Features
    Revised
    Type
    Textbook
    Subject Area
    Mathematics, Computers
    Author
    Mark Weiss
    Format
    Hardcover

    Dimensions

    Item Height
    0.4 in
    Item Weight
    33.9 Oz
    Item Length
    0.4 in
    Item Width
    0.4 in

    Additional Product Features

    Edition Number
    3
    Intended Audience
    College Audience
    LCCN
    2011-035536
    Dewey Edition
    23
    Dewey Decimal
    005.1
    Edition Description
    Revised edition
    Synopsis
    Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text s coverage. ", Data Structures and Algorithm Analysis in Java is an "advanced algorithms" book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage., Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage., In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. KEY TOPICS: This new edition contains all the enhancements of the new Java 7 code including diamonds. This book explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. MARKET: This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
    LC Classification Number
    QA76.73.J38

    Item description from the seller

    About this seller

    OnTimeBooks

    98.2% positive feedback219K items sold

    Joined Sep 2017
    Usually responds within 24 hours

    Detailed seller ratings

    Average for the last 12 months
    Accurate description
    4.8
    Reasonable shipping cost
    5.0
    Shipping speed
    5.0
    Communication
    5.0

    Seller feedback (53,709)

    All ratings
    Positive
    Neutral
    Negative
      • r***b (106)- Feedback left by buyer.
        Past month
        Verified purchase
        Great
      See all feedback