Harvard |

Harvard

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008667643/catalog> ?p ?o. }

Showing items 1 to 34 of 34 with 100 items per page.

catalog abstract ""The second edition continues to provided students with the fundamentals of data structures. It also teaches how to use the C++ Standard Library container classes through: revised interfaces for the principal example classes, which are compliant with the ANSI/ISO C++ Standard Library classes; optional material on Standard Library iterators; thorough coverage of the role of the const keyword in the C++ Standard Library; coverage of new C++ features such as namespaces, static member constants, and the typename keyword; extended coverage of inheritance; and extensive pedagogical features such as programming tips and pitfalls, exercises, and new programming projects."--Jacket.".
catalog alternative "Data structures and other objects using C++".
catalog contributor b12142489.
catalog contributor b12142490.
catalog created "c2001.".
catalog date "2001".
catalog date "c2001.".
catalog dateCopyrighted "c2001.".
catalog description ""The second edition continues to provided students with the fundamentals of data structures. It also teaches how to use the C++ Standard Library container classes through: revised interfaces for the principal example classes, which are compliant with the ANSI/ISO C++ Standard Library classes; optional material on Standard Library iterators; thorough coverage of the role of the const keyword in the C++ Standard Library; coverage of new C++ features such as namespaces, static member constants, and the typename keyword; extended coverage of inheritance; and extensive pedagogical features such as programming tips and pitfalls, exercises, and new programming projects."--Jacket.".
catalog description "1 Phases of Software Development 1 -- 1.1 Specification, Design, Implementation 3 -- 1.2 Running Time Analysis 14 -- 1.3 Testing and Debugging 24 -- 2 Abstract Data Types and C++ Classes 30 -- 2.1 Classes and Members 31 -- 2.2 Constructors 42 -- 2.3 Using a Namespace, Header File, and Implementation File 48 -- 2.4 Classes and Parameters 60 -- 2.5 Operator Overloading 71 -- 3 Container Classes 91 -- 3.1 Bag Class 92 -- 3.2 Programming Project: The Sequence Class 119 -- 3.3 Interactive Test Programs 128 -- 4 Pointers and Dynamic Arrays 140 -- 4.1 Pointers and Dynamic Memory 141 -- 4.2 Pointers and Arrays as Parameters 152 -- 4.3 Bag Class with a Dynamic Array 162 -- 4.4 Prescription for a Dynamic Class 181 -- 4.5 Programming Project: The String Class 183 -- 4.6 Programming Project: The Polynomial 198 -- 5 Linked Lists 205 -- 5.1".
catalog description "381 -- 8.3 Implementations of the Queue Class 397 -- 8.4 Priority Queues 410 -- 8.5 Reference Return Values for the Stack, Queue, and Priority Queue Classes 412 -- 9 Recursive Thinking 418 -- 9.1 Recursive Functions 419 -- 9.2 Studies of Recursion: Fractals and Mazes 429 -- 9.3 Reasoning about Recursion 441 -- 10 Trees 453 -- 10.1 Introduction to Trees 454 -- 10.2 Tree Representations 459 -- 10.3 Binary Tree Nodes 464 -- 10.4 Tree Traversals 479 -- 10.5 Binary Search Trees 497 -- 11 Tree Projects 517 -- 11.1 Heaps 518 -- 11.2 B-Trees 524 -- 11.3 Trees, Logs, and Time Analysis 549 -- 12 Searching 558 -- 12.1 Serial Search and Binary Search 559 -- 12.2 Open-Address Hashing 569 -- 12.3 Chained Hashing 586 -- 12.4 Time Analysis of Hashing 588 -- 13 Sorting 595 -- 13.1 Quadratic Sorting Algorithms 596 -- 13.2 Recursive Sorting Algorithms".
catalog description "608 -- 13.3 An O(n log n) Algorithm Using a Heap 629 -- 13.4 Standard Library Sorting Functions 640 -- 14 Derived Classes and Inheritance 646 -- 14.1 Derived Classes 646 -- 14.2 Simulation of an Ecosystem 655 -- 14.3 Virtual Member Functions and a Game Class 675 -- 15 Graphs 695 -- 15.1 Graph Definitions 695 -- 15.2 Graph Implementations 703 -- 15.3 Graph Traversals 716 -- 15.4 Path Algorithms 726 -- Appendix A Ascii Character Set 745 -- Appendix B Further Big-O Notation 746 -- Appendix C Precedence of Operators 748 -- Appendix D Compiling, Linking, and Running Programs 749 -- Appendix E Dealing with Older Compilers 752 -- Appendix F Input and Output in C++ 754 -- Appendix G Selected Library Functions 762 -- Appendix H Brief Reference for the Standard Template Classes 765 -- Appendix I A Toolkit of Useful Functions 772 -- Appendix J Fundamental Style Guide".
catalog description "775 -- Appendix K Downloading the GNU Compiler and Software 776.".
catalog description "A Fundamental Node Class for Linked Lists 206 -- 5.2 A Linked List Toolkit 215 -- 5.3 Bag Class with a Linked List 243 -- 5.4 Programming Project: The Sequence Class with a Linked List 259 -- 5.5 Dynamic Arrays vs Linked Lists vs. Doubly Linked Lists 261 -- 6 Software Development with Templates, Iterators, and the Standard Library 270 -- 6.1 Template Functions 271 -- 6.2 Template Classes 281 -- 6.3 Standard Template Classes and Their Iterators 292 -- 6.4 Node Template Class 301 -- 6.5 An Iterator for Linked Lists 313 -- 6.6 Linked List Version of the Bag Template Class with an Iterator 322 -- 7 Stacks 337 -- 7.1 Introduction to Stacks and the STL Stack 337 -- 7.2 Stack Applications 342 -- 7.3 Implementations of the Stack Class 354 -- 7.4 More Complex Stack Applications 362 -- 8 Queues 377 -- 8.1 Introduction to Queues and the STL Queue 377 -- 8.2 Queue Applications".
catalog description "Includes bibliographical references and index.".
catalog extent "xxxi, 783 p. :".
catalog identifier "0201702975 (pbk.)".
catalog issued "2001".
catalog issued "c2001.".
catalog language "eng".
catalog publisher "Boston, MA : Addison Wesley Longman,".
catalog subject "005.7/3 21".
catalog subject "C++ (Computer program language)".
catalog subject "Data structures (Computer science)".
catalog subject "Object-oriented programming (Computer science)".
catalog subject "QA76.73.C153 M25 2001".
catalog tableOfContents "1 Phases of Software Development 1 -- 1.1 Specification, Design, Implementation 3 -- 1.2 Running Time Analysis 14 -- 1.3 Testing and Debugging 24 -- 2 Abstract Data Types and C++ Classes 30 -- 2.1 Classes and Members 31 -- 2.2 Constructors 42 -- 2.3 Using a Namespace, Header File, and Implementation File 48 -- 2.4 Classes and Parameters 60 -- 2.5 Operator Overloading 71 -- 3 Container Classes 91 -- 3.1 Bag Class 92 -- 3.2 Programming Project: The Sequence Class 119 -- 3.3 Interactive Test Programs 128 -- 4 Pointers and Dynamic Arrays 140 -- 4.1 Pointers and Dynamic Memory 141 -- 4.2 Pointers and Arrays as Parameters 152 -- 4.3 Bag Class with a Dynamic Array 162 -- 4.4 Prescription for a Dynamic Class 181 -- 4.5 Programming Project: The String Class 183 -- 4.6 Programming Project: The Polynomial 198 -- 5 Linked Lists 205 -- 5.1".
catalog tableOfContents "381 -- 8.3 Implementations of the Queue Class 397 -- 8.4 Priority Queues 410 -- 8.5 Reference Return Values for the Stack, Queue, and Priority Queue Classes 412 -- 9 Recursive Thinking 418 -- 9.1 Recursive Functions 419 -- 9.2 Studies of Recursion: Fractals and Mazes 429 -- 9.3 Reasoning about Recursion 441 -- 10 Trees 453 -- 10.1 Introduction to Trees 454 -- 10.2 Tree Representations 459 -- 10.3 Binary Tree Nodes 464 -- 10.4 Tree Traversals 479 -- 10.5 Binary Search Trees 497 -- 11 Tree Projects 517 -- 11.1 Heaps 518 -- 11.2 B-Trees 524 -- 11.3 Trees, Logs, and Time Analysis 549 -- 12 Searching 558 -- 12.1 Serial Search and Binary Search 559 -- 12.2 Open-Address Hashing 569 -- 12.3 Chained Hashing 586 -- 12.4 Time Analysis of Hashing 588 -- 13 Sorting 595 -- 13.1 Quadratic Sorting Algorithms 596 -- 13.2 Recursive Sorting Algorithms".
catalog tableOfContents "608 -- 13.3 An O(n log n) Algorithm Using a Heap 629 -- 13.4 Standard Library Sorting Functions 640 -- 14 Derived Classes and Inheritance 646 -- 14.1 Derived Classes 646 -- 14.2 Simulation of an Ecosystem 655 -- 14.3 Virtual Member Functions and a Game Class 675 -- 15 Graphs 695 -- 15.1 Graph Definitions 695 -- 15.2 Graph Implementations 703 -- 15.3 Graph Traversals 716 -- 15.4 Path Algorithms 726 -- Appendix A Ascii Character Set 745 -- Appendix B Further Big-O Notation 746 -- Appendix C Precedence of Operators 748 -- Appendix D Compiling, Linking, and Running Programs 749 -- Appendix E Dealing with Older Compilers 752 -- Appendix F Input and Output in C++ 754 -- Appendix G Selected Library Functions 762 -- Appendix H Brief Reference for the Standard Template Classes 765 -- Appendix I A Toolkit of Useful Functions 772 -- Appendix J Fundamental Style Guide".
catalog tableOfContents "775 -- Appendix K Downloading the GNU Compiler and Software 776.".
catalog tableOfContents "A Fundamental Node Class for Linked Lists 206 -- 5.2 A Linked List Toolkit 215 -- 5.3 Bag Class with a Linked List 243 -- 5.4 Programming Project: The Sequence Class with a Linked List 259 -- 5.5 Dynamic Arrays vs Linked Lists vs. Doubly Linked Lists 261 -- 6 Software Development with Templates, Iterators, and the Standard Library 270 -- 6.1 Template Functions 271 -- 6.2 Template Classes 281 -- 6.3 Standard Template Classes and Their Iterators 292 -- 6.4 Node Template Class 301 -- 6.5 An Iterator for Linked Lists 313 -- 6.6 Linked List Version of the Bag Template Class with an Iterator 322 -- 7 Stacks 337 -- 7.1 Introduction to Stacks and the STL Stack 337 -- 7.2 Stack Applications 342 -- 7.3 Implementations of the Stack Class 354 -- 7.4 More Complex Stack Applications 362 -- 8 Queues 377 -- 8.1 Introduction to Queues and the STL Queue 377 -- 8.2 Queue Applications".
catalog title "Data structures & other objects using C++ / Michael Main, Walter Savitch.".
catalog title "Data structures and other objects using C++".
catalog type "text".