CISC 3130 - Data Structures

Homework policies:

Collaborations in small groups are allowed (and encouraged) but ultimately, each student is responsible for handing in his/her own unique solutions. In particular, copying and pasting someone else's solution is considered plagiarism and will not be tolerated. Additionally, every student is expected to be able to explain fully the solutions he/she turned in (i.e. don't give me solutions that you don't understand, just because you got them from your friends).
The homeworks will consist of a mix of programming projects and theoretical exercies
Submit homeworks both as print-outs to the instructor and through blackboard BEFORE the beginning of class on the day of the deadline. Please also turn in solutions in paper form (this includes the coding exercises). I will send back grades and comments in at most one week.

Homework No.	Date Posted	Date due	Link	Solution	Comments
1	1/31	2/9	hw1	C++ Revision, especially pointers and dynamic memory allocation
2	1/31	2/28	hw2	Dynamic arrays using minimal space
3	2/28	3/6	hw3	Dequeues and resizing efficiently
4	2/28	3/20	hw4	Dequeues and Sparse arrays with linked lists
5	3/13	4/24	hw5	N/A	Experimental analysis of sorting algorithms
6	4/10	5/15	hw6	Binary search trees. Make up HW due on final exam day