| News | |
| Course
|
CS 15 | Data Structures and Programming | Fall 2001 |
| Lecture |
Moore 202 | MWF 10:00-11:05 | XHr 12:00-12:50 Th |
| Instructor |
Hany Farid | Sudikoff 208 | 646.2761 office hours: MWF 11:15-12:15 or by appointment |
| TA |
Kevin Fournier (Kevin.T.Fournier@dartmouth.edu) Siwei Lyu (lsw@cs.dartmouth.edu) Senthil Periaswamy (sp@cs.dartmouth.edu) |
| Textbook |
Required: Data Structures and Algorithm Analysis in JAVA
by Mark Allen Weiss Optional:Java Software Solutions by J. Lewis and W. Loftus. Java lecture notes from CS5, Spring 2000 |
| Computing |
Programming will be done in Java using CodeWarrior. |
| Lab Hours |
You may use the Macs in Sudikoff 003 or Starr Instructional
Center (Berry). These rooms will be reserved for you during
the following evening hours: W 7:00-9:30 (Starr) Th 7:00-10:00 (Sudikoff) TA will be available: 7:00-9:30 (Starr) 7:00-9:00 (Sudikoff) Access cards for Sudikoff may be obtained at the front window in Sudikoff from 8:30 a.m. - 12 noon and 1 p.m. - 3:30 p.m. M-F. You should have $20 cash for the refundable deposit. It takes one day to activate the card, so please plan ahead. |
| Syllabus (tentative) |
Readings will be from Weiss: o Introduction: 1.1-1.3 o Java review: 1.4-1.7 o Run-time complexity: 2.1-2.4 o Lists: 3.1-3.2 o Stacks: 3.3 o Queues: 3.4 o Trees (BST/AVL): 4.1-4.7 o Trees (Red/Black): supplementary o Hashing: 5.1-5.6 o Graphs: 9.1-9.7 o Huffman Coding: 10.1 o Sorting: 7.1-7.10 o Heaps: 6.1-6.8 |
| Grading |
Homework (30%) | Midterm (35%) | Final (35%) |
| Homework |
There will be weekly homeworks given on Friday. Homework is
due in class on the following Friday. Hand in hardcopy of any
written questions and a printout of any programming questions.
You should also place your code in the CS15 Drop Box on the
PUBLIC server. A folder of the form lastname.firstname,
should contain all the relevant files. Late homeworks
will not be accepted Homework 1: Welcome.java | Search.java Homework 2: ListNode.java | LinkedListItr.java | LinkedList.java | MyInteger.java Homework 3: BinaryNode.java | BinarySearchTree.java | MyInteger.java | Comparable.java Homework 4 Homework 5: ListFiles.java | words Homework 6 Homework 7 Guidelines for Electronic Submission |
| Honor Code |
You can not collaborate or copy in any way on exams. On
homeworks, you may discuss general approaches with other
students. You may help other students find bugs in their
code. But your code must be written by you: any copying
(electronic or otherwise) of another person's code or code
fragments is a violation of the honor code. |
| Exam |
The midterm and final will be in-class exams. |