The course focuses in chapters 6-12. Chapter 1-5 serve primarily as review chapters. Supplementary Texts Data Structures and Algorithms, A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, 1983. Used as the 251 text in previous years. Contains a good treatment of data structures.
Students often find parts hard to read and dislike the use of Pascal.
A data structure as well as algorithms text. Data structures are well explained and motivated. Chapter 26 contains material on range searching covered in class. Practical Algorithms for Programmers, A. Binstock and J. Rex, Addison-Wesley, 1995. A useful reference book on data structures and algorithms.