Dana Vrajitoru

C243 Data Structures

Week Homework assignments Extra material Reading assignments Tests
10. Homework 10 Graph Theory pptx
Heapsort pptx swf
Priority queues pptx
Notes, Chapter 12
9. Homework 9 Sorting ppt Notes, Chapters 10 and 11 Midterm 2: Tuesday, November 11, 2014
Covers the Tables and Trees chapters.
8. Homework 8 Binary Trees ppt Notes, Chapters 8 and 9
7. Homework 7 Binary Trees ppt Notes, Chapters 7 and 8
6. Homework 6 Binary Trees ppt Notes, Chapter 7
5. Homework 5 Tables ppt Notes, Chapters 4 & 5 Midterm 1: Tuesday, October 7
Covers everything up to (including) Measuring algorithm performance
4. Homework 4 Complexity ppt Notes, Chapter 3
3. Homework 3 Stacks and queues ppt Notes, Chapters 1 and 2
2. Homework 2 Notes, Chapter 0
1. Homework 1 Introduction ppt Textbook, Chapters 1 and 2

Fall 2014 schedule: TR 5:00 - 6:50 pm NS 223.

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 2014.
d v r a j i t o   a t   i u s b   d o t   e d u.