22C:21 Computer Science II: Data Structures

10:30-11:20 MWF Room 221 CB

Instructor: Sriram V. Pemmaraju
101G MLH, sriram@cs.uiowa.edu, 319-353-2956
Office Hours: 1 pm to 2 pm, MWF

This is the second in the sequence of core undergraduate computer science courses and is required for all computer science majors and minors. It builds on the first courses, Computer Science I: Fundamentals (22C:16) and and is concerned mainly with the design and implementation of data structures, algorithms for accessing and manipulating data structures, and the application and uses of data structures. Java is the programming language of choice for this course.

Required Legalese
This course is run by the College of Liberal Arts and Sciences. This means that class policies on matters such as requirements, grading, and sanctions for academic dishonesty are governed by the College of Liberal Arts and Sciences. Students wishing to add or drop this course after the official deadline must receive the approval of the Dean of the College of Liberal Arts and Sciences. Details of the University policy of cross enrollments may be found online here.

Prerequisite
C- or better in 22C:16

Textbook
Duane A. Bailey, Java Structures: Data Structures in Java for the Principled Programmer, Second Edition, McGraw Hill, ISBN 0-07-239909-0

Grading
Plus/Minus grading will be used for the course. There are three components that will determine your grade.

10 Quizzes: 20% Each quiz will be 10 minutes long, and will usually take place in-class on a Friday. I will not announce the quizzes beforehand.
3 Programming Projects: 30% You will have 3 weeks to work on each programming project.
2 Exams: 50% There will be one mid-term exam and one final. Each exam will be worth 25% of your total grade. The schedule for the exams is:
```
Midterm			Oct 13th			10:30-11:20 (in 321 CB)
Final			Dec 15th			9:45-11:45 (in 321 CB)
```
All exams will be open book/notes exams. The final will be cumulative,

Late submissions will not be accepted and in general you will be better off turning in what you have on time rather than seeking extra time to complete your work. Starting early is the key, especially to completing the programing projects on time. There will be no make-up exams in general and exceptions will be rare and only for students whose reasons are included in the University's policy on "Excused Absences from Examinations".

Solutions will be provided on the course page for all graded work, including programming assignments.

Teaching Assistants and Discussion Sections
There are two TAs for the course: Gregory Nichols and Zhihong Wang. They will lead discussion sections according to the following schedule.

Section		Time			Location		TA
A02             10:30-11:20 Tuesday     118 MLH                 Zhihong Wang
A03             9:30-10:20 Tuesday      218 MLH                	Zhihong Wang 
A04             3:30-4:20 Tuesday       3321 SC                	Gregory Nichols 
A05             11:30-12:20 Thursday    114 MLH                 Gregory Nichols

Discussion sections provide opportunity to deepen your understanding of concepts covered in lectures. The TAs will divide their time between going over examples they have prepared and answering your questions. Because of their smaller size, discussion sections provide an environment in which students feel comfortable asking questions. Contact information and office hours for the TAs are as follows:

Name			Email			Office and Phone	Hours
Gregory Nichols         gbnichol@cs.uiowa.edu   201C MLH, 353 2546 	11am-12:30pm T, 2:30pm-4pm Th
Zhihong Wang            zhihwang@cs.uiowa.edu   101K MLH, 353-2542	4pm-5pm, TW, 3pm-4pm F

You should think of the TAs as the front-line for getting help in this course. Together they have 6 office hours per week, spread through the week and will also answer questions by e-mail and on the phone.

Students with disabilities
I need to hear from anyone who has a disability, which may require some modification of seating, testing or other class requirements so that appropriate arrangements may be made. Please contact me during my office hours.

Academic Dishonesty
Academic dishonesty will not be tolerated. Under no circumstances should you pass off someone else's work as your own. This also applies to code or other material that you might find on the internet. Note that we will routinely use available software systems for detecting software plagiarism, to test any suspicions we might have. If you are unclear about what constitutes academic dishonesty contact your professor or consult the printed policy in the Schedule of Courses and the CLAS Bulletin (online version). We do want students to talk to each other about concepts and ideas that relate to the class. However, it is important to ensure that these discussions do not lead to the actual exchange of written material.

Student Complaints
If you have any complaints or concerns about how the course is being conducted by me or by the TAs please feel free to talk to me. You are also welcome to get in touch the the Computer Science department chair, Prof. Jim Cremer (cremer@cs.uiowa.edu, 319-335-1713, 14D McLean Hall). Consult the college policy on Student Complaints Concerning Faculty Actions (online version) for more information.

Topics
The data structures we will study in this course include:

Arrays, vectors, multi-dimensional arrays and vectors (Chapter 3)
Linked lists (Chapter 8)
Stacks and queues (Chapter 9)
Binary trees (Chapter 11)
Priority queues (Chapter 12)
Search trees (Chapter 13)
Hash tables (Chapter 14)
Graphs (CHapter 15)

We will also study the following other topics:

Run time analysis of algorithms (Chapter 4)
Recursion (Chapter 4)
Sorting and searching (Chapters 5 and 10)

We will cover most of the material in Chapters 3, 4, 5, 8, and 9 before the mid-term and the rest of the material after the mid-term. This plan is tentative and is subject to change depending on feedback from students and the TAs.