600.226 Data Structures
Course Syllabus -- Spring 2011

Meetings: Tue & Thu 3-4:15, Hackerman B17

Instructor: Professor Gregory Hager
Office: Hackerman 121, Ph 410 516 5521
E-mail: hager -at- cs.jhu.edu
Office Hours: by appointment

Course Web Page: http://www.cs.jhu.edu/~hager/Teaching/cs226
This is a VERY important source of course information and must be checked regularly!!

Prerequisites: Students are expected to be proficient in a high level object oriented programming language, preferably Java.

Text: Mark Allen Weiss, Data Structures and Algorithms Analysis in Java, Pearson Education, 3rd edition, 2011.

Course Content: The goal of the course is to teach fundamental data structures, which allow one to store collections of data with fast updates and queries. We will cover most of chapters 1-9, and parts of 10-12 as time permits. A detailed schedule will evolve as the semester progresses. Key topics will definitely include: JAVA refresher & generics, analysis tools, linked lists & iterators, stacks and queues, search trees, maps, hashing, priority queues, sorting, graphs.

Grading: Students will complete written homework assignments, programming projects, a midterm and a final. Each will be assigned a point value. Homework and program averages will be computed as total points earned divided by total points possible. These grading components will be weighted as follows. Letter grades for the course will be subject to my evaluation of your overall class performance. Please keep your own record of your grades so that you will know your standing in the course and can double-check my records. All grades will be available on webCT.

Programming Logistics: All programming assignments must compile with the standard Java compiler, which is freely available to download for any system. NO CREDIT WILL BE GIVEN FOR CODE THAT DOES NOT COMPILE! This means that all components of a program must compile together or you will not receive any credit for any of them!! Many students prefer to write their programs on their own computers. However, students will be given access to the CS Lab in NEB 225 in order to meet with course assistants and will have the option to use either a unix or windows account from the CS department. If you don't already have an account or access, you must fill out a request form and return it to me. You will then need to see Steve in NEB 226 (hours posted on the door) with your Jcard in order to get it validated. You are welcome to use any development environment you like, as long as it uses the standard java compiler. Popular choices are jGRASP and Eclipse.

Late policy: No late homework or programs. If a program is not working perfectly, turn it in as is with detailed comments as to which parts are complete, and which are not. NO CREDIT WILL BE GIVEN FOR CODE THAT DOES NOT COMPILE! Exceptions for illness will be given only by Prof. Hager (not by any TAs). Exceptions for poor planning will NOT be given. Now is a good time to develop incremental coding skills, so that you always have a working program to turn in, even if parts are incomplete.

Collaboration: You must solve your written assignments without consulting other students. Some programming assignments will be individual, others will require colloboration with a specified partner or small team. For homework help you may only consult the instructor, the teaching and course assistants, or tutors. You must abide by the Computer Science Academic Integrity Code (see below), as well as the University's Ethics Code.

Miscellany: You are expected to attend and actively participate in all class sessions. Inevitably, students who do not attend regularly do poorly on tests and assignments. You are responsible for all material presented while you are absent. If you have trouble or need extra help, don't hesitate to contact a teaching assistant or me. Please don't wait until you're hopelessly behind.

Course Schedule (will evolve throughout the semester)

1/31What are data structures/Java RefesherCh 1
2/7JAVA refresher & genericsCh 2
2/14Analysis Tools and TechniquesCh 3
2/21Linked lists & IteratorsCh 3
2/28Stacks & QueuesCh 4
3/6 TreesCh 4
3/13More Trees
Midterm on Thursday 3/15
Ch 4
3/27HashingCh 5
4/3 Priority Queues (Heaps)Ch 6
4/10SortingCh 7
4/17GraphsCh 9
4/24More Graphs, SetsCh 9 & Ch 8
5/1 Catch up and Close out!
5/16Final exam, 2-5p.m. 

Computer Science Academic Integrity Code

Cheating is wrong. Cheating hurts our community by undermining academic integrity, creating mistrust, and fostering unfair competition. The university will punish cheaters with failure on an assignment, failure in a course, permanent transcript notation, suspension, and/or expulsion. Offenses may be reported to medical, law or other professional or graduate schools when a cheater applies.

Violations can include cheating on exams, plagiarism, reuse of assignments without permission, improper use of the Internet and electronic devices, unauthorized collaboration, alteration of graded assignments, forgery and falsification, lying, facilitating academic dishonesty, and unfair competition. Ignorance of these rules is not an excuse.

Academic honesty is required in all work you submit to be graded. Except where the instructor specifies group work, you must solve all homework and programming assignments without the help of others. For example, you must not look at anyone else's solutions (including program code) to your homework problems. However, you may discuss assignment specifications (not solutions) with others to be sure you understand what is required by the assignment.

If your instructor permits using fragments of source code from outside sources, such as your textbook or on-line resources, you must properly cite the source. Not citing it constitutes plagiarism. Similarly, your group projects must list everyone who participated.

Falsifying program output or results is prohibited.

Your instructor is free to override parts of this policy for particular assignments. To protect yourself: (1) Ask the instructor if you are not sure what is permissible. (2) Seek help from the instructor, TA or CAs, as you are always encouraged to do, rather than from other students. (3) Cite any questionable sources of help you may have received.

On every exam, you will sign the following pledge: "I agree to complete this exam without unauthorized assistance from any person, materials or device. [Signed and dated]". Your course instructors will let you know where to find copies of old exams, if they are available.

For more information, see the guide on "Academic Ethics for Undergraduates" and the Ethics Board web site (http://ethics.jhu.edu).