HOME > Detail View

Detail View

Data structures and algorithms in C++ / 2nd ed

Data structures and algorithms in C++ / 2nd ed (Loan 2 times)

Material type
단행본
Personal Author
Goodrich, Michael T. Tamassia, Roberto, 1960-. Mount, David M.
Title Statement
Data structures and algorithms in C++ / Michael T. Goodrich, Roberto Tamassia, David M. Mount.
판사항
2nd ed.
Publication, Distribution, etc
Hoboken, N.J. :   Wiley,   c2011.  
Physical Medium
xxii, 714 p. : ill. ; 24 cm.
ISBN
9780470383278 (pbk.)
요약
"An updated, innovative approach to data structures and algorithms Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++. The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. Offers a unique multimedia format for learning the fundamentals of data structures and algorithms Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design Provides clear approaches for developing programs Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms."--
Content Notes
Machine generated contents note: -- Chapter 1 - Basic C++ Programming. -- Chapter 2 - Object-Oriented Design. -- Chapter 3 - Analysis Tools. -- Chapter 4 - Stacks, Queues, and Recursion. -- Chapter 5 - Vectors, Lists, and Sequences. -- Chapter 6 - Trees. -- Chapter 7 - Priority Queues. -- Chapter 8 - Dictionaries. -- Chapter 9 - Search Trees. -- Chapter 10 - Sorting, Sets, and Selection. -- Chapter 11 - Text Processing. -- Chapter 12 - Graphs. -- Appendix: Useful Mathematical Facts.
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
C++ (Computer program language). Data structures (Computer science). Computer algorithms. COMPUTERS / Programming Languages / C++
000 00000cam u2200205 a 4500
001 000046074925
005 20210325094521
008 210324s2011 njua b 001 0 eng
010 ▼a 2011002034
020 ▼a 9780470383278 (pbk.)
035 ▼a (KERIS)REF000016197052
040 ▼a DLC ▼c DLC ▼d DLC ▼d 211009
042 ▼a pcc
050 0 0 ▼a QA76.73.C153 ▼b G63 2011
082 0 4 ▼a 005.133 ▼2 23
084 ▼a 005.133 ▼2 DDCK
090 ▼a 005.133 ▼b G655dt2
100 1 ▼a Goodrich, Michael T.
245 1 0 ▼a Data structures and algorithms in C++ / ▼c Michael T. Goodrich, Roberto Tamassia, David M. Mount.
250 ▼a 2nd ed.
260 ▼a Hoboken, N.J. : ▼b Wiley, ▼c c2011.
300 ▼a xxii, 714 p. : ▼b ill. ; ▼c 24 cm.
504 ▼a Includes bibliographical references and index.
505 8 ▼a Machine generated contents note: -- Chapter 1 - Basic C++ Programming. -- Chapter 2 - Object-Oriented Design. -- Chapter 3 - Analysis Tools. -- Chapter 4 - Stacks, Queues, and Recursion. -- Chapter 5 - Vectors, Lists, and Sequences. -- Chapter 6 - Trees. -- Chapter 7 - Priority Queues. -- Chapter 8 - Dictionaries. -- Chapter 9 - Search Trees. -- Chapter 10 - Sorting, Sets, and Selection. -- Chapter 11 - Text Processing. -- Chapter 12 - Graphs. -- Appendix: Useful Mathematical Facts.
520 ▼a "An updated, innovative approach to data structures and algorithms Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++. The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. Offers a unique multimedia format for learning the fundamentals of data structures and algorithms Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design Provides clear approaches for developing programs Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms."-- ▼c Provided by publisher.
650 0 ▼a C++ (Computer program language).
650 0 ▼a Data structures (Computer science).
650 0 ▼a Computer algorithms.
650 7 ▼a COMPUTERS / Programming Languages / C++ ▼2 bisacsh.
700 1 ▼a Tamassia, Roberto, ▼d 1960-.
700 1 ▼a Mount, David M.
945 ▼a KLPA

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.133 G655dt2 Accession No. 121256851 Availability Equip on Reservation Bookshelf Due Date Make a Reservation Available for Reserve(1persons reqested this item) R Service M

Contents information

Author Introduction

마이클 T. 굿리치(지은이)

Department of Computer Science University of California, Irvine

Roberto Tamassia(지은이)

Department of Computer Science Brown University

Information Provided By: : Aladin

Table of Contents

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. A Useful Mathematical Facts. Bibliography. Index.

New Arrivals Books in Related Fields

Ramamurthy, Bina (2021)
윤관식 (2020)