| Days | Lect/Sec | Time | Room | |
| Lecture | MWF | Lec. 2 | 11:30am - 12:20pm | SH219 Scaife("Potato Chip") Hall |
| Recitation | Thursday | Sec. D | 09:30am - 10:20am | 5419D Wean Hall |
| Sec. E | 10:30am - 11:20am | 5419D Wean Hall |
| Instructor | Victor Adamchik |
| adamchik@cs.cmu.edu | |
| Office | 5121 Wean Hall |
| Office Hours | Tu: 12:00pm - 03:00pm Wed: 12:30pm - 02:00pm |
| TA | Ross Kukulinski | Emilie McConville |
| rkukulin@andrew.cmu.edu | emcconvi@andrew.cmu.edu | |
| Office Hours | Tue. 8PM-10PM Thu: 8:00PM-10:30PM |
Wed: 7:30PM-9:30PM Thu: 7:30PM-10:00PM |
F. M. Carrano, "Data Structures and Abstractions With Java", 2nd Edition, Prentice Hall, 2006, ISBN: 013237045X
Course Home Page:
http://www.andrew.cmu.edu/course/15-200/DE/
Course Bboard: academic.cs.15-200
You may use any programming environments available to you such as CodeWarrior, Eclipse, Project Builder, TextPad, Emacs and others.
An alternative to CodeWarrior, we recommend you to look at a free open-source Java environment available from Eclipse . You need to install the Java 2 SDK first before installing Eclipse.
Participation in this course consists of the following activities
- Attending and participating in lectures and recitations
- Reading the on-line notes
- Carrying out homework assignments
- Taking the quizzes, midterm, and final
- Staying up to date on announcements on the bboard
Attendance is strongly encouraged. You will be responsible for all materials presented in lectures. You should not expect that all lecture materials will be given to you in written form, nor should you expect that lectures will be drawn form the textbook.
| Course Assignments | Weights |
| Final test | 20% |
| 2 Midterms | 20% |
| 6 Quizzes | 12% |
| 8 Programming Labs | 48% |
| Final Grade | Final Course Percentage |
| A | 90 and over |
| B | 80 - 89.99 |
| C | 65 - 79.99 |
| D | 50 - 64.99 |
| F | less than 50 |
This is a common departamental exam. More information will follow.
There will be 2 mid-term comprehensive tests. We will have an exam overview in advance. Partial credit will be given. Missed examination counts as zero credit. No make-up examination will be administered, except in case of medical or family emergencies.
The homework assignments are a critical part of the course. Experience has shown that concepts are best learned by direct engagement---in our case by applying them to example problems or by implementing them in computer programs.
Programming assignments will be graded based on style (modularity, effective use of data abstraction, readability, commenting, etc.) and functionality (orrectness and efficiency of the program on the test inputs.) A working program is not sufficient for full credit. Make sure you do a thorough data validation. Your code should be properly annotated with comments. Your assignments will be graded by your TA.
The assignment should be handed-in electronically by Thursday midnight. Read FAQ for submission procedure. Late submissions will be penalized by 10 points per day. We will allow at most two late days for each lab.
For homework assignments, students are encouraged to talk to each other, to the course staff, or to anyone else about the assignments. This assistance, though, is limited to the discussion of the problem and perhaps sketching of general approaches to a solution. Each student must develop his or her own solutions to the homework. Consulting another student's solution is prohibited, and submitted solutions may not be copied from any source.
The issue of cheating will be taken seriously by the instructor and TAs, and homerwork asignments will be routinely checked for violations, which will be handled in accordance with the University regulations.
Last updated Monday, January 10, 2005
 |
Victor S. Adamchik,
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA. |