Zeph Grunschlag

Survey Results

32 of 40 students responded

Instructor: Organization and Preparation2.97
Instructor: Classroom Delivery3.03
Instructor: Approachability3.81
Instructor: Overall Quality3.31
Course: Amount Learned3.91
Course: Appropriateness of Workload3.19
Course: Fairness of Grading Process3.59
Course: Quality of Text3.09
Course: Overall Quality3.53

Course Information

Prerequisite: Comp. Sci. W1007. Corequisite: Comp. Sci. W3203. Data types and structures: arrays, stacks, singly and doubly linked lists, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing, garbage collection. Storage management. Rudiments of the analysis of algorithms. Note: Starting in spring 1999, this course will assume knowledge of Java as taught in Comp. Sci. W1007 or W3101.

Department: Computer Science(COMS)

Subject: Computer Science(COMS)

School: School of the Arts, Barnard College, Columbia College, School of General Studies, Graduate School of Arts and Sciences, School of International and Public Affairs, Continuing Education and Special Programs

Division: Interfaculty

Course ID: 3139