Data structures and algorithms in C++ /

other_versions_link
Bibliographic Details
Main Author: Goodrich, Michael T.
Other Authors: Tamassia, Roberto, Mount, David
Format: Printed Book
Published: New York : Wiley, 2004.
Subjects:
C++ (Computer program language)
Data structures (Computer science)
Computer algorithms.
Online Access:http://www.loc.gov/catdir/description/wiley037/2003270372.html
http://www.loc.gov/catdir/toc/wiley032/2003270372.html
LEADER 03679cam a2200241 a 4500
020 |a 9788126562923 
082 0 0 |a 005.133c++  |b GOO-D 
100 1 |a Goodrich, Michael T. 
245 1 0 |a Data structures and algorithms in C++ / 
260 |a New York :  |b Wiley,  |c 2004. 
300 |a xv, 683 p. :  |b ill. ; 
500 |a Building on the success of Data Structures and Algorithms in Java, Goodrich/Tamassia/Mount Data Structures and Algorithms In C++ 2e offers an innovative approach to fundamental data structures and algorithms. The text incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. The authors' highly visual approach and extensive suite of web-based learning and teaching tools give computer engineers the opportunity visualize key analytic concepts, learn about the most recent insights in the field and do data structure design.  
505 |a 1. A C++ Primer. 1.1 Basic C++ Programming Elements. 1.2 Expressions. 1.3 Control Flow. 1.4 Functions. 1.5 Classes. 1.6 C++ Program and File Organization. 1.7 Writing a C++ Program. 1.8 Exercises. 2. Object-Oriented Design. 2.1 Goals, Principles, and Patterns. 2.2 Inheritance and Polymorphism. 2.3 Templates. 2.4 Exceptions. 2.5 Exercises. 3. Arrays, Linked Lists and Recursion. 3.1 Using Arrays. 3.2 Singly Linked Lists. 3.3 Doubly Linked Lists. 3.4 Circularly Linked and List Reversal. 3.5 Recursion. 3.6 Exercises. 4. Analysis Tools. 4.1 The Seven Functions Used in This Book. 4.2 Analysis of Algorithms. 4.3 Simple Justification Techniques. 4.4 Exercises. 5. Stacks, Queues and Deques. 5.1 Stacks. 5.2 Queues. 5.3 Double-Ended Queues. 5.4 Exercises. 6. List and Iterator ADTs. 6.1 Vectors. 6.2 Lists. 6.3 Sequences. 6.4 Case Study: Bubble-Sort on a Sequence. 6.5 Exercises. 7. Trees. 7.1 General Trees. 7.2 Tree Traversal Algorithms. 7.3 Binary Trees. 7.4 Exercises. 8. Heaps and Priority Queues. 8.1 The Priority Queue Abstract Data Type. 8.2 Implementing a Priority Queue with a List. 8.3 Heaps. 8.4 Adaptable Priority Queues. 8.5 Exercises. 9. Hash Tables, Maps and Skip Lists. 9.1 Maps. 9.2 Hash Tables. 9.3 Ordered Maps. 9.4 Skip Lists. 9.5 Dictionaries. 9.6 Exercises. 10. Search Trees. 10.1 Binary Search Trees. 10.2 AVL Trees. 10.3 Splay Trees. 10.4 (2,4) Trees. 10.5 Red-Black Trees. 10.6 Exercises. 11. Sorting, Sets and Selection. 11.1 Merge-Sort. 11.2 Quick-Sort. 11.3 Studying Sorting through and Algorithmic Lens. 11.4 Sets and Union/Find Structures. 11.5 Selection. 11.6 Exercises. 12. Strings and Dynamic Programming. 12.1 String Operations. 12.2 Dynamic Programming. 12.3 Pattern Matching Algorithms. 12.4 Text Compression and the Greedy Method. 12.5 Tries. 12.6 Exercises. 13. Graph Algorithms. 13.1 Graphs. 13.2 Data Structures for Graphs. 13.3 Graph Traversals. 13.4 Directed Graphs. 13.5 Shortest Paths. 13.6 Minimum Spanning Trees. 13.7 Exercises. 14. Memory Management and B-Trees. 14.1 Memory Management. 14.2 External Memory and Caching. 14.3 External Searching and B-Trees. 14.4 External-Memory Sorting. 14.5 Exercises.  
650 0 |a C++ (Computer program language) 
650 0 |a Data structures (Computer science) 
650 0 |a Computer algorithms. 
700 |a Tamassia, Roberto 
700 |a Mount, David 
856 4 2 |u http://www.loc.gov/catdir/description/wiley037/2003270372.html 
856 4 1 |u http://www.loc.gov/catdir/toc/wiley032/2003270372.html 
942 |c BK 
999 |c 51703  |d 51703 
952 |0 0  |1 0  |4 0  |6 005_000000000000000_133C_GOOD  |7 0  |9 65344  |a KU  |b KU  |c FIC  |d 2018-06-12  |e Ad.D2/5736/2013 dtd.24/11/2017  |g 689.00  |l 3  |o 005.133c++ GOO-D  |p IT01454  |r 2020-03-03  |s 2020-01-28  |w 2018-06-12  |y BK 

Similar Items