Course Description for CS 220-01 Winter 2009

Instructor: Dr. Josef M. Breutzmann   Phone: 352-8342    Office: SC 354
Office Hours:8:30-9:30 M T W H; 9:9:30 F; 11:00-11:30 T H; 1:45-2:30 M F; 3:00-4:00 W.

Meeting times: MWF 12:00 - 1:05 A.M. in SC 345 & 347

Prerequisite CS120 or equivalent (one semester of programming in an OO language).

Text: Carrano, Frank & Prichard, Janet. Data Structures and Abstraction with Java™ 2nd edition. Pearson - Prentice Hall, 2007.

Course Web Site: http://mcsp.wartburg.edu/breutzma/CS220
Manhattan Site: https://socrates.wartburg.edu

Description: Constructs of the JAVA™ language, techniques, principles essential for constructing non-trivial computer programs. Classroom discussion and programming assignments introduce string processing, searching, sorting, recursion, data structures, abstraction with focus on object-oriented programming.

Attendance: Attendance will be taken daily. Students with excessive absences may be required to do extra work to demonstrate their mastery of any missed topics. Further, excessive absences will relieve the instructor of any obligation to "catch up" a student through private tutoring.

Grading: Students will complete three exams, approximately 8 programming projects, a few laboratories and selected homework exercises from the end of various chapters. These items will be weighted as follows:

Tests (4)	60%
Programs, Labs, Homework and Quizzes	40%

Class curve will be no stricter than:

93.3%	A	83.3%	B	73.3%	C	63.3%	D
90.0%	A-	80.0%	B-	70.0%	C-	60.0%	D-
86.6%	B+	76.6%	C+	66.6%	D+	< 60%	F

Wartburg Honor Code: By attending Wartburg College, students are demonstrating their dedication to the Honor Code. The Honor Code reminds students of their responsibility to promote academic honesty by opposing cheating and plagiarism and reporting dishonest work. (please review your copy of the honor code pamphlet)

I take the issue of integrity very seriously. I believe that it is the duty of every to student to do their part to maintain the proper level of honesty in the class. A student who knows of dishonesty in the class and does nothing about it is cheating him/her self as well as every other student in the class. Instances of cheating will result in a zero for the evaluation in question and very close scrutiny of all subsequent work. A second instance will result in an F for the course.

An Additional Note: A JAVA(tm) programming environment is being provided in the UCL [Unix Computation Lab - SC 347] for use by students in this class. Students with their own JAVA™ systems may use them as well. Free versions of Java are available for most platforms. Students are also allowed to connect to the machine in the UCL remotely using a VNC, SSH or SFTP client.

Tentative Test Dates:

• Test One - Monday, January 26
• Test Two - Wednesday, February 18
• Test Three - Friday, March18
• Test Four - 12:00 Friday, April 17(final exam slot)

Tentative Schedule for CS220, Winter 2009
week of	Monday	Wednesday	Friday
Jan 5	Introduction to Java Appendix A Chapters 1, 2, & 3
Jan 12
Jan 19	Lists Chapters 4 & 5		Review
Jan 26	Test One	Algorithm Analysis Chapter 9	Recursion Chapter 10
Feb 2	Recursion Chapter 10		Sorting & Searching Chapters 11, 12, 13, & 16
Feb 9	Sorting & Searching Chapters 11, 12, 13, & 16		Linked Lists Chapters 6, 7, & 8
Feb 16	Review	Test Two
Feb 23	Linked Lists Chapters 6, 7, & 8	Dictionaries Chapter 17, 18, & 19
Mar 2	Midterm Break Week
Mar 9	Stacks Chapters 21, & 22
Mar 16	Queues Chapters 23, & 24	Review	Test Three
Mar 23	Queues Chapters 23, & 24	Binary Trees Chapters 25, 26, & 27
Mar 30	Binary Trees Chapters 25, 26, & 27
Apr 6		Review	Good Friday No Classes
Apr 13	Easter Monday No Classes		Test Four 12:00 Friday April 17