
Data Structures & Algorithms C++
Glenn Rowe(Author)
Prentice Hall (Publisher)
Published on 20. August 1996
Book
Paperback/Softback
384 pages
978-0-13-579178-3 (ISBN)
Description
This book presents the fundamentals of data structures from an object oriented perspective. The text uses C++, whose classes and object oriented constructs are specifically designed to efficiently implement data structures. The opening chapters introduce the ideas behind OOP and C++ and once the principles are explained, the book develops to deal with data structures and algorithms fom an OO point of view. All the standard data structures are described, including stacks, queues, sets, linked lists, trees and graphs. In addition to the algorithms dealing with these data structures, searching and sorting algorithms are also studied. A non-mathematical approach is adopted for the study of algorithm efficiency. Rather than derive analytic expressions for the number of steps taken by various alorithms, programs are written which count the number of steps and draw graphs of these numbers as functions of the size of the data sets being processed. The Graphs are then transformed to obtain the orders of the algorithms.
More details
Language
English
Place of publication
Upper Saddle River
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 21 mm
Weight
590 gr
ISBN-13
978-0-13-579178-3 (9780135791783)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
1. Object Oriented Programming.
2. Classes and Objects.
3. The Elements of C++.
4. Constructors and Deconstructors.
5. Functions and Operator Overloading.
6. Inheritance.
7. Stacks and Queues.
8. Templates.
9. Sets.
10. Linked Lists.
11. Searching Algorithms.
12. Sorting Algorithms.
13. Tables and Hashing Trees Graphs.
2. Classes and Objects.
3. The Elements of C++.
4. Constructors and Deconstructors.
5. Functions and Operator Overloading.
6. Inheritance.
7. Stacks and Queues.
8. Templates.
9. Sets.
10. Linked Lists.
11. Searching Algorithms.
12. Sorting Algorithms.
13. Tables and Hashing Trees Graphs.