|
SPRING 2000, CS 4/56101 |
||||
|
|
||||
|
|
|
|
|
|
| JAN 19 | L01 | 1 | Introduction: Game of Life | |
|
|
||||
| 24 | L02 | 2 | Algorithm Design Principals: Game of Life-2 | A#1 |
| 26 | L03a | 3 | Recursion-I: Concepts: Fact., T. of Hanoi | |
| 31 | L03b | 4 | Recursion-II: Principles: 8-queen, Tail Rec. | |
| 2 | L04a | 5 | Review: Search: sequential & binary search | |
| 7 | L04b | 6 | Analysis of bounds of current and future search algorithms | A#2, PR0J-1 |
| 9 | L05 | 7 | Analysis Tools, Asymptotics, comparison trees, Big-Oh | |
| 14 | L06 | 8 | Sorting I: insertion, selection, shell sort | |
| 16 | L07 | 9 | Sorting II: merge sort, quick sort | |
| 21 | L08a | 10 | Sorting III: Random variables, binomial distribution | A#3, PROJ-2 |
| 23 | L08b | 11 | Sorting IV: counting, radix and bucket sort | |
| 28 | L09 | 12 | Hashing-I: tables, index, hash functions, collision resolution, chaining, open addressing, linear and quadretic probing. | |
| MAR 1 | 13 | Hashing-II:
analysis of chaining, linear, and random probing.
MIDTERM review |
||
| 6 | L10a | 14 | Binary tree-I: treesearch, treesort | A#4, PROJ-3 |
| 8 | 15 | MIDTERM | ||
| 13 | L10b | 16 | Binary tree-II: AVL tree, Fibonacci series | |
| 15 | L11a | 17 | Binary tree-III: Splay tree, Amortization analysis | PROJ-3 Prop Due. |
| SB | SPRING BREAK MARCH 20-26 | |||
| 27 | L11b | 18 | Binary tree-IV: heapsort | |
| 29 | 19 | Priority queues | ||
| APR 3 | L12 | 20 | Multiway Trees-I: trees, tries, B-trees | A#5 |
| 5 | 21 | Multiway Trees: red-black trees | ||
| 10 | L13 | 22 | Graphs-I: representation, traversal | |
| 12 | 23 | Graph-II: topological sorting, shortest path | ||
| 17 | L14 | 24 | Graph-III: Min. spanning tree, All-pair shortest path | |
| 19 | L15 | 25 | String
Matching-I: Rabin Karp algorithm
String Matching-II: Knuth-Morris-Prat algorithm |
|
| 24 | L16 | 26 | *Dynamic
Programming: Chain Matrix
*Dynamic Programming: Optimum Triangulation |
A#5 Due |
| 26 | 27 | *Dyanmic
Programming: 1/0 Knapsack
Review for Final |
||
| MAY 1 | 28 | FINAL PROJECT DEFENSE | PROJ#3 Due | |
| 3 | 29 | ENDTERM | ||
| EXAM WEEK | ||||
| * All assignments and projects are due at the delivery date of the next one. | ||||