Data Structures & Algorithms C++
Seiten
1996
Prentice Hall (Verlag)
978-0-13-579178-3 (ISBN)
Prentice Hall (Verlag)
978-0-13-579178-3 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
A complete introduction to the topic of data structures and algorithms, approached from an object-oriented perspective, using C++. All data structures are described, including stacks, queues, sets, linked lists, trees and graphs. Searching and sorting algorithms are also studied.
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.
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.
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.
Erscheint lt. Verlag | 20.8.1996 |
---|---|
Verlagsort | Upper Saddle River |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 590 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Software Entwicklung ► Objektorientierung | |
Informatik ► Theorie / Studium ► Algorithmen | |
ISBN-10 | 0-13-579178-2 / 0135791782 |
ISBN-13 | 978-0-13-579178-3 / 9780135791783 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
objektorientierte Entwicklung modularer Maschinen für die digitale …
Buch | Hardcover (2024)
Hanser (Verlag)
CHF 62,95
Entwicklung von GUIs für verschiedene Betriebssysteme
Buch (2023)
Hanser, Carl (Verlag)
CHF 55,95
Principles and Practice Using C++
Buch | Softcover (2024)
Addison Wesley (Verlag)
CHF 119,95