| Course Page | Syllabus | Calendar | Resources |
| Prerequisite: CSCI
51 or
equivalent. "Equivalent" means an AP course or another substantial
introductory course in the Java programming language. Class: Monday, Wednesday, and Friday; 10:00–10:50 am. Lincoln 1135. Laboratory: Tuesday, 1:15–2:30 or 2:45–4:00 pm. Edmunds 229. You must enroll in and attend one laboratory session; you are encouraged to stay for both sessions. The first laboratory session is on Tuesday, January 29. You will need an account on the Computer Science system. If you have taken a previous Computer Science course at Pomona College, you already have one. If you preregistered for this course, an account has been set up and you will receive your password at the first class meeting. If you did not preregister, see Matthew Bradley in Edmunds 218 to obtain an account. Be sure to have an account and password by the first laboratory session. Instructor: Professor Bull. Edmunds 225, extension 18709. Everett.Bull@pomona.edu. Office hours: Monday 3:00 to 4:00, Thursday 10:00 to 11:00, and by appointment. Course assistants: Eric Kuefler and Charles Zhou. In lab and Wednesday 8:00 to 10:00 pm. Course Web Pages: http://www.cs.pomona.edu/classes/cs062. Pay frequent attention to the course calendar; it will have current information on assignments, schedules, and events. Textbooks: Duane A. Bailey, Java Structures, √7 edition, 2007. Available at the Coop Store in the Smith Campus Center at Pomona College. Required. Mark Allen Weiss, C++ for Java Programmers, Pearson Prentice Hall, 2004, ISBN 9780139194245. Available at Huntley Bookestore. Recommended. Catalog Description: Abstract data types and efficient data structures, including priority queues, dynamic dictionaries, and disjoint sets. Analysis of data structures, including worst-case, average-case, and amortized analysis. Storage reclamation. Extensive practice in implementing these data structures in Java. Includes an introduction to manual memory management in C++. This course serves the same role as HMC CS 70 as a prerequisite for upper division computer science courses at any of the Claremont Colleges. Topics: Object-oriented design and complexity analysis. Sorting and searching. Lists, including linked lists, stacks, and queues. Trees and balanced trees. Priority queues. Sets, maps, and dictionaries. Memory management techniques. The majority of the course will use the Java programming language. Toward the end of the course, we will use the language C++ as a contrast to Java and as a vehicle to illustrate memory management.
Policy on Academic Honesty: In the past, there have been a few unfortunate instances in which students in the class have presented work other than their own. See pages 41–42 of the 2007–2008 Pomona College Catalog or pages 94–98 of the 2007–2008 Pomona College Student Handbook for the college's policy on academic honesty. Students from other colleges are governed by the policies of their home campuses. You are allowed (encouraged, even!) to discuss general approaches to solving problems, but all work you submit must be your own. Working “together” or presenting variants of the same file is not acceptable. Do not exchange programs or program fragments in any form—on paper, via electronic mail, or by other means. Identical, or nearly identical, papers will be considered conclusive evidence of plagarism. Copying solutions from any source, including the web or previous CS 62 students, is not allowed. Contact the instructor if you have questions about what is appropriate collaboration. Plagiarism will result in the following actions:
|
| Course Page | Syllabus | Calendar | Resources |
|
|
|||
| Last edited February 5, 2008 |
 |
||