YCP Logo Syllabus

Instructor:David Hovemeyer
Office:KEC 113
Office Hours:T/Th 12:00 - 2:00, F 9:00 - 10:00
Class Location:KEC 119 (aka EIC 119)
Class Times:M/W 8:00 - 9:40 AM

CS 201 - Fundamentals of Computer Science II

Fall 2008

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

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. 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 Outcomes

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

  • Use an object-oriented programming language effectively
  • Understand and use abstract data types such as lists, stacks, queues, maps, and sets
  • Understand and use fundamental data structures such as arrays, linked lists, trees, and hash tables
  • Implement basic array- and list-based data structures
  • Understand and implement fundamental algorithms such as searching and sorting
  • Use big-O analysis to determine the asymptotic complexity of algorithms
  • Understand and use recursion
  • Solve recurrences
  • Use proof by induction



Grades are assigned on a 100-point scale:

Numeric Range Letter Grade
90-100 A (4.0)
85-90 B+ (3.5)
80-85 B (3.0)
75-80 C+ (2.5)
70-75 C (2.0)
60-70 D (1.0)
0-60 F (0.0)

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

  • Homework and programming assignments: 30%
  • Midterm exams: 40% (20% each)
  • Final exam: 20%
  • Written homework, quizzes, and attendance/participation: 10%

Course website

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

Reading Assignments

Reading assignments are posted in the Schedule at the end of this syllabus. I expect you to do the reading before class. When I give a lecture, I will assume you have done the reading. I encourage you to use class time to ask questions about parts of the reading you did not understand to your satisfaction.

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. However, I do expect you to complete and submit them. Failure to complete lab assignments may affect your attendance and participation grade.

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 activities. 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 for attendance and participation. Frequent absence and/or lack of participation 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.

Use of Personal Technology in the Classroom

While York College recognizes students’ need for educational and emergency-related technological devices such as laptops, PDA’s, cellular phones, etc., using them unethically or recreationally during class time is never appropriate. The college recognizes and supports faculty members’ authority to regulate in their classrooms student use of all electronic devices.

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 Note Topic Reading
Week 1: Aug 25-29 No class Monday Basic Java 1.1-1.6
Week 2: Sep 1-5 No class Monday Objects, References, and Arrays 2.1-2.4
Week 3: Sep 8-12   I/O, Exceptions
Objects and Classes
Week 4: Sep 15-19   Objects/Classes, cont'd
Week 5: Sep 22-26   Interfaces
Collections, Genericity
Week 6: Sep 29-Oct 3   Functors 4.8
Week 7: Oct 6-10   Analysis of Algorithms
Oct 11-14 Fall break, no classes
Week 8: Oct 13-17 No class Monday Analysis of Alg, Big-O cont'd  
Week 9: Oct 20-24   Collections, Iterators
Generic Algorithms
Week 10: Oct 27-31   Lists
Stacks and Queues
Week 11: Nov 3-7   Sets and Maps
7.1, 7.3
Week 12: Nov 10-14   Proof by Induction
Dynamic Programming
Week 13: Nov 17-21   Sorting, Insertion Sort 8.1-8.3
Week 14: Nov 24-28 No class Wednesday Merge Sort, Quick Sort 8.5-8.6
Nov 26-30 Thanksgiving break, no classes
Week 15: Dec 1-5   Linked Lists
Singly-linked lists
Week 16: Dec 8-12 No class Wednesday Doubly-linked lists 17.3