CS 201 Data Structures Fall 2017

Course Information

Course Homepage:
go/cs201 or http://www.cs.middlebury.edu/~schar/courses/cs201-f17/

Time and Place:
Lecture: MWF 8:00-8:50 (A) and MWF 9:05-9:55 (B) in MBH 220
Labs: Wed 2:50-3:40pm (Y), Thu 11:00-11:50am (X), and Thu 1:30-2:20pm (Z) in MBH 632

Professor:
Daniel Scharstein
640A McCardell Bicentennial Hall
443-2438
schar middlebury.edu

Office Hours:
MWF 10-11am, Tue 11-noon, and by appointment

Lab Assistant:
Ruben Gilbert
rgilbert@middlebury.edu, 443-5915

Free online Textbooks:
Java Structures, √7 edition [pdf], Duane A. Bailey, 2007
Thinking in Java (html) [non-frames version], Bruce Eckel, 2003


Course description

This course stresses ideas and structures helpful in designing and implementing algorithms, especially for solving large or complex problems. Important concepts in this context are data abstraction and modularity, which should be familiar from your first CS course. In this course, we will introduce many important data structures such as vectors, lists, stacks, queues, trees, and graphs, and discuss various ways to implement these structures. We will also cover in depth the concept of algorithmic complexity, and compare the different implementations terms of time and space efficiency. The course will also introduce object-oriented programming using the programming language Java; however, the main focus will be on data structures, not on the new language.
Prerequisites: CSCI 101 or 150 or 190; or AP CS; or permission of the instructor.

Topics

The following is a tentative schedule of topics to be covered in this course. Readings refer to the text by Bailey.

Week    Topic Reading

1 Intro, Java Ch 0, 1, 2, B
2 Object-oriented programming Ch 1
3 Algorithmic complexity, vectors, sorting Ch 3, 5, 6
4 More sorting, generics Ch 4, 6
5 Lists Ch 9
6 Stacks, queues, Midterm 1 Ch 10
7 Fall break, Iterators, ordered structures, trees Ch 8, 11, 12
8 Priority queues, heaps Ch 13
9 Search trees, applets Ch 14
10 Balanced trees, hashtables, Midterm 2     Ch 15
Thanksgiving break
11 Graphs, graph algorithms, graphics, events      Ch 16
12 Threads, animation, final projects

Assignments, Exams, and Grading

There will be weekly homeworks, consisting of programming assignments in Java and/or written assignments. Usually, homeworks will be posted on Wednesdays, and will be due the following Wednesday at 8am. Late work will not be accepted. However, each student is allotted two 24-hour extensions to use for any homework assignment during the term. No more than one extension may be taken per homework. If you have not completed an assignment, you should still turn in whatever you have for partial credit. In extenuating circumstances (e.g., sickness, personal crisis, family problems, religious holidays), you may request an additional extension. Such extensions are more likely to be granted if the request is made before the due date.

Your final grade will be based on homeworks (40%), two midterm exams (15% each), and a final exam (30%). The first midtem is scheduled for Tue October 17, 7-9pm. The second midterm is a one-week take-home exam requiring the use of a computer, and is tentatively scheduled between Wed 11/15 and Sun 11/26. The final exam is scheduled for Tue 12/12, 7-10pm, and Wed 12/13, 9-noon (you may attend either slot). All exams will be open book, open notes.

Collaboration Policy and Honor Code

The computer science faculty believes that collaboration fosters a healthy and enjoyable educational environment. For this reason, you are encouraged to talk with other students about the course, to form study groups, and to use the online discussion forum to post questions and help each other.

Unless otherwise instructed, feel free to discuss problem sets with other students and exchange ideas about how to solve them. However, there is a thin line between collaboration and plagiarizing the work of others. Therefore, it is required that you must compose your own solution to each assignment. In particular, while you may discuss strategies for approaching the programming assignments with your classmates and may receive debugging help from them, you are required to write all of your own code. It is unacceptable (1) to write a program together and turn in two copies of the same program or (2) to copy code written by your classmates. This implies that you should never have in your possession a copy of all or part of another student's work. It is your own responsibility to protect your work from unauthorized access. The exams must be entirely your own work.

In keeping with the standards of the scientific community, you must give credit where credit is due. If you make use of an idea that was developed by (or jointly with) others, please reference them appropriately in your work. E.g., if you get a key idea for solving a problem from person X, your solution should begin with a note that says "I worked with X on this problem" and should say "The main idea (due to X) is ..." in the appropriate places. It is unacceptable for students to work together but not to acknowledge each other in their write-ups.

When working on homework problems, it is perfectly reasonable to consult public literature (books, articles, etc.) for hints and techniques. However, you must reference any sources that contribute to your solution. It is also OK to borrow code from the textbook, from materials discussed in class, and from other sources as long as you give proper credit. Assignments and solutions from previous terms are not considered to be part of the "public" literature, and consulting problem set solutions from previous terms constitutes a violation of the Honor Code. Finally, the use of Java decompilers is expressly forbidden.

If you are uncertain how the Honor Code applies to a particular assignment, please ask me. The Department of Computer Science takes the Honor Code seriously. Violations are easy to identify and will be dealt with promptly.

ADA information

Students who have Letters of Accommodation in this class are encouraged to contact me as early in the semester as possible to ensure that such accommodations are implemented in a timely fashion. For those without Letters of Accommodation, assistance is available to eligible students through Student Accessibility Services. Please contact the ADA Coordinators Jodi Litchfield (litchfie@middlebury.edu, x5936) or Courtney Cioffredi (ccioffredi@middlebury.edu, x2169) for more information. All discussions will remain confidential.