Data Structures and Algorithms: A First Course

All young computer scientists who aspire to write programs must learn something about algorithms and data structures. This book does exactly that. Based on lecture courses developed by the author over a number of years the book is written in an informal and friendly way specifically to appeal to students.
The book is divided into four parts: the first on Data Structures introduces a variety of structures and the fundamental operations associated with them, together with descriptions of how they are implemented in Pascal; the second discusses algorithms and the notion of complexity; Part III is concerned with the description of successively more elaborate structures for the storage of records and algorithms for retrieving a record from such a structure by means of its key; and finally, Part IV consists of very full solutions to nearly all the exercises in the book.

I Data Structures.- 1 Arrays, Records and Linked Lists.- 1.1 Arrays.- 1.2 Storage of arrays.- 1.3 Records.- 1.4 Linked lists.- 1.5 Exercises 1.- 2 Stacks and Queues.- 2.1 Stacks.- 2.2 Applications of stacks.- 2.3 Queues.- 2.4 Exercises 2.- 3 Binary Trees.- 3.1 Binary trees.- 3.2 Binary search trees.- 3.3 Exercises 3.- 4 Heaps.- 4.1 Priority queues and heaps.- 4.2 Exercises 4.- 5 Graphs.- 5.1 Graphs and their implementation.- 5.2 Graph traversals.- 5.3 Exercises 5.- II Algorithms.- 6 Algorithms and Complexity.- 6.1 Algorithms.- 6.2 Complexity of algorithms.- 6.3 Exercises 6.- 7 Sorting Algorithms.- 7.1 Internal sorting by comparisons.- 7.2 Other internal sorting algorithms.- 7.3 External sorting algorithms.- 7.4 Exercises 7.- 8 Graph Algorithms.- 8.1 Shortest path algorithms.- 8.2 Spanning tree algorithms.- 8.3 Exercises 8.- 9 Some Miscellaneous Algorithms.- 9.1 Numerical multiplication algorithms.- 9.2 Matrix multiplication algorithms.- 9.3 A stable marriage algorithm.- 9.4 Exercises 9.- III Storing and Searching.- 10 Storing in Arrays and Lists.- 10.1 Sequential and binary searching.- 10.2 Hashing.- 10.3 Exercises 10.- 11 Storing in Binary Trees.- 11.1 Storing in binary search trees.- 11.2 Storing in AVL-trees.- 11.3 Exercises 11.- 12 Storing in Multiway Trees.- 12.1 Multiway search trees.- 12.2 B-trees.- 12.3 Tries.- 12.4 Exercises 12.- IV Solutions.- 13 Solutions to Exercises 1.- 14 Solutions to Exercises 2.- 15 Solutions to Exercises 3.- 16 Solutions to Exercises 4.- 17 Solutions to Exercises 5.- 18 Solutions to Exercises 6.- 19 Solutions to Exercises 7.- 20 Solutions to Exercises 8.- 21 Solutions to Exercises 9.- 22 Solutions to Exercises 10.- 23 Solutions to Exercises 11.- 24 Solutions to Exercises 12.