COP-3530, Data Structures Lectures
- May 12, 14, 16, 19: Algorithm Analysis
- Read Chapter 2
- Big-Oh
- Maximum subsequence sum examples
- Discussion of Assignment #1
- String class
- May12.java source code from Lecture #1.
- May14.java source code from Lecture #2.
- May19.java source code from Lecture #4.
- May 21, 23: Recursion
- Divide-and-conquer
- May21.java source code from Lecture #5.
- Recursion on 2-d arrays
- May23.java source code from Lecture #6.
- May23a.java alternate version with minor cleanup
and sharing of MyPosition objects.
- Assignment #2
- May 26: Memorial Day, University Closed
- May 28: Maps
- Assignment #2 continues
- May28.java source code from Lecture #7.
- May 30, June 2, 4, 6: ArrayList, Inner Classes, Linked Lists, Lambdas
- Read Chapter 3
- May30.java source code from Lecture #8.
- June04.java source code from Lecture #9, 10, 11.
- Additional source code for ArrayList, LinkedList, and using Comparators from
the textbook is also available.
- June 9, 11, 13: Binary Search Trees
- June 16: Binary Search Trees Continued
- Recursive algorithms on trees; traversals
- June 18: AVL Trees
- June 20: Review
- June 23: Midterm Exam
- June 25: Priority Queues and Binary Heaps
- June 27, 30, July 2: Graphs
- July 7, 9, 11, 14, 16, 18: Hash Tables
- Read Chapter 5.1 to 5.5
- July09.java writing classes with equals/hashCode, String hashCode collisions
- July14.java separate chaining implementation with rehashing, remove, iteration
- July 21, 23, 25: Sorting
- Aug 1: Final Exam