|Class Time:||Mon/Wed/Fri 10:00pm-10:50am|
|Office Hours:||Tuesday, 10:00-11:30am
or by appointment
benjamin.kuperman AT oberlin edu
Please include "cs151" in the subject.
|1||Feb 04||Course Overview||Lab 0 - Intro to lab/Eclipse|
|Feb 06||Review of Java and Object Oriented Programming
|2||Feb 11||Inheritance, Generics, and Collections
||Lab 1 - MyArrayList|
|Feb 13||Last Day to Add/Drop||Data Structure: Array Lists, Iterators
|Feb 15||Algorithm Analysis
|3||Feb 18||Lab 2 - Algorithm Timing|
Data Structure: Queues
|4||Feb 25||Data Structure: Linked Lists
||Lab 3 - Maze Solver|
|5||Mar 03||Data Structure: Trees
||Lab 4 - Directory|
|6||Mar 10||Lab 5 - Binary tree methods|
|Mar 14||Swing and Graphical User Interfaces
|7||Mar 17||No Lab|
|Mar 19||Review for exam|
|Mar 21||Midterm Exam [topics]|
|Mar 24||Spring Break|
|8||Mar 31||Data Structure: Priority Queues
||Lab 6 - Word Frequency Tree|
|9||Apr 07||Last Day for P/NP, CR/NE,
|Data Structure: Hashtables
||Lab 7 - Process Queries|
|Apr 09||NEONet 2008 [No Class]|
|10||Apr 14||Data Structure: Tries||Lab 8 - Hashtable/GUI|
|Apr 16||Tentative: Data Structure: Graphs
|11||Apr 21||Lab 9 - Boggle solver|
|12||Apr 28||Lab 10 - Kevin Bacon Game|
|Apr 30||Sorting Algorithms
|13||May 05||Lab review and Eclipse tips|
|May 07||Other structures and algorithms
|May 14||Final Exam (7-9pm King 221) [topics]|
From the Oberlin catalog course description:
This course builds upon the principles introduced in CSCI 150 and provides a general background for further study in Computer Science. The course will cover object-oriented programming concepts; the design and implementation of data structures (linked lists, stacks, queues, trees, heaps, and hash tables) and related algorithmic techniques (searching, sorting, recursion); and algorithm analysis. Students will be expected to complete a number of programming projects illustrating the concepts presented.
My goals and objectives for students taking this course are as follows:
The text for the course is Data Structures and Problem Solving Using Java, Third Edition by Mark Weiss. All of the code from the text is available on the author's website: http://www.cs.fiu.edu/~weiss/dsj3/code/code.html
You can use the 2nd edition if you want, but you'll need to read up on the features added in Java 5 on your own.
A copy should be on reserve in the library.
Grades will be calculated based on the following distribution:
The distribution might be adjusted based on the progression of the course.
Programming projects will generally consist of two major components:
If a portion of your program is not working correctly, please clearly indicate it in the comments at the beginning of the file and in the methods that are not working. Problems that I discover are graded more severely than those you discover.
Programming assignments will be graded on both correctness as well as programming style. Good programming style includes the following:
Regular class attendance and participation is expected. Please talk to me if regular class attendance is going to be a problem.
There will be a number of assignments made in this class. I expect every student to attempt each assignment and turn in the results. You are encouraged to complete every assignment as this is one of the most effective ways to learn the material.
If you know that for some reason you will not be able to submit the assignment before the deadline, you should contact me in advance of the deadline. Extensions are only granted in exceptional circumstances, but need to be done in advance.
Late assignments will be penalized according to the following chart. Extra credit will not be accepted after the initial deadline.
If you have a disability that might impact your performance in this course, or requires special accommodation, please contact me as soon as possible so that appropriate arrangements can be made. Support is available through Student Academic Services, specifically Jane Boomer. You will need to contact them to get your disability documented before accommodations can be made.
I have very low tolerance for academic dishonesty, and will vigorously pursue available remedies for any incidents. All work in this class is to be performed according to the Oberlin Honor Code. Specifically I expect that:
All assignments must include the following signed statement:
"I affirm that I have adhered to the Honor Code in this assignment."
Electronic submissions should include the honor statement in either the README file or header comments and must include your name.
Contact me if you are interested in a Student Academic Services approved tutor.
The CSMC might hold walk-in tutoring sessions as well.
The CS department will be hiring a couple of students to work as lab helpers. They will be in the upstairs lab during the hours posted below.
Lab hours: Sun 1:00-3:00pm
Lab hours: Sun 7:00-9:00pm