For CS2/Data Structures courses using C++.
This book uses a modern object-oriented approach to data structures, unified around the notion of the Standard Template Library (STL) container classes. The book presents a systematic development of data structures supported by numerous examples and complete programs. The authors separate the applications of a data structure from its implementation. In the later chapters, the book transitions students into the study of applied algorithms. This creates a bridge to subsequent courses in advanced data structures and algorithms.
"synopsis" may belong to another edition of this title.
This long-awaited second edition of Data Structures with C++ Using STL, by Professors Ford and Topp, provides a modern object-oriented approach to data structures using the model of the Standard Template Library (STL). The authors unify the study of data structures around the concepts of containers and iterators. The book skillfully develops algorithms for the data structures and their applications. Readers will find a systematic and detailed implementation for each data structure. These successful authors offer a learning tool that is motivated by a wealth of excellent examples and complete running programs.
Professor William Ford and Professor William Topp are faculty members with the Computer Science Department, University of the Pacific, Stockton, California. They have also written Introduction to Computing with C++ and Object Technology (Prentice Hall, 1999) and Assembly Language and Systems Programming for the M68000 Family (Jones and Bartlett, 1992).
"About this title" may belong to another edition of this title.
Book Description Book Condition: Brand New. PAPERBACK,Book Condition New, Brand New, Softcover, International Edition. We Do not Ship APO FPO AND PO BOX.NOT LOOSE LEAF VERSION,NO SOLUTION MANUAL, NO CD, NO ACCESS CARD Cover Image & ISBN may be different from US edition but contents as US Edition. Printing in English language. Quick delivery by USPS/UPS/DHL/FEDEX/ARAMEX ,Customer satisfaction guaranteed. We may ship the books from Asian regions for inventory purpose. Bookseller Inventory # ABEJULNAD609
Book Description Book Condition: Brand New. PAPERBACK,Book Condition New, Brand New, Softcover, International Edition. We Do not Ship APO FPO AND PO BOX.NOT LOOSE LEAF VERSION,NO SOLUTION MANUAL, NO CD, NO ACCESS CARD Cover Image & ISBN may be different from US edition but contents as US Edition. Printing in English language. Quick delivery by USPS/UPS/DHL/FEDEX/ARAMEX ,Customer satisfaction guaranteed. We may ship the books from Asian regions for inventory purpose. Bookseller Inventory # ABEDUPPP7790
Book Description Prentice Hall, 2001. Soft cover. Book Condition: New. International Edition. This book is BRAND NEW Soft cover International edition with black and white printing. ISBN number & cover page may be different but contents identical to the US edition word by word. Book is in English language. Bookseller Inventory # stockama
Book Description Pearson, 2001. Hardcover. Book Condition: New. New. There is a slight shelf or time wear. Otherwise new.We Ship Every Day! Free Tracking Number Included! International Buyers Are Welcome! Satisfaction Guaranteed!. Bookseller Inventory # 343089168t
Book Description Pearson. Hardcover. Book Condition: New. 0130858501 New Condition. Bookseller Inventory # NEW6.0045094
Book Description Pearson, 2001. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: (Most chapters end withChapter Summary, Classes and Libraries in the Chapter, Review Exercises, Written Exercises, Programming ExercisesandProgramming Projects.) Preface. 1. Introduction to Data Structures. What is this Book About? Abstract View of Data Structures. An ADT as a Class. Implementing C++ Classes. Declaring and Using Objects. Implementing a Class with Inline Code. Application Programming Interface(API). Strings. 2. Object Design Techniques. Software Design. Handling Runtime Errors. Object Composition. Operator Overloading. 3. Introduction to Algorithms. Selection Sort. Simple Search Algorithms. Analysis of Algorithms. Analyzing the Search Algorithms. Making Algorithms Generic. The Concept of Recursion. Problem Solving with Recursion. 4. The Vector Container. Overview of STL Container Classes. Template Classes. The Vector Class. Vector Applications. 5. Pointers and Dynamic Memory. C++ Pointers. Dynamic Memory. Classes Using Dynamic Memory. Assignment and Initialization. The Minivector Class. The Matrix Class. 6. The List Container and Iterators. The List Container. Iterators. General List Insert And Erase Operations. Case Study: Graduation Lists. 7. Stacks. The Stack ADT. Recursive Code and the Runtime Stack. Stack Implementation. Postfix Expressions. Case Study: Infix Expression Evaluation. 8. Queues and Priority Queues. The Queue ADT. The Radix Sort. Implementing the Miniqueue Class. Case Study: Time-Driven Simulation. Array Based Queue Implementation. Priority Queues. 9. Linked Lists. Linked List Nodes. Building Linked Lists. Handling The Back of the List. Implementing a Linked Queue. Doubly Linked Lists. Updating A Doubly Linked List. The Josephus Problem. The Minilist Class. Selecting a Sequence Container. 10.Binary Trees. Tree Structures. Binary Tree Nodes. Binary Tree Scan Algorithms. Using Tree Scan Algorithms. Binary Search Trees. Using Binary Search Trees. Implementing the Stree Class. The Stree Iterator (Optional). 11. Associative Containers. Overview of Associative Containers. Sets. Maps. Multisets. Implementing Sets And Maps. 12. Advanced Associative Structures. Hashing. Designing Hash Functions. Designing Hash Tables. The Hash Class. Hash Table Performance. 2-3-4 Trees. Red-Black Trees. The Rbtree Class. 13. Inheritance and Abstract Classes. Inheritance in C++. The Graphics Hierarchy. The Graphics System. Safe Vectors. Ordered Lists. Polymorphism and Virtual Functions. Abstract Classes. 14. Heaps Binary Files and Bit Sets. Array Based Binary Trees. Heaps. Implementing a Priority Queue. Binary Files. Bitsets. Case Study: Huffman Compression. 15. Recursive Algorithms. Divide and Conquer Algorithms. Combinatorics. Dynamic Programming. Backtracking: The Eight-Queens Problem. 16. Graphs. Graph Terminology. The Graph Class. Graph Class Design. Graph Traversal Algorithms. Graph Traversal Applications. Graph Minimization Algorithms. Index. Bookseller Inventory # ABE_book_new_0130858501
Book Description Pearson, 2001. Hardcover. Book Condition: New. Bookseller Inventory # P110130858501
Book Description Pearson, 2001. Paperback. Book Condition: New. book. Bookseller Inventory # 0130858501
Book Description Pearson 2001-07-27, 2001. Paperback. Book Condition: New. New, clean crispAPO/FPO orders welcomed! Real World pricing and out of this world service! Orders processed every day! Thanks for shopping with us on ABE!. Bookseller Inventory # 101815-7
Book Description Prentice Hall, 2001. Paperback. Book Condition: New. 2. Bookseller Inventory # DADAX0130858501