CS 201 - Fundamentals of Programming and Algorithms II

Updated 3/17/2008: Revised schedule

Spring 2008

David Hovemeyer
Office / Phone
GH 118 / 717-815-6582
Office Hours
M-F 11-12
or by arrangement
Class Location
GH 123
Class Times M/W 3:00-4:40 PM

Course Description

This course introduces advanced object-oriented constructs such as abstraction, virtual methods, and generic classes.  Advanced data structures including arrays, linked lists, queues, stacks, trees, heaps, and hash tables will be discussed both natively as well as through standard template libraries.  Fundamental sorting and searching algorithms will be introduced.  Basic analytical and proof techniques will be used to characterize the data structures and algorithms discussed.  The course will focus on implementing applications from computer science and engineering using languages such as C++/C#/Java.


CS 200


Mark Allen Weiss, Data Structures & Problem Solving Using Java, 3rd ed.

Course Structure and Expectations

Class meetings will be a mix of lecture/discussion and in-class lab exercises designed to illustrate the concepts we are covering.  A series of programming projects in the Java programming language will be assigned at approximately 1-2 week intervals, to be completed individually.  Occasional written homework assignments may be assigned.

We will use the Eclipse IDE for labs and programming assignments in Java.  This is available for free from www.eclipse.org.  (You will also need the Java Development Kit (JDK) available from java.sun.com.)

In-class quizzes will be given frequently, typically at the beginning of class.  Up to two missed quizzes will be forgiven.  Quizzes may not be made up.

There will be two midterm exams given in class, dates/times to be announced.  A scheduled final exam will be given (see the Final Exam Schedule).

We will be covering a significant amount of material in the course, and it is very important that you keep up.  If you have any questions, please ask me in class, office hours, or through email.  I'm here to help!

Learning Objectives

By the end of this course, you will be able to:



Grades are assigned on a 100-point scale:

Numeric Range
Letter Grade
A (4.0)
B+ (3.5)
B (3.0)
C+ (2.5)
C (2.0)
D (1.0)
F (0.0)

Your overall grade for the course will be determined as follows:

Course website

Please check the course web page, http://faculty.ycp.edu/~dhovemey/spring2008/cs201/, regularly for important announcements.

Posting and submission of assignments and labs

Assignments and labs will be posted as zip files on the course web page, http://faculty.ycp.edu/~dhovemey/spring2008/cs201/.

Assignments will be submitted using the server https://camel.ycp.edu:8443.  You will receive an email containing the username and password you should use for this server.

Academic Integrity

The following policy pertains to homework and graded (individual) programming assignments:

All homework assignments and graded (individual) programming assignments are to be completed individually.  I encourage you to discuss high level concepts with other students, but any work you submit must be yours alone.

Direct copying of code or other work from other students, web sites, or other sources is absolutely forbidden under any circumstances.

Any sources (books, websites, articles, fellow students, etc.) that you consult in completing an assignment must be properly acknowledged.  In general, I strongly discourage you from using any resource not explicitly listed in the course syllabus or on the course web page.  When you work on a programming assignment, it must be your program, not your adaptation of someone else's program.

Quizzes and exams must be completed individually.

Lab assignments are not graded---therefore, you may work with other students on them.

Any violation of the course's academic integrity policy will be referred to the Dean of Academic Affairs, and could have consequences ranging from a 0 on an assignment to dismissal from the college.

Late Assignments

Late assignments will be marked down 5% per day late.  No credit is given for assignments turned in after grading has taken place.


No make-up exams will be given without approval of the instructor prior to class unless proof of extreme emergency or illness is provided.  All exams will be open book and open notes.

Attendance and Participation

I expect you to attend class and participate regularly in class discussions.  If you miss a class, please notify me in advance.  You are responsible for all material covered in class, regardless of whether or not you were present.  If you attend and participate in class regularly, you can expect to receive full credit (5% of the course grade) for attendance and participation.  Frequent absence and/or lack of participation in class discussions will reduce the credit you receive for attendance and participation.

You are responsible for keeping up with the reading assignments as described in the schedule below.

Communication Standards

York College recognizes the importance of effective communication in all disciplines and careers. Therefore, students are expected to competently analyze, synthesize, organize, and articulate course material in papers, examinations and presentations. In addition, students should know and use communication skills current to their field of study, recognize the need for revision as part of their writing process, and employ standard conventions of English usage in both writing and speaking. Students may be asked to further revise assignments that do not demonstrate effective use of these communication skills.


This schedule may be subject to minor changes.  Any changes will be announced in class and also be posted on the course web page.

Week 1: Jan 21-Jan 24 No class Monday
Basic Java Sect 1.1-1.6
Week 2: Jan 28-Feb 1 Objects, classes, interfaces Sect 2.1-2.6
Sect 3.1-3.7
Week 3: Feb 4-Feb 8 Objects, classes, interfaces (cont'd) Sect 4.1-4.5
Week 4: Feb 11-Feb 15 Generic data structures and algorithms
Array-based data structures
Sect 4.6-4.7
Sect 6.1-6.4
Week 5: Feb 18-Feb 22 Analysis of algorithms
Sect 5.1-5.8
Feb 25-Feb 29 Winter break, no classes
Week 6: Mar 3-Mar 7 Singly-linked lists Sect 6.5
Sect 17.1-17.2
Week 7: Mar 10-Mar 14 Singly-linked lists (continued)
Sect 15.1-15.2
Week 8: Mar 17-Mar 21 Doubly-linked lists
Stacks and Queues
Sect 17.3
Sect 16.1-16.3
Mar 20-Mar 24 Spring break, no classes
Week 9: Mar 24-Mar 28 Recursion
Proof by induction
Sect 7.1-7.5
Week 10: Mar 31-Apr 4 Dynamic programming
Basic sorting algorithms
Sect 7.6
Sect 8.1-8.3
Week 11: Apr 7-Apr 11 Merge Sort
Quick Sort
Sect 8.5
Sect 8.6
Week 12: Apr 14-Apr 18 Trees
Binary Search Trees
Sect 18.1-18.4
Sect 19.1-19.3
Week 13: Apr 21-Apr 25 Balanced BSTs Sect 19.4-19.6
Sect 19.8
Week 14: Apr 28-May 2 Heaps, Heap Sort
Hash tables
Sect 21.1-21.5
Sect 20.1
Week 15: May 5-May 9 Hash tables (cont'd) Sect 20.2-20.6