Data Structures And Program Design In Pascal

Data Structures and Program Design in Pascal

KEY BENEFIT: Designed for those with an introductory knowledge of programming and problem solving in Pascal, this book uses discussions, examples, exercises, complete programs, and sample runs to expose users to more advanced techniques. Covers topics such as software development; data structures and abstract data types; strings; stacks; queues; algorithms and recursion; lists; other linked structures; binary trees; sorting; sorting and searching files; trees; graphs and digraphs; object-and oriented programming.

Data Structures and Program Design in Pascal

Data Structures in Pascal

This is a revision of the authors 1982 volume into Pascal, the language most widely used for teaching data structures. Data structures are central to computer science, and in particular to programming. In the analytic areas, appropriate data structures have been the key to advances in the design of algorithms. Once appropriate data structures are carefully defined, all that remains is routine coding. A comprehensive understanding of data structure techniques is essential in the design of algorithms and programs. This text presents a carefully chosen fraction of available material, but supplement it with a wide variety of exercises. No single book can discuss all known data structures or algorithms. This text presents the art of designing data structures, preparing the student to devise special-purpose structures for specific problems as they present themselves.