Data Structures and Algorithm Analysis in C++
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > Data Structures and Algorithm Analysis in C++: International Edition
Data Structures and Algorithm Analysis in C++: International Edition

Data Structures and Algorithm Analysis in C++: International Edition

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. Before covering algorithms and data structures, the author provides a brief introduction to C++ for programmers unfamiliar with the language. All of the source code will be available over the Internet. Dr. Weiss also distinguishes the book with his clear, friendly writing style, logical organization of topics, and extensive use of figures and examples that show the successive stages of an algorithm.

Table of Contents:
1. Introduction. What's the Book About? Mathematics Review. Exponents. Logarithms. Series. Modular Arithmetic. The P Word. A Brief Introduction to Recursion C++ Classes. Basic class Syntax. Extra Constructor Syntax and Accessors Separation of Interface and Implementation. vector and string. C++ Details. Pointers. Parameter Passing. Return Passing Reference Variables. The Big Three: Destructor, Copy Constructor, operator=. The World of C. Templates. Function Templates. Class Templates. Object, Comparable, and an Example. Using Matrices. The Data Members, Constructor, and Basic Accessors. operator [ ]. Destructor, Copy Assignment, Copy Constructor. Summary. Exercises. References. 2. Algorithm Analysis. Mathematical Background. Model. What to Analyze. Running Time Calculations. A Simple Example. General Rules. Solutions for the Maximum Subsequence Sum Problem. Logarithms in the Running Time. Checking Your Analysis. A Grain of Salt. Summary. Exercises. References. 3. Lists, Stacks, and Queues. Abstract Data Types (ADTs). The List ADT. Simple Array Implementation of Lists. Linked Lists. Programming Details. Memory Reclamation and the Big Three. Doubly Linked Lists. Circular Linked Lists. Examples. Cursor Implementation of Linked Lists. The Stack ADT. Stack Model. Implementation of Stacks. Applications. The Queue ADT. Queue Model. Array Implementation of Queues. Applications of Queues. Summary. Exercises. 4. Trees. Preliminaries. Implementation of Trees. Tree Traversals with an Application. Binary Trees. Implementation. An Example: Expression Trees. The Search Tree ADT-Binary Search Trees. find. findMin and findMax. insert. remove. Destructor and Copy Assignment Operator. Average-Case Analysis. AVL Trees. Single Rotation. Double Rotation. Splay Trees. A Simple Idea (That Does Not Work). Splaying. Tree Traversals (Revisited). B-Trees. Summary. Exercises. References. 5. Hashing. General Idea. Hash Function. Separate Chaining. Open Addressing. Linear Probing. Quadratic Probing. Double Hashing. Rehashing. Extendible Hashing. Summary. Exercises. References. 6. Priority Queues (Heaps). Model. Simple Implementations. Binary Heap. Structure Property. Heap-Order Property. Basic Heap Operations. Other Heap Operations. Applications of Priority Queues. The Selection Problem. Event Simulation. d-Heaps. Leftist Heaps. Leftist Heap Property. Leftist Heap Operations. Skew Heaps. Binomial Queues. Binomial Queue Structure. Binomial Queue Operations. Implementation of Binomial Queues. Summary. Exercises. References. 7. Sorting. Preliminaries. Insertion Sort. The Algorithm. Analysis of Insertion Sort. A Lower Bound for Simple Sorting Algorithms. Shellsort. Worst-Case Analysis of Shellsort Heapsort. Analysis of Heapsort. Mergesort. Analysis of Mergesort. Quicksort. Picking the Pivot. Partitioning Strategy. Small Arrays. Actual Quicksort Routines. Analysis of Quicksort A Linear-Expected-Time Algorithm for Selection. Indirect Sorting. vector Does Not Work. Smart Pointer Class. Overloading operator< Dereferencing a Pointer with *. Overloading the Type Conversion Operator Implicit Type Conversions Are Everywhere. Dual-Direction Implicit Conversions Can Cause Ambiguities. Pointer Subtraction Is Legal. A General Lower Bound for Sorting. Decision Trees. Bucket Sort. External Sorting. Why We Need New Algorithms. Model for External Sorting. The Simple Algorithm. Multiway Merge. Polyphase Merge. Replacement Selection. Summary. Exercises. References. 8. The Disjoint Set ADT. Equivalence Relations. The Dynamic Equivalence Problem. Basic Data Structure. Smart Union Algorithms. Path Compression. Worst Case for Union-by-Rank and Path Compression. Analysis of the Union/Find Algorithm. An Application. Summary. Exercises. References. 9. Graph Algorithms. Definitions. Representation of Graphs. Topological Sort. Shortest-Path Algorithms. Unweighted Shortest Paths. Dijkstra's Algorithm. Graphs with Negative Edge Costs Acyclic Graphs. All-Pairs Shortest Path. Network Flow Problems. A Simple Maximum-Flow Algorithm. Minimum Spanning Tree. Prim's Algorithm. Kruskal's Algorithm. Applications of Depth-First Search. Undirected Graphs. Biconnectivity. Euler Circuits. Directed Graphs. Finding Strong Components. Introduction to NP-Completeness. Easy vs. Hard. The Class NP. NP-Complete Problems. Summary. Exercises. References. 10. Algorithm Design Techniques. Greedy Algorithms. A Simple Scheduling Problem. Huffman Codes. Approximate Bin Packing. Divide and Conquer. Running Time of Divide and Conquer Algorithms. Closest-Points Problem. The Selection Problem. Theoretical Improvements for Arithmetic Problems. Dynamic Programming. Using a Table Instead of Recursion. Ordering Matrix Multiplications. Optimal Binary Search Tree. All-Pairs Shortest Path. Randomized Algorithms. Random Number Generators. Skip Lists. Primality Testing. Backtracking Algorithms. The Turnpike Reconstruction Problem. Games. Summary. Exercises. References. 11. Amortized Analysis. An Unrelated Puzzle. Binomial Queues. Skew Heaps. Fibonacci Heaps. Cutting Nodes in Leftist Heaps. Lazy Merging for Binomial Queues. The Fibonacci Heap Operations. Proof of the Time Bound. Splay Trees. Summary. Exercises. References. 12. Advanced Data Structures and Implementation. Top-Down Splay Trees. Red-Black Trees. Bottom-Up Insertion. Top-Down Red-Black Trees. Top-Down Deletion. Deterministic Skip Lists. AA-Trees. Treaps. k-d Trees. Pairing Heaps. Summary. Exercises. References. Appendix A. The Standard Template Library. Introduction Basic STL Concepts. Header Files and the using Directive Containers. iterator. Pairs. Function Objects. Unordered Sequences: vector and list. vector versus list. Stacks and Queues. Sets. Maps. Example: Generating a Concordance. STL Version. Version without Using the STL Example: Shortest-Path Calculation. STL Implementation. Version without Using the STL. Other STL Features. Appendix B. vector and string Classes. First-Class versus Second-Class Objects. vector Class. string Class. Index. 0201361221T04062001


Best Sellers


Product Details
  • ISBN-13: 9780321189967
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 234 mm
  • No of Pages: 564
  • Sub Title: International Edition
  • Width: 190 mm
  • ISBN-10: 0321189965
  • Publisher Date: 04 Feb 1999
  • Binding: Paperback
  • Language: English
  • Spine Width: 22 mm
  • Weight: 902 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Structures and Algorithm Analysis in C++: International Edition
Pearson Education (US) -
Data Structures and Algorithm Analysis in C++: International Edition
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Data Structures and Algorithm Analysis in C++: International Edition

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!