Data Structures using C++

Davender Sadhana Malik

990 pages, parution le 14/04/2003

Ajouter à une liste

Indisponible

Résumé

Data Structures Using C++ is the ground-breaking, definitive text for the CS2 course. This text was written and designed with the student in mind. Success with C++ will come easily through the numerous clear and concise explanations and examples. Data Structures Using C++ offers comprehensive coverage of all CS2 topics such as Structured Template Libraries, Binary Search Trees, Graph Algorithms, and Searching and Sorting.

Programming examples are complete programs featured at the end of each chapter
containing the accurate, concrete stages of Input, Output, Problem Analysis and
Algorithm Design, and a Complete Program Listing.
Quick Review offers a summary of the concepts covered within the chapter.
Exercises test the student's ability to label declarations and statements as valid or
invalid.
Programming Exercises challenge students to write C++ programs with a specified
outcome.
Notes highlight important facts regarding the concepts.
Numbered Examples within each chapter illustrate the programming concepts with
relevant code.

Contents

1. Software Engineering Principles and C++ Classes
2. Object-Oriented Design (OOD) and C++
3. Pointers and Array-Based Lists
4. Standard Template Library (STL)
5. Linked Lists
6. Recursion
7. Stacks
8. Queues
9. Search Algorithms
10. Sorting Algorithms
11. Binary Trees
12. Graphs
13. Standard Template Library (STL) II
Appendix A Reserved Words
Appendix B Operator Precedence
Appendix C Character Sets
Appendix D Operator Overloading
Appendix E Header Files
Appendix F Additional C++Topics
Appendix G C++ for Java Programmers
Appendix H References
Appendix I Answers to Selected Exercises

L'auteur - Davender Sadhana Malik

Creighton University, Omaha, NE, USA.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Thomson
Auteur(s)	Davender Sadhana Malik
Parution	14/04/2003
Nb. de pages	990
Format	18,5 x 23,,5
Couverture	Broché
Poids	1455g
Intérieur	Noir et Blanc
EAN13	9780619159078
ISBN13	978-0-619-15907-8