|Class Time:||Mon/Wed/Fri 9:00pm-9:50am|
|Office Hours:||Wednesday, 15:00-16:30pm
or by appointment
roberto.hoyle AT oberlin edu
Please include "cs151" in the subject.
|1||Feb 01||Consider bookmarking Java for Python Programmers as a handy reference (PDF version)||Course Overview||Lab 0 - Intro to lab/Eclipse|
|Feb 03||Introduction to Java (Read: Ch 1)|
|Feb 05||RJH Travelling
Prof. Kuperman will
be guest instructor!
|Objects and reference variables (Read: Ch 2)|
|2||Feb 08||Introduction to Object Oriented Programming (Read: Ch 3)||Prelab 1
Lab 1 - Playing with Java
|Feb 10||Inheritance and Generics
(Read: Ch 4)
|Feb 12||RJH Travelling
Prof. Kuperman will
be guest instructor!
|3||Feb 15||Java Collections
(Read: Ch 6)
Data Structure: Array Lists, Iterators
(Read Ch 15)
Lab 2 - MyArrayList
|Feb 19||Data Structure: Stacks
Data Structure: Queues
(Read Ch 16)
|4||Feb 22||Algorithm Analysis
(Read Ch 5)
Lab 3 - Maze Solver
|Feb 26||Data Structure: Linked Lists
(Read Ch 17)
Lab 4 - LinkedLists and Runtime
|Mar 04||RJH at SIGCSE
|6||Mar 07||Data Structure: Trees
Lab 5 - Binary Tree Methods
|Mar 11||Data Structure: Balanced Trees
|7||Mar 14||Review for exam||No lab this week|
|Mar 16||Midterm Exam [topics]|
|Mar 18||Data Structure: Balanced Trees
|Mar 21||Spring Break (Mar 19-27)|
|8||Mar 28||Data Structure: Maps and Sets
Data Structure: Priority Queues
(Read Ch 21)
Lab 6 - WebPageIndex
(Search Engine Part 1)
|9||Apr 04||Data Structure: Hashtables
(Read Ch 20)
Lab 7 - ProcessQueries
(Search Engine Part 2)
|10||Apr 11||Data Structure: Tries||Prelab 8
Lab 8 - Million Monkeys
|Apr 13||Data Structure: Graphs
(Read Ch 14.1,14.2)
|11||Apr 18||Data Structure: Graphs
(Read Ch 14.3)
Lab 9 - Boggle
|Apr 20||Data Structure: Graphs
(Read Ch 14.3-14.5)
|12||Apr 25||Algorithm: Insertion and Selection Sort
Algorithm: Linear & Binary Search
(Read Ch 8.1-8.3, 5.5-5.6)
Lab 10 - Kevin Bacon Game
|Apr 29||Algorithm: Merge sort
Algorithm: Lower bound of search
(Read Ch 8.5, 8.8)
|13||May 02||More Sorting Algorithms
(Read Ch 8.4,8.6-8.8)
|May 06||Review and class wrapup|
|May 12||Final Exam (9-11am TBA) [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://users.cis.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 Roberto Hoyle * 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 50% per day after the deadline. No late prelabs will be accepted. You will be allowed 1 late day in each half of the semester and 1 late day that can be used whenever (total of 3). You must include the fact that you are using one of your late days in the README document for an assignment.
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.