Dana Vrajitoru

C243 Data Structures


Week Homework assignments Topics Reading assignments Tests
12. Homework 11 Finite Graphs Notes, Chapter 12 Final: Thursday, December 17, 2015.
11. Homework 10 Finite Graphs Notes, Chapter 12
10. Homework 9 Binary Search Trees, Sorting Notes, Chapters 6, 8, 9, 11
9. Homework 8 Binary Search Trees, AVL trees Notes, Chapters 7 and 8
8. Homework 7 Binary Trees, BST Notes, Chapters 6 and 7
7. Homework 6 Binary Trees Notes, Chapter 6
6. Binary Trees Notes, Chapter 6 Midterm 1: Tuesday, October 6
Covers chapters 0, 1, 2, 3.
5. Homework 5 Tables Notes, Chapters 4 and 5
4. Homework 4 Measuring Algorithm Performance Notes, Chapter 3
3. Homework 3 Stacks and Queues Notes, Chapters 1 and 2
2. Homework 2 Linked Lists Notes, Chapter 0
1. Homework 1 Introduction Notes, Chapter 0

Fall 2015 schedule: TR 7:00 - 8:50 pm NS 225.

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.

Grading system:

Guidelines for assignments:

Programming environment:


Last updated: August 2015.
d v r a j i t o   a t   i u s b   d o t   e d u.