Dana Vrajitoru

C243 Data Structures


Final: Wednesday, May 2.
Week Homework assignments Extra material Reading assignments Tests
13. Homework 11 Notes, Chapter 16.
13. Homework 10 Notes, Chapter 13.
12. Homework 9 Notes, Chapter 13.
11. Homework 8 Notes, Chapter 11. Midterm 2: Monday, April 2.
Covers hash tables, trees, and priority queues.
10. Homework 8 Notes, Chapter 11.
8. Homework 7 Notes, Chapters 7, 8.
7. Homework 6 Notes, Chapter 05.
6. Homework 5 Notes, Chapter 04.
4. Homework 4 Notes, Chapter 03. Midterm 1: Wednesday, February 15.
Covers up to introduction to algorithm complexity (including).
3. Homework 3 Notes, Chapters 01 and 02.
2. Homework 2 Notes, Chapter 00
1. Homework 1 Textbook, Chapter 1

Spring 2012 schedule: MW 10:00 - 11:50 pm NS 204.

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 Analysis in C++, 2nd edition, by M. A. Weiss, used as a reference.

Grading system:

Guidelines for assignments:

Programming environment:


Last updated: January 18, 2012.
danav@cs.iusb.edu.