Emphasizing C programming style, this text presents traditional material on data structures within the framework of abstraction, programme design, correctness and efficiency. Delayed coverage of sorting allows for integration of earlier material, and demonstrates the intimate relationship between data structures and algorithm design. An optional overview of the C programming language is included in early chapters. A student laboratory manual packaged with the text contains directed project and laboratory work tied to chapters in the text. The DRUIDS Software (Display Resource for Understanding Internal Data Structures) is included with the Lab Manual. This software animates algorithms discussed in the text and allows students own code to be linked and animated.
Emphasizing C programming style, this text presents traditional material on data structures within the framework of abstraction, programme design, correctness and efficiency. Delayed coverage of sorting allows for integration of earlier material, and demonstrates the intimate relationship between data structures and algorithm design. An optional overview of the C programming language is included in early chapters. A student laboratory manual packaged with the text contains directed project and laboratory work tied to chapters in the text. The DRUIDS Software (Display Resource for Understanding Internal Data Structures) is included with the Lab Manual. This software animates algorithms discussed in the text and allows students own code to be linked and animated.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Maße
ISBN-13
978-0-534-94738-5 (9780534947385)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
1. Abstraction and Structure. 2. C Basics. 3. Data Types in C. 4. Program Design. 5. Program Correctness. 6. Program Efficiency. 7. Abstract Data Types (ADTs). 8. Sequential ADTs. 9. Searching Index. 10. Non-sequential ADTs. 11. Balanced Trees. 12. Hashing. 13. Priority Queues. 14. Graphs. 15. Sorting.