C++: An Introduction to Data Structures

C++: An Introduction to Data Structures

A text for the Computer Science 2 course as described in the curriculum recommendations of the Association of Computing Machinery. Covers developing a disciplined approach to designing, coding, and testing programs written in a high-level language; using data abstractions as examples of data structures other than those normally provided as basic types in current programming languages; understanding the different implementations of the data structures; searching, sorting, and analyzing algorithms; and laying a foundation for further studies in computer science. Uses object-oriented programming, which has become the standard in programming and system development. Annotation c. by Book News, Inc., Portland, Or. Read the full review of this book. C++: An Introduction to Data Structures , by Larry Nyhoff, is an undergraduate course text on data structures and associated algorithms as expressed in the C++ language.It is an extraordinary textbook forming an excellent introduction to the discipline of programming. Writing textbooks is much harder than writing general computing books. While authors writing for general publication can cater to their own tastes, textbook authors must strive for both orthogonality and breadth, knowing the reader's exposure to the matters under discussion may be limited for years to those encountered in the textbook. At the same time, the presentation must make the topics memorable. Nyhoff, of the Calvin College Department of computer science (Grand Rapids, Michigan), succeeds in satisfying these goals. The presentation is both rich and well targeted to undergraduates. It is written in a style surprisingly engaging even for the expert. This is the clearly one of the best volumes of its genre. The book is about data structures in the classic sense: Nyhoff might have titled the book Algorithms + Data Structures = Programs if Niklaus Wirth hadn't already used the title in the 1960s. C++: An Introduction to Data Structures deals broadly with basic computational algorithms, examining in painstaking detail the data structures that empower the algorithms, from scalars to members of the Standard Template Library. --Jack Woehr , Dr. Dobb's Journal -- Dr. Dobb's Journal 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: 8 To 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 fu