Homework Assignments

Homework Assignment 1

Due Jan. 20, 2010

This assignment reviews basic material (first three chapters of the book).

Clarifications

Notes about STL

For all of the programming assignments, you will be free to use STL vector, list, stack, and queue classes, but no other STL classes. Remember, you must fully understand how all operations work in any included code in order to be able to properly analyze the space and time complexity of your own code.

In general, since you will be learning how to implement good algorithms, use of the STL algorithm sort, or the list member function sort is not allowed (but see below for exceptions).

Be sure to credit all sources for any code that you did not write yourself! Any code you turn in must be written according to the style guidelines for this class, which includes (among other things) headers that include an asymptotic analysis of space and time complexity.

NOTE: Homework assignments are also available on prime/p1/p2 clients. These files are in the same format as the lecture notes. You can find them in ~cs404/homework. You can print them in the same way as the lecture notes.

Class Homepage

David M. Chelberg <chelberg@ohiou.edu>

Last modified: Fri Nov 20 15:08:55 EST 2009