Computer Science 187 - Programming w/Data Structures

The course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to implement abstract data collections and their associated operations. Specific implementations include linked structures, recursive structures, binary trees, balanced trees, and hash tables. Algorithm analysis and asymptotic bounding of implementations is a major topic throughout the course. The topics covered in this course are fundamental to programming and are essential to further computer science courses.

Open to undergraduate students. COMPSCI 121 w/ B or 186 w/ C REQUIRED PREREQUISITE: GRADE OF B OR BETTER IN COMPSCI 121 (OR C OR BETTER IN COMPSCI 186). ALL STUDENTS WITH AP OR TRANSFER CREDIT FOR 121 WILL REQUIRE AN OVERRIDE TO ENROLL. AFTER CS MAJORS AND CICS-ET MAJORS REGISTER, 187 WILL OPEN TO ALL UNDERGRADUATES WHO MEET PREREQUISITE. NON-CS MAJORS WITH THE REQUIRED PREREQUISITE TAKEN AT UMASS SHOULD NOT REQUEST AN OVERRIDE AND WAIT FOR THE MAJOR RESTRICTION TO BE REMOVED. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.