Data Structures: Lecture Notes

Lecture 1: Object Oriented Programming in Java. 9/6.
Lecture 2: Abstract Methods and Interfaces 9/8.
Lecture 3, Recursion, 9/13 is given by Prof. Korth.
Lecture 4: Generics. 9/15.
Lecture 5: Linked Lists. 9/20.
Lecture 6: More Lists. 9/22.
Lecture 7: Hash tables 9/27.
Lecture 8: More on hash functions. 9/29
Second half of lecture 8. (Note: This will not be either on exams or problem sets.) Using Hashing for Large Sets of Large Objects
Lecture 9: Trees 10/4.
Lecture 10: More Trees 10/6, 10/18.
Lecture 11: Binary Search Trees 10/20.
Lecture 12: Set Operations. Prefix and postfix notations. 10/25.
Lecture 13: Order of magnitude, worst-case, asymptotic analysis.
Lecture 15: Heap sort
Lecture 16: Merge sort
Lecture 17: Quick sort
Lecture 18: Linear time sorts
Lecture 19: Graphs
Lecture 20: Exception handling
Lecture 21: Two-three trees
Lecture 22: B-Trees