|Week||Homework assignments||Topics||Reading assignments||Tests|
|11.||Homework 11||Graph theory, Union/Find data structure||Notes, Chapter 12||Final: Monday, December 11|
Comprehensive, more focus on the second part.
|10.||Homework 10||Priority queues, Graph theory||Notes, Chapters 10, 12|
|9.||Homework 9||Red-Black trees, tail recursion, sorting||Notes, Chapters 6, 9, 11|
|8.||Homework 8||Binary search trees, AVL trees||Notes, Chapters 8 and 9|
|7.||Homework 7||Binary trees, Binary search trees||Notes, Chapters 7 and 8|
|6.||Homework 6||Binary trees||Notes, Chapter 7||Midterm: Wednesday, October 11|
Covers everything up to (including) tables.
|5.||Homework 5||Algorithm complexity, Hash Tables||Notes, Chapters 3, 4, and 5|
|4.||Homework 4||Algorithm complexity||Notes, Chapter 3|
|3.||Homework 3||Stacks and Queues||Notes, Chapters 1 and 2|
|2.||Homework 2||Linked Lists||Notes, Chapter 0.5|
|1.||Homework 1||Introduction, C201 review||Notes, Chapter 0|
Prerequisite: C201 Computer Programming II, C151 Multi-user Operating Systems (co-requisite).
Textbook: A set of class notes for this course written by
Dr. D. Vrajitoru will be available as a PDF file on Canvas as the
main resource. Do not print this file in the Linux labs.
Data Structures and Algorithm in C++, by M. Goodrich, R. Tamassia, and D. Mount, used as a reference.
Guidelines for assignments: