Welcome to ITK 279: Algorithms and Data Structures
Spring, 2006
Grades on WebCT (login required)
| Week | Date | Reading Assignment for this class | Assignments due | Topic |
| 1 | 1/18/06 | None | None | Introduction |
| 1/20/06 | Sections 1.1-1.4 | None | Review of Recursion | |
| 2 | 1/23/06 |
Finish Chapter 1 |
|
Pointers |
| 1/25/06 | None | Questionnaire Email to mecaliff@ilstu.edu |
Dynamic Memory Management | |
| 1/27/06 | Read chapter 2 | None | Dynamic Memory Management Algorithm Analysis |
|
| 3 | 1/30/06 | None | None | Algorithm Analysis |
| 2/1/06 | Read 3.1-3.5 | Chapter 2, ex. 7,11 (a, c, d) and 12 (a,c,d) | Linked Lists | |
| 2/3/06 | Finish reading chapter 3 | Chapter 1, ex. 1 Chapter 3, ex. 1-2 |
Linked Lists, cont. | |
| 4 | 2/6/06 | Read 4.1-4.2, 4.6 | Chapter 3, ex. 4-5 | Linked Lists Stacks |
| 2/8/06 | None | None | Queues Trees |
|
| 2/10/06 | Read 6.1-6.3 | Chapter 4, ex 1-2 | Binary Trees | |
| 5 | 2/13/06 | Read 6.4 | Chapter 4, ex. 8 | Priority Queues |
| 2/15/06 | Read 7.1-7.4 | None | Sorting | |
| 2/17/06 | Read 7.5-7.6 | Programming Assignment 1 Chapter 6, ex. 2-3 | Simple sorts Shellsort |
|
| 6 | 2/20/06 | Read 7.7 |
Chapter 7, ex 1 with insertion sort, bubble sort, and selection sort |
Heapsort Merge sort |
| 2/22/06 | None | Chapter 7, exercises 11, 12, 15 | Exam review | |
| 2/24/06 | None | None | Exam 1 | |
| 7 | 2/27/06 | Read 7.9-7.10 | None |
Quicksort Bucket sort |
| 3/1/06 | Read 4.3-4.4 | Chapter 7, exercise 19 | Dictionary ADT Binary Search Trees |
|
| 3/3/06 | None | NO CLASS | ||
| 8 | 3/6/06 | Read 4.5 | Chapter 4, exercise 9 Programming Assignment 2 |
Binary Search Trees AVL trees |
| 3/8/06 | Read 4.7 | Chapter 4, exercise 19 | Splay trees | |
| 3/10/06 | Read 5.1-5.4 | Chapter 4, exercise 27 |
B-trees Hashing |
|
| SPRING BREAK | NO SCHOOL | |||
| 9 | 3/20 | Finish chapter 5 | Paper 1 See Friday's slides for assignment |
Hashing |
| 3/22 | No new reading | None (postponed) | Hashing cont. | |
| 3/24 |
Read 8.1-8.4 |
Chapter 5, exercise 1 | Disjoint sets | |
| 10 | 3/27 | Finish chapter 8 | Prog3, part 1 | Disjoint sets Introduction to graphs |
| 3/29 | Read 9.1-9.3 | Chapter 5, exercise 19 | Topological sort | |
| 3/31 | Read 9.4 | Chapter 8, exercises 1-2 | Shortest Paths | |
| 11 | 4/3 | Read 9.5 | Programming Assignment 3 | Critical Paths Transitive Closure All ShortestPaths Network Flow |
| 4/5 | Read 9.6 | Chapter 9, exercises 1, 5 and 7a | Network Flow Minimum Spanning Trees Graph searching |
|
| 4/7 | Finish chapter 9 | Chapter 9, exercises 11, 15 and 16 |
Exam review
NP-completeness |
|
| 12 | 4/10 | None | None | Exam 2 |
| 4/12 | Read 10.1 | Research paper topic paragraph | NP-completeness | |
| 4/14 | None | Take home part of exam due | Greedy algorithms | |
| 13 | 4/17 | Read 10.2 | (postponed) | Greedy algorithms |
| 4/19 | None | Programming Assignment 4 | Greedy algorithms | |
| 4/21 | Read 10.3 | Chapter 10, Exercise 3 | Divide-and-conquer Dynamic Programming |
|
| 14 | 4/24 | None | Chapter 10, exercise 10 | Dynamic Programming |
| 4/26 | Read 10.4 | Chapter 10, exercise 28 |
Dynamic Programming Random numbers |
|
| 4/28 | None | Rough drafts of research paper | Peer review day | |
| 15 | 5/1 | Read 10.5 | Chapter 10, exercise 31 |
SkipLists Backtracking |
| 5/3 | Read 12.2 | Programming Assignment 5 | Backtracking Red-black trees |
|
| 5/5 | None | Research Paper | Final review |