Schedule:The latest tentative course schedule is posted on the web.

Catalog Description:  A continuation of 54-183, with an emphasis on abstract data objects such as lists, stacks, queues, trees, and sorting, deleting, and reasoning about these algorithms.

Prerequisites: Computer Science 54-183 or consent of the instructor

Learning Outcomes:  Data structures are central to computer science in general, and to the discipline of programming in particular. Students should

• become aware of some of the more important data structures used in information processing
• begin the art of designing one's own special purpose data structures
• use and implement some of  the algorithms that act on data structures; and
• learn algorithmic analysis necessary to compare alternative data structures and algorithms
• increase their proficiency in the Java programming language

Required Text:

Data Structures and Other Objects Using Java(3rd ed.)  . Main, Michael  , Addison Wesley, 2006,  ISBN 0-321-37525-4.
Computer Science Illuminated, Dale and Lewis, 3rd edition, Jones and Bartlett, 2007, ISBN 978-0-7637-4149-3

Accommodations:  Southwestern University will make reasonable accommodations for persons with documented disabilities. Students should register with the Office of AcademicSuccess located in Cullen Hall 336. Professors must be officially notified by the Access and Academic Resource Coordinator that documentation is on file at least two weeks before the accommodation is needed.

Grading Policy :  

Attendance Policy: Attendance in class is strongly recommended and will be taken every class day. Students are responsible for all material and assignments given in class whether they are present or not. It is the responsibility of the student to obtain notes, assignments, etc. for any missed class from a fellow student. ATTENDANCE IS MANDATORY FOR ALL EXAMS. Absolutely no makeup exams will be given.  If student missed one in-class exam, the grade on the final exam will substitute for it. If a student does not miss any exams, the final grade will substitute for the lowest exam grade or the quiz average (if the final  is higher). If a student has already missed an exam, subsequent missed exams will result in zeroes. A student must pass the final exam to pass the course.

Homework Assignments: All homework is due at the beginning of the class period in which it is due (at 2:30 and not at 2:35, for example).  I understand that occasionally bad things happen (illnesses, accidents, deaths) and I would like to hear if you are having problems that are preventing you from completing your assignments.   However, I will under no circumstances make any special arrangements after the fact (that is, after the homework is due).  Unless you are unconscious at the hospital, you must email me or speak to me before an assignment is due for me to accept it late. Approved late projects are subject to a 10 point per day late penalty.

Honor code:  In a nutshell: you violate the honor code when you represent someone else's work as your own.  In general, written homework (including any programming assignments that are pencil/paper and not implemented) are to be completed independently.  Homework program specifications may be discussed at a very high level with other student, but details, coding and execution must be individual.  Aiding each other in tracking down a bug in your program after all code has been specified and implemented is fine.  I expect your programs to differ from each other in significant ways.  Group programming assignments should be worked on together with other group members.  You may discuss your algorithms and concept with other groups, but you may not share code.  I do reserve the right to ask you about your programs to ensure that you fully understand the coding and details of the implementation.

We will cover most of the material in the Main text, and half of the Dale text