[5/07/2006]
A couple of points about the final exam:
- If there is a question about Shell Sort, increments(s) will be provided
- If there is a question about Merge Sort, there will be no need to worry about what to do with an odd number of records
| Course: | CSCI 464: Data Structures |
| Meeting time: | 6:30 - 7:45 p.m., TTh |
| Classroom: | PM 252 |
| Syllabus: | The course syllabus can be found in Notes and Examples. Homework assignments and other materials can be found below |
| Bookshelf: | Text reference material for this course can be found at: http://www.cs.niu.edu/csci/464/books.shtml |
| Schedule: | The schedule of lectures and reading assignments can be found at http://www.cs.niu.edu/csci/464/schedule.shtml |
| Instructor: | Michael Stack |
| Office: | PM 566 |
| Phone: | 753-9447 |
| Office Hours: | 1:30 p.m. - 3:30 p.m., TTh
7:45 p.m. - 8:45 p.m., TTh (may end earlier if no appointments and no walk-ins) |
| Email: | mstack@niu.edu |
| Assistant: | Milica Kozomara |
| Office: | PM 254 |
| Phone: | 753-3935 |
| Office Hours: | 3:00 p.m. - 6:00 p.m., TTh |
| Email: | milica.kozomara@gmail.com |
| Assignment | Run Date & Time | Due Date & Time |
|---|---|---|
| 1 - Hand Assembly | N/A | Tue, Jan 31, 6:30 p.m. |
| 2 - Base Register Replacement | Thu, Feb 16, 4:30 p.m. | Thu, Feb 16, 6:30 p.m. |
| 3 - Linear Lists: Stacks and Queues | Thu, Mar 2, 4:30 p.m. | Thu, Mar 2, 6:30 p.m. |
| 4 - Topological Sort | Thu, Mar 23, 4:30 p.m. | Thu, Mar 23, 6:30 p.m. |
| 5 - Recursive Inorder Traversal of a Binary Tree | Thu, Apr 6, 4:30 p.m. | Thu, Apr 6, 6:30 p.m. |
| 6 - Hand in the logic to be used for BalTreSI | N/A | Mon, Apr 10, 6:30 p.m. |
| 6 - Balanced Tree Search and Insertion | Thu, Apr 20, 4:30 p.m. | Thu, Apr 20, 6:30 p.m. |
| 7 - Quicksort | Tue, May 2, 4:30 p.m. | Tue, May 2, 6:30 p.m. |
[5/07/2006] A couple of points about the final exam:
| Event | Date and Time | Location |
|---|---|---|
| Final exam (comprehensive) | Tue, May 9, 6:30-8:20 p.m. | PM 252 |