|Class Time:||Mon/Wed/Fri 10:00pm-10:50am|
|Office Hours:||Tuesday, 3:00-4:30pm
or by appointment
benjamin.kuperman AT oberlin edu
Please include "cs151" in the subject.
|1||Feb 06||Course Overview||Lab 0 - Intro to lab/Eclipse|
|Feb 08||Review of Java and Object Oriented Programming
|Feb 10||Inheritance, Generics, and Collections
(Read: Ch 4, 6)
|2||Feb 13||Data Structure: Array Lists, Iterators
(Read Ch 15)
Lab 1 - MyArrayList
|Feb 15||Last Day to Add/Drop||Algorithm Analysis
(Read Ch 5)
|3||Feb 20||Algorithm: Insertion and Selection Sort
Algorithm: Linear & Binary Search
(Read Ch 8.1-8.3, 5.5-5.6)
Lab 2 - Algorithm Timing
|Feb 24||Data Structure: Stacks
Data Structure: Queues
(Read Ch 16)
Lab 3 - Maze Solver
|Feb 29||Algorithm: Merge sort
Algorithm: Lower bound of search
(Read Ch 8.5, 8.8)
|Mar 02||Kuperman at SIGCSE
Awesome guest instructor!
|Data Structure: Linked Lists
(Read Ch 17)
|5||Mar 05||Prelab 4
Lab 4 - DNA Manipulation
|Mar 07||Data Structure: Trees
|6||Mar 12||Data Structure: Balanced Trees
Lab 5 - Binary Tree Methods
|7||Mar 19||Catch up lab session|
|Mar 21||Review for exam|
|Mar 23||Midterm Exam [topics]|
|Mar 26||Spring Break (Mar 24-Apr 1)|
|8||Apr 02||Data Structure: Maps and Sets
Data Structure: Priority Queues
(Read Ch 21)
Lab 6 - WebPageIndex
(Search Engine Part 1)
|Apr 04||Midsemester grades available (Apr 05)|
|9||Apr 09||Last Day for P/NP, CR/NE,
|Data Structure: Hashtables
(Read Ch 20)
Lab 7 - ProcessQueries
(Search Engine Part 2)
|10||Apr 16||Serializable demo||Data Structure: Tries||Prelab 8
Lab 8 - Million Monkeys
|Apr 18||Data Structure: Graphs
(Read Ch 14.1,14.2)
|11||Apr 23||Data Structure: Graphs
(Read Ch 14.3)
Lab 9 - Boggle
|Apr 25||Data Structure: Graphs
(Read Ch 14.3,14.5)
|12||Apr 30||More Sorting Algorithms
(Read Ch 8.4,8.6-8.8)
Lab 10 - Kevin Bacon Game
|13||May 07||Sorting algorithm animations||Topic: "New" quicksort optimizations
||Lab review and Eclipse tips|
|May 09||Data Structure: Multi-way search trees
(Read Ch ????)
|May 11||Review, interview questions, comics|
|May 16||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, hash tables, and graphs) 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, Fourth Edition by Mark Weiss. All of the code from the text is available on the author's website: http://www.cs.fiu.edu/~weiss/dsj4/code/code.html
You can use the 3rd edition if you want, but you might want to cross-check the readings.
A copy should be on reserve in the library.
Course 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:
/** * A demonstration header used for the class syllabus. Additional lines * give additional information in JavaDoc. * * @author Benjamin Kuperman * Spring 2012 */
Regular class and lab 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 submissions of lab assignments will be penalized up to 10% per day. No late prelabs will be accepted.
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:
/* based on insertion sort from Weiss 3rd Ed, p. 306 */
All assignments must include the following signed statement:
"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.
The most up-to-date list can be found here.