Home > Store

C++: An Introduction to Data Structures

Register your product to gain access to bonus material or receive a coupon.

C++: An Introduction to Data Structures

Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

  • Follows the ACM curriculum guidelines for the CS2 course.
  • Presents the Object-Centered-Design paradigm used in Adams/Leestma/ Nyhoff's C++: An Introduction to Computing, 2/E and culminates in true OOP (Object-Oriented Programming).
  • Emphasizes abstract data types (ADTs) throughout, reinforcing the study of data structures in the spirit of OOP.
  • Covers the containers and algorithms from the Standard Template Library, introducing the most up-to-date and powerful tools in C++.
  • Presents standard C++ throughout.
  • Includes advanced C++ topics, such as recursion, function and class templates, inheritance, and polymorphism—areas not typically covered in a first course.
  • Introduces all of the usual data structures, such as stacks and queues, building a foundation for later courses.
  • Discusses algorithm development, analysis, and verification, to provide training with important tools that will most likely be needed in future computer science work.
  • Covers C-style topics appropriate in a data structures course, thus, preparing future programmers to use both C-style data structures and the many standard C++ tools and types.
  • Offers more than 1,000 exercises consisting of written exercises, programming problems, and projects.
  • A website maintained by the author contains supplementary materials, including source code. See the text's PH catalog page.

Description

  • Copyright 1999
  • Edition: 1st
  • Book
  • ISBN-10: 0-02-388725-7
  • ISBN-13: 978-0-02-388725-3


U5076-7

“The presentation is excellent, good writing style, supportive and well-placed illustrations; and a variety of exercises reinforcing the concepts.” —Adair Dingle, Seattle University

“This is one of the very few books that I have seen that combines foundations of software engineering with an introduction to computer science in some detail and introduces topics that are only covered in advanced courses. It is very important that our students start to learn these fundamental issues as early as possible.” —Mansour Zand, University of Nebraska

KEY FEATURES:

  • Covers the data structures recommended in the ACM curriculum guidelines
  • Problem-solving methodology is used consistently in examples and applications
  • Incorporates an Object-Centered Design paradigm developed by the author that culminates in true object-oriented programming
  • Includes coverage of containers and algorithms from C++'s standard library
  • Advanced C++ features such as recursion, function and class templates, inheritance, and polymorphism are covered

C++: An Introduction to Data Structures is a superior learning tool that includes numerous examples, applications, exercise sets, programming projects, quick quizzes, programming pointers, and ADT tips. Supplements for an instructor teaching a data structures course include a solutions manual, PowerPoint lecture presentations, source code, electronic art files, companion Web site, and a lab manual.

Sample Content

Table of Contents



 1. Software Engineering.


 2. Introduction to Data Structures and Abstract Data Types—C-Style Types.


 3. More About Data Structures and ADTs—C++ Types.


 4. Stacks.


 5. Queues.


 6. Improving ADTs—Part 1: Templates and Standard Containers.


 7. Improving ADTs—Part 2: Recursion, Algorithm Analysis, and Standard Algorithms.


  8. Lists.


  9. Other Linked Structures.


10. Binary Trees.


11. Sorting.


12. OOP and ADTs.


13. Trees.


14. Graphs and Digraphs.


Appendix A: ASCII Character Set.


Appendix B: Number Systems.


Appendix C: Basic C++.


Appendix D: Other C++ Features.


Appendix E: Answers to Quick Quizzes.


Index.

Preface

This text is designed for the course CS2 as described in the curriculum recommendations of the ACM (Association of Computing Machinery). It aims to meet the major objectives of this course as spelled out in these recommendations, one of which is:

  • To continue developing a disciplined approach to the design, coding, and testing of programs written in a high-level language.
This text continues the Object-Centered-Design paradigm developed in the C++ text of which I am one of the authors-C++: An Introduction to Computing-and culminates in true OOP (Object-Oriented Programming), which has become the modus operandi in programming and system development. It also continues the coverage of C++, including more advanced topics not usually covered in a first course and that students need to learn such as recursion, function and class templates, inheritance, and polymorphism. Standard C++ as prescribed in the final November 1997 ANSI/ISO draft is used throughout.

Two other objectives of CS2 are:
  • To teach the use of data abstraction using as examples data structures other than those normally provided as basic types in current programming languages; for example, linked lists, stacks, queues, and trees.
  • To provide an understanding of the different implementations of these data structures.
This text emphasizes abstract data types (ADTs) throughout. It is a study of data structures in the spirit of OOP. All of the usual data structures are covered as recommended. It also treats the containers and algorithms from the Standard Template Library, which are up-to-date and powerful standard data types and tools in C++. In addition, some of the C-style topics appropriate in a data structures course are included, because many students will get jobs as C programmers; many libraries are written in C; C-style data structures are usually implemented very efficiently; and they are often used to implement some of the more modern standard data types.

Another objective of the CS2 course is:
  • 8To introduce searching and sorting algorithms and their analysis. Both searching and sorting are covered in detail in the text. It also covers algorithm development, analysis, and introduces algorithm verification, thus providing a first look at important tools for later courses in computer science.
The curriculum recommendations also include the following objective for the CS2 course:
  • To provide an introduction to the various areas of computer science and thereby provide a foundation for further studies in computer science.
This text continues the portrayal of the discipline of computer science begun in C++: An Introduction to Computing by including examples and exercises from different areas of computer science in an attempt to provide a foundation for further study in theoretical and/or applied computer science. The topics include:

  • A description of the software development process.
  • Abstract data types
  • Object-oriented programming
  • Computational complexity of algorithms, illustrated by the analysis of standard searching and sorting algorithms
  • An introduction to correctness proofs
  • Data encryption schemes (DES and public key)
  • Data compression using Huffman codes
  • Doubly-linked lists and large integer arithmetic
  • Random number generation and simulation
  • Lexical analysis and parsing
  • Reverse Polish notation and generation of machine code
  • Simple systems concepts such as input/output buffers, parameter-passing mechanisms, address translation, and memory management
SUPPLEMENTARY MATERIALS
A number of supplementary materials have been planned for this text:
  • A solutions manual containing solutions to all of the exercises and many of the programming problems (available from the publisher to instructors who adopt the text for use in a course)
  • A companion website (www.prenhall.com/nyhoff) containing presentation slides, source code, and additional resources.
  • A lab manual containing tested lab exercises that coordinate with the text (sold separately)
ACKNOWLEDGMENTS
I express my sincere appreciation to all who helped in any way in the preparation of this text. I especially thank my editor Laura Steele, whose support and encouragement have kept me going and whose friendship over the past several years has made textbook writing for Prentice Hall an enjoyable experience. My gratitude for friendship, perceptive suggestions and directions, and unflagging support and encouragement goes to Alan Apt, a publisher respected throughout the publishing and academic communities. I also appreciate the management of reviews and mega-many other details handled so promptly and with pleasant demeanor by Assistant Editor (extraordinaire) Kate Kaibni. I must also thank Assistant Managing Editor Eileen Clark, Art Director Heather Scott, Production Editors Sharyn Vitrano and Ann Marie Kalajian and all the others who did such a fantastic job of designing this attractive book and actually getting it into print. Their attention to details has compensated for my lack thereof and their cooperation and kind words were much appreciated. I also owe a debt of gratitude to Ralph Ewton (Univ. of Texas-El Paso) whose thorough, painstaking, and perspicacious comments, criticisms, and suggestions have strengthened the presentation immensely. I also appreciate the following reviewers of the manuscript for their many valuable observations and recommendations: Adair Dingle (Seattle Univ.), Jens Gregor (Univ. of Tennessee), Bob Holloway (Univ. of Wisconsin), Robin Rowe (SAIC, Pt. Loma Research Center), Andrew Sung (New Mexico Tech), and Mansour Zand (Univ. of Nebraska). Of course, I must once again pay homage to my wife Shar and our children and grandchildren-Jeff, Dawn, Rebecca, Megan, and Sara; Jim; Greg, Julie, Joshua and Derek; Tom and Joan-for their love and understanding through all the times that their needs and wants were slighted by my busyness. Above all, I give thanks to God for giving me the opportunity, ability, and stamina to prepare this text.

Larry Nyhoff

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020