COP-3530, Data Structures Lectures
- Jan 10: Administrivia
- Jan 10, 12, 17: Java Review
- Jan 19, 24: The Collections API
- Jan 26, 31, Feb 2: Algorithm Analysis
- Read Chapter 5
- Big-Oh
- Maximum subsequence sum examples
- Feb 7, 9: Recursion
- Feb 14, 16: More Algorithm Analysis
- Single-operation costs
- Singly, and doubly linked lists
- Day11.java: linked list code from class.
- Logarithms
- Binary search
- Mergesort (Section 8.5)
- Divide-and-conquer analysis
- Feb 21 Review
- Feb 23: Midterm
- Feb 28, Mar 1: Binary search trees
- MyTreeSetDemo.java source code from class.
- Insertion, find, deletion
- size, height, toString
- Implementation of contains and add
- Mar 6: AVL Trees
- Mar 8 and 20: Priority Queues
- Mar 13 and 15: SPRING BREAK NO CLASSES
- Mar 22 and 27: Shortest Paths
- Read Section 14.3
- Discussion of Assignment #5
- Mar 29: Disjoint Set Maintanence
- Read Chapter 24 (but not 24.6)
- Apr 3: Minimum Spanning Trees
- Apr 5, 10: Hash Tables
- Chapter 20 and 6.7.2.
- Discussion of Java 1.5 Collections API:
HashSet, HashMap, equals,
and hashcode
- Sample code
- Apr 12, 17: Sorting
- Read Chapter 8
- Heapsort
- Quicksort
- Lower bounds for sorting
- Apr 19: TBA
-
TUESDAY APRIL 24 12:00 PM - 2:00 PM: Final Exam