Data Structures in C++
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > Data Structures in C++: Using the Standard Template Library (STL)
Data Structures in C++: Using the Standard Template Library (STL)

Data Structures in C++: Using the Standard Template Library (STL)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Timothy Budd takes an exciting new approach to teaching data structures by incorporating the power of the Standard Template Library (STL). This book represents a reversal of the traditional presentation. Before concentrating on writing programs, Dr Budd emphasizes how to use a standard abstraction. Working with this standard library, students will master the fundamentals of data structures and learn the power of C++, allowing them to carry their knowledge to later courses and into their careers. While the major topics have remained similar to the author's earlier book, Classic Data Structures in C++, the implementations have been completely revised. Since data structures are assumed to exist in the programming environment from the start, the presence of the STL permits reordering of topics within each chapter. Data Structures in C++ Using the STL. begins each new data structure by describing a typical use of the data structure. Dr Budd then typically gives an overview of all the operations of the data structure, and only lastly presents an implementation. The implementations are, in most cases, simplified from the standard library versions. Highlights * Teaches data structures in the context of the C++ Standard Template Library * Instructs the use of analysis techniques with which to evaluate algorithms * Provides examples of modern software engineering principles and techniques, including object-oriented programming * Introduces the proper use of various features of the C++ programming language 0201308797B04062001

Table of Contents:
I. FUNDAMENTAL TOOLS Fundamentals. The Study of Data Structures. Language Fundamentals. Classes and Object-Oriented Programming. The Card Game WAR. The Class Card. The Class Deck. The Class Player. The Game Itself. Making an Interactive Game. Accessor and Mutator Functions. Algorithms — Descriptions of Behavior. Properties of Algorithms. Recipes as Algorithms. Analyzing Computer Algorithms. Recursive Algorithms. Analyzing Execution Time. Algorithmic Analysis and Big-Oh Notation. Algorithmic Execution Time of Programming Constructs. Summing Algorithmic Execution Times. Benchmarking Actual Execution Times. Increasing Confidence in Correctness. Program Proofs. Program Testing. II. THE STANDARD CONTAINERS. The Standard Library Container Classes. Container Classes. Selecting a Container. Iterators. The String Data Type. The String Data Abstraction. Problem Solving with Strings. String Operations. The Implementation of Strings. Vectors — A Random Access Data Structure. The Vector Data Abstraction. Templates. Problem Solving with Vectors. Summary of Vector Operations. The Implementation of Vector. Implementing Generic Algorithms. Lists — A Dynamic Data Structure. The List Data Abstraction. Summary of List Operations. Example Programs. An Example Implementation. Variation Through Inheritance. Stacks and Queues. The Stack and Queue Data Abstractions. Adapters. Stacks. Queues. Deques — Double Ended Data Structures. The Deque Abstraction. Application - Depth and Breadth First Search. Application - A Framework for Backtracking. An Implementation. Set and Multisets. The Set Data Abstraction. Set Operations. Bit Vector Sets. The Set Data Type. Summary of Operations for Class Set. An Implementation of Class Set. Trees — A Nonlinear Data Structure. Properties of Trees. Binary Trees. Operator Precedence Parsing. Tree Traversals. Binary Tree Representation of General Trees. Searching. Divide and Conquer. Ordered Vectors. Balanced Binary Search Trees. Application - Tree Sort. Finding the Nth Largest. Priority Queues. The Priority Queue Data Abstraction. Heaps. Skew Heaps. Application - Discrete Event-Driven Simulation. Maps and Multimaps. The Map Data Abstraction. Example Programs. Operations on Maps. An Example Implementation. III. OTHER CONTAINERS. Hash Tables. The Hash Table Abstraction. Hash Functions. Collision Resolution Using Buckets. Hash Table Sorting Algorithms. The Hash_Table Data Type. Hash Functions. Matrics — Two Dimensional Data Structures. The Matrix Data Abstraction. Matrices as Vectors of Vectors. Sparse Matrices. Non-Integer Index Values. Graphs. The Graph Data Abstraction. Adjacency Matrix Representation. Edge List Representation. Weighted Adjacency Matrix. Sparse Matrix Representation. Finite Automata. Turing Machines. Files — External Collections. The File Data Abstraction. Character Stream Operations. Application - Lexical Analysis. Application - File Merge Sort. Binary Files. IV. APPENDICES. 0201308797T04062001

About the Author :
Timothy A. Budd is an Associate Professor of Computer Science at Oregon State University. Budd received his Bachelor of Arts degree in Mathematics and Computer Science from Western Washington University, and his masters and doctorate degrees in computer science from Yale University. His research interests include multi-paradigm programming languages, programming environments, compiler implementation and optimization techniques. 0201308797AB04062001


Best Sellers


Product Details
  • ISBN-13: 9780201308792
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 196 mm
  • No of Pages: 576
  • Sub Title: Using the Standard Template Library (STL)
  • Width: 241 mm
  • ISBN-10: 0201308797
  • Publisher Date: 30 Sep 1997
  • Binding: Hardback
  • Language: English
  • Spine Width: 25 mm
  • Weight: 953 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Structures in C++: Using the Standard Template Library (STL)
Pearson Education (US) -
Data Structures in C++: Using the Standard Template Library (STL)
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 in C++: Using the Standard Template Library (STL)

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!