10:30-11:20 MWF Room 106 GILH
Sriram V. Pemmaraju
101G MLH, email@example.com, 319-353-2956
Office Hours: 9-10 Tuesday, 11:30-12:30 Wednesday, and 2:30-3:30 Friday.
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, but the last programming project will contain pieces that you will have to complete in C.
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.
C- or better in 22C:16
Mark Allen Weiss, Data Structures and Algorithm Analysis in Java, Second Edition, Published by Addison Wesley, ISBN 0-321-37013-9. Go here to look for bargains on this book.
Plus/Minus grading will be used for the course. There are three components that will determine your grade.
Midterm March 9th, Friday 10:30-11:20 (in 106 GILH) Final May 8th, Tuesday 12:00-2:00 (in 106 GILH)All exams will be open book/notes exams. The final will be cumulative,
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: Uday Verma and Saurav Pandit. They will lead discussion sections according to the following schedule.
Section Time Location TA A01 12:30-1:20 Th N200 LC Uday Verma A02 8:30-9:20 Th 132 MH Saurav Pandit A04 2:30-3:20 Th 130 SH Saurav PanditDiscussion 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 for the TAs and office hours will be announced shortly. 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 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.
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 (firstname.lastname@example.org, 319-335-1713, 14D McLean Hall). Consult the college policy on Student Complaints Concerning Faculty Actions (online version) for more information.
Here is a tentative list of topics planned for this offering of the course.