CS 2250 -- Data Structures and Problem Solving

Instructor: Sanjiv K. Bhatia

Office Hrs Tuesday and Thursday; 11:00am -- 12:00pm, 4:30pm -- 5:30pm
Prerequisites CS 125
Textbooks K. N. King. C Programming: A Modern Approach. W.W. Norton & Company, New York, NY. 1996.
Thomas A. Standish. Data Structures, Algorithms and Software Principles in C. Addison Wesley, Reading, MA. 1995
A. Robbins. Unix in a Nutshell. O'Reilly, Sebastapool, CA, 2005.
Initial class handout
Tutor schedule

/objectives

/etc/policy

The grade will be based on programming assignments and three tests. Each assignment must be meticulously documented and clearly identify its purpose, author, and date. The assignment should also compile and execute satisfactorily on admiral. The distribution of grades will be as follows:

Programming Assignments 40%
Three tests 20% each

Anyone desiring an EXC grade after March 23, 2007 must be passing the course at that point to get EXC.

/etc/exam_dates

Test 1 February 15, 2007
Test 2 March 15, 2007
Test 3 May 11, 2007; 8:00am--10:00am

Here are the old tests

/etc

Failure to hand in any assignment will result in an automatic zero for that assignment. If some student is unable to hand in an assignment by the deadline, he/she must discuss it with me before the deadline. If you are found copying an assignment (from another student or internet), you get a zero for that assignment automatically.

/etc/note

You have an account on one of the Unix machines on campus and you should use it for all assignments. Any assignment that fails to run on the Unix machines automatically gets a zero. You can communicate with all the students in the class using the email alias cs2250@cs.umsl.edu. Any message sent to this alias will automatically go to all the students in the class.


Web pages of some students in class