22C:21 Computer Science II: Data Structures

10:30-11:20 MWF Room 109 EPB

Instructor: Sriram V. Pemmaraju
101G MLH, sriram@cs.uiowa.edu, 319-353-2956
Office Hours: 11:30-12:30 MW, 9:30-10:30 F

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
Robert Lafore, Data Structures and Algorithms in Java, Second Edition, Published by SAMS, ISBN 0672324539. Go here to look for bargains on this book.

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

5 Quizzes: 15% Each quiz will be 20 minutes long, and will take place in the discussion sections. The quizzes will be unannounced.
4 Homeworks: 20% These will be posted on the class homepage and you will have one week for each homework.
3 Programming Projects: 30% These will be posted on the class homepage and you will have 3 weeks to work on each programming project.
2 Exams: 35% There will be one mid-term exam (worth 15% of your grade) and one final (worth 20% of your grade). The schedule for the exams is:
```
Midterm			Oct 14th, Friday			10:30-11:20 (in 109 EPB)
Final			Dec 15th, Thursday			7:30-9:30 (in 109 EPB)
```
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 three TAs for the course: Yan Wang, Alankar Kampoowale, and Zhihong Wang. They will lead discussion sections according to the following schedule.

Section         Time                    Location                TA
A01             12:30-1:20 Tuesday      C29, PC			Alankar Kampoowale
A02             2:30-3:20 Thursday	71 SH			Zhihong Wang	
A04             3:30-4:20 Thursday    	210 MLH 		Yan Wang

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 is as follows:

Name                    Office  Phone           e-mail                  Office hours
Alankar Kampoowale      B20J    335 3650        akampoow@cs.uiowa.edu   12-1, MW
Zhihong Wang            301 MLH TBA             zhihwang@cs.uiowa.edu   2-3, WF
Yan Wang                B20J    335 3650        ywang4@cs.uiowa.edu     1:30-2:30 T, 2:30-3:30 Th

You should think of the TAs as the front-line for getting help in this course. Together they will 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 would like to hear from anyone who has a disability which may require seating modifications or testing accommodations or accommodations of 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 2)
Linked lists (Chapter 5)
Stacks and queues (Chapter 4)
Binary trees (Chapter 8)
Binary search trees (Chapter 9)
Heaps (Chapter 12)
Hash tables (Chapter 11)
Graphs (Chapter 13-14)

We will also study the following other topics:

Run time analysis of algorithms (part of Chapter 2)
Recursion (Chapter 6)
Sorting and searching (Chapters 3 and 7)

We will cover most of the material in Chapters 2, 3, 5, 6, and 7 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.