CS 251: Material Covered
Week 16
PSO: Project 5; review questions
- 12/12: Review
- 12/10: Spatial Data Structures
- 12/8: Geometric applications of binary search trees
Week 15
PSO: discuss Project 5
- 12/5: Using range queries to solve spatial problems
- 12/3: Huffman codes; Quiz 3 (in class)
- 12/1: Data Compression
Week 14
PSO: no PSO's
- 11/28: no class (Thanksgiving Break)
- 11/26: no class (Thanksgiving Break)
- 11/24: Substring Searching, Project 5 Discussion
Week 13
PSO: use of data structures iin graph algorithms, Project 4
- 11/21: Ternary Tries, Suffix Tries
- 11/19: Tries
- 11/17: Shortest Paths - Bellman-Ford
Week 12
PSO:
- 11/14: Shortest and Longest Paths in a dag
- 11/12: Shortest Paths - Dijkstra
- 11/10: Prim's Algorithm for MST; shortest paths
Week 11
PSO: Project 4, Midterm 2 related
- 11/7: no class (Midterm 2 make-up)
- 11/5: Q&A for Midterm 2 (exam is @ 6:30pm)
- 11/3: Minimum spanning trees (Kruskal, Union-Finds)
Week 10
PSO: Q&A Quiz2, Project 3 Q&A
- 10/31: Minimum spanning trees
- 10/29: Topologiocal sort
- 10/27: DFS preorder, postorder orderings; dags;
Week 9
PSO: Recursion from problem Set 1, Debugging with Eclipse, Project 3 Q&A
- 10/24: Applications of graph traversals; directed graphs
- 10/22: Depth first search, Quiz 2 (in class)
- 10/20: Breadth first search; uses of BFS
Week 8
PSO: no PSOs
- 10/17: Introduction to graphs; representations, undirected graphs
- 10/15: Hashing: double hashing, quadratic hashing, expected performance bounds
- 10/13: no class (October break)
Week 7
PSO: Review search trees, problem set 1 Q&A
- 10/10: no class (Midterm 1 make-up)
- 10/8: Hashing: hash functions, chaining, linear probing
- 10/6: Red Black Trees 2
Week 6
PSO: Project 2 Q&A. Midterm questions. Search tree examples.- 10/3: Red Black-Trees 1
- 10/1: 2-3 trees
- 9/29: Binary search trees, 2-3 trees
Week 5
PSO: Project 2 Q&A.
- 9/26: Introduction to symbol tables
- 9/24: Q&A for Exam 1 (exam is @ 6:30pm)
- 9/22: Non-comparison based sorting (Counting, Bucket, Radix)
Week 4
PSO: Project 1, analysis of simulation; review of quiz questions
- 9/19: Heapsort; stable sorting algorithms. Project 2 posted
- 9/17: Heaps and Heapsort I
- 9/15: Quicksort; Quiz 1 (in class)
Week 3
PSO: Project 1 Q&A, review of clicker questions
- 9/12: Mergesort
- 9/10: Elementary Sorts
- 9/8: Analyzing the performance II
Week 2
PSO: Java coding style guidelines, turnin process, Q&A on material covered in class
- 9/5: Analyzing the performance I
- 9/3: Resizing arrays. Stacks: operations and implementations. Project 1 posted.
- 9/1: Labor day (no class, no PSOs)
Week 1
no PSOs
- 8/29: More on recursion; Queues: operations and dimplementations
- 8/27: Review of prooof techniques and recursion
- 8/25: Course overview and organization