Homework Assignment 1

Due tbd

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

Clarifications

Important Note: To be fair to everyone, due dates are final. Programs will be electronically submitted, and the precise time stamp on the submission will determine the timeliness of the assignment. Programs submitted after the due date, but within 4 hours, are subject to 5% late penalty. Programs more than 4 hours late will lose 10% per day for each day or fraction of a day late. So the maximum score for a program 1 minute late is 95%. The maximum score for a program 2 days late is 80%.

It is a very good idea to start programming assignments as soon as you get them. They are much easier to do without the pressure of a deadline, and you give yourself time to seek help if you should need it.

All programming homework assignments must be written in C++ and run on the odd machines (those in Stocker 307). These machines have names like odd01.cs.ohio.edu, etc. Be sure to test your code on these machines to be sure you will get full credit for your code. If you haven't coded for a while you may need to contact Mr. Tysko (tysko@ohio.edu) to get a password for the odd machines. Your account name is the same as on p1/p2/etc.

Since we will be testing on these machines, it would behoove you to be sure to test/develop your code on the same machines.

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 specific assignments 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.

Class Homepage

David M. Chelberg <chelberg@ohio.edu>
last-modified: Sun Aug 16 20:42:41 2020