|Week||Homework assignments||Extra material||Reading assignments||Tests|
|13.||Homework 10||Graph theory ppt||Notes, Chapter 12|
|12.||Homework 9||Priority queues ppt||Notes: Chapters 10, 11.|
|10.||Homework 8||Sorting ppt||Notes: Chapters 8 and 9.||Midterm 2: Tuesday, November 12, 2013.|
Covers: tables, trees, tail recursion.
|9.||Homework 7||Trees ppt||Notes: Chapter 7|
|8.||Homework 6||Trees ppt||Notes: Chapter 6|
|5.||Homework 5||Tables ppt||Textbook: Chapter 8|
Notes: Chapters 4 and 5
|Midterm 1: Tuesday, October 8, 2013.|
Covers everything up to (including) Measuring algorithm performance
|4.||Homework 4||Complexity ppt||Textbook: Chapter 3|
Notes: Chapter 3
|3.||Homework 3||Stacks and queues ppt||Textbook: Chapter 4|
Notes: Chapters 1 and 2
|2.||Homework 2||Texbook: chapter 5.2|
Notes (pdf): Chapter 0
|1.||Homework 1||Introduction ppt||Textbook, Chapters 1 and 2|
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 Oncourse 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: