Text
Data Structures
In Data Structures, Rick Decker presents a unified approach to the classic data structures-the most commonly applied methods for representing information in a computer program. A single conceptual model is used for all data structures. As each data structure is introduced, it is explained in terms of the model and fully implemented, often in more than one way. In addition, time and space bounds are explained for each implementation.
Most of the standard sorting and searching algorithms are explained and used to illustrate the appropriate data structures.
This text is designed for sophomore and junior level computer science students who are familiar with Pascal. To pique students' interest in com- puter science, more advanced topics are introduced throughout, such as file management, compiler design and parsing, operating systems, formal languages and automata, and complexity theory.
Distinguishing features include:
• The use of each data structure is reinforced through one or more com- puter science applications. For instance, Chapter 3 concludes a discus- sion of lists with a section on memory management.
• Detailed coverage of recursion and recursive data structures is provided in Chapter 5, along with comparisons of iterative and recursive techniques.
• An open-ended problem of text regeneration using a Markov model con- cludes the text in Chapter 10. Four different approaches are presented, each of which includes a complete program written and run on a real computer/compiler system.
O
Appendices on relations, mathematical prerequisites, and random numbers and simulation provide all necessary mathematics review. • Nearly 200 illustrations and 300 end-of-chapter exercises comb 36 easy study aids.
</li><li>Bab 1.Introduction
</li><li>Bab 2.Lineaers Structures
</li><li>Bab 3.Nonliniear Strustures
Tidak tersedia versi lain