This course builds on the programming skills acquired in Computer Science 134. Special emphasis is placed on analysis, modularization, and data abstraction. Students are introduced to some of the most important and frequently used data structures: lists, stacks, queues, trees, hash tables, graphs, and files. Other topics covered include analysis of algorithm complexity and program verification.
Format: lecture/laboratory. Evaluation will be based on programming assignments and examinations Prerequisite: Computer Science 134 or equivalent. (Mathematics 251 is recommended, but not required as a prerequisite or corequisite for the course.) Enrollment limit: 36 (expected: 20). This is a quantitative/formal reasoning course.