---

CS 302 - Fundamental Algorithms Spring Semester 2001, Sections 29059/29062

Textbook: Data Structures & Problem Solving Using JAVA by Mark Allen Weiss (2nd Ed., Addison Wesley). Click here for online information about this book from the publisher. Possible online textbook suppliers are: Bookpool and Efollet.

Table of Contents I. Tour of JAVA Chapter 1 Primitive JAVA Chapter 2 Reference Types Chapter 3 Objects and Classes Chapter 4 Inheritance II. Algorithms and Building Blocks Chapter 5 Algorithm Analysis Chapter 6 The Collections API Chapter 7 Recursion Chapter 8 Sorting Algorithms Chapter 9 Randomization III. Applications Chapter 10 Fun and Games Chapter 11 Stacks and Compilers Chapter 12 Utilities Chapter 13 Simulation Chapter 14 Graphs and Paths IV. Implementations Chapter 15 Inner Classes and ArrayList Chapter 16 Stacks and Queues Chapter 17 Linked Lists Chapter 18 Trees Chapter 19 Binary Search Trees Chapter 20 Hash Tables Chapter 21 A Priority Queue: The Binary Heap V. Advanced Data Structures Chapter 22 Splay Trees Chapter 23 Merging Priority Queues Chapter 24 The Disjoint Set Class Appendix A: Operators Appendix B: Graphical User Interfaces Appendix C: Bitwise Operators Index

---