Welcome to ITK 279: Algorithms and Data Structures
Fall, 2006
Grades on WebCT (login required)
Instructions for Using Exceed on Demand
| Week | Date | Reading Assignment for this class | Assignments due | Topic |
| 1 | 8/21/06 | None | None | Introduction |
| 8/23/06 |
Weiss, 1.1-1.4 |
None | Review of recursion | |
| 8/25/06 | Weiss, remainder of chapter 1 (optional: Savitch, ch. 10) |
Questionnaire Email to mecaliff@ilstu.edu |
Recursion Pointers |
|
| 2 | 8/28/06 | None | Chapter 1, exs. 5 and 6 | Dynamic Memory Management |
| 8/30/06 | Weiss, chapter 2 (optional: Savitch, ch. 8) |
None | Dynamic Memory Management | |
| 9/1/06 | None | Chapter 1, ex. 1 | Dynamic Classes Algorithm Analysis |
|
| 3 | 9/4/06 | None | None | No class - Labor day |
| 9/6/06 | Weiss, 3.1-3.5 | Dynamic Array exercise (see WebCT) | Algorithm Analysis Linked Lists |
|
| 9/8/06 | Finish chapter 3 of Weiss | Chapter 2, ex. 7,11 (a, c, d) and 12 (a,c,d) | Linked Lists Stacks and Queues |
|
| 4 | 9/11/06 | Weiss, 4.1-4.2, 4.6 | Chapter 3, ex. 1,2 | Stacks Queues |
| 9/13/06 | None | Chapter 3, ex. 4,5 | Binary Trees | |
| 9/15/06 | Weiss, 6.1-6.4 | Chapter 4, ex. 1,2 (exercise 8 postponed) |
Traversals Priority Queues Heaps |
|
| 5 | 9/18/06 | Weiss, 7.1-7.4 | Chapter 4, ex 8 | Heaps |
| 9/20/06 | Weiss, 7.5 | Chapter 6, ex. 2,3 | Sorting | |
| 9/22/06 | 7.6-7.7 | Elementary sorting exercise (see WebCT) Program 1 |
Shellsort Heapsort Mergesort |
|
| 6 | 9/25/06 | 7.8-7.10 | Chapter 7, ex. 4, 11, 12 | Mergesort Quicksort |
| 9/27/06 | Finish chapter 7 | Chapter 7, ex 15, 19 | Exam review Bucket Sort External sorting |
|
| 9/29/06 | None | None | Exam 1 | |
| 7 | 10/2/06 | Weiss, 4.3-4 | None | Binary Search Trees AVL trees |
| 10/4/06 | Weiss, 4.5 | Chapter 4, exercise 9 | Splay trees | |
| 10/6/06 | Weiss, 4.7-4.8 | Chapter 4, exercise 19 Program 2 |
B-trees | |
| 8 | 10/9/06 | Weiss, 5.1-5.3 | Chapter 4, exercise 27 | Class cancelled |
| 10/11/06 | Finish chapter 5 | None | B-trees Hashing |
|
| 10/13/06 | Read 8.1-8.4 | Paper 1 B-tree exercise (see WebCT) |
Hashing, cont. | |
| 9 | 10/16/06 | Finish chapter 8 | Chapter 5, exercise 1 | Extendible Hashing Disjoint Sets |
| 10/18/06 | Weiss, 9.1 | Chapter 5, exercise 19 | Disjoint Sets, cont Graphs |
|
| 10/20/06 | Weiss, 9.2-9.3 | Prog 3 part 1 | Graphs | |
| 10 | 10/23/06 | Weiss, 9.4 | Chapter 8, exercises 1-2 | Graph Algorithms, cont. |
| 10/25/06 | Weiss, 9.5 | Chapter 9, exercises 1, 5, 7a | Graph Algorithms, cont. | |
| 10/27/06 | Weiss, 9.6 | Program 3 due | Graph Algorithms, cont. | |
| 11 | 10/30/06 | Weiss, 9.7 | Chapter 9, exercises 11, 15, 16 | Searching Complexity |
| 11/1/06 | Weiss.10.1 | None | NP Complete problems Greedy Algorithms |
|
| 11/3/06 | None | None | Exam 2 | |
| 12 | 11/6/06 | None | Take home part of Exam 2 | Greedy Algorithms |
| 11/8/06 | Weiss, 10.2 | chapter 10, exercise 3 | Bin Packing | |
| 11/10/06 | None | Chapter 10, exercise 10 | Divide and Conquer | |
| 13 | 11/13/06 | Weiss, 10.3 | None | Selection Dynamic Programming |
| 11/15/06 | 10.4 | Chapter 10, exercise 28 (postponed to 11/17) | Dynamic Programming, cont. | |
| 11/17/06 | None |
Chapter 10, exercise 28
|
Optimal Binary Search Trees Random Numbers |
|
| Thanksgiving break | ||||
| 14 | 11/27/06 | 10.5 | Chapter 10, exercise 31 | Skiplists Backtracking |
| 11/29/06 | None | Chapter 10, exercise 36 May turn in 31 |
Backtracking Minimax/Alpha-beta pruning |
|
| 12/01/06 | None | Rough draft of research paper | class cancelled for weather | |
| 15 | 12/04/06 | None | Rough draft | Peer review |
| 12/06/06 | 12.2 | Program 5 due Chapter 10, exercise 43 |
Red-black trees | |
| 12/08/06 | None | Research paper due | ||
| 16 | 12/12/06 | Take-home due at 7:50 Extra credit program due by 11:55 pm |
Final exam at 7:50 AM on Tuesday |