DATA STRUCTURES IN C

Section

Professor

Naomi Novik

Survey Results

30 of 34 students responded

Instructor: Organization and Preparation3.67
Instructor: Classroom Delivery3.47
Instructor: Approachability3.4
Instructor: Overall Quality3.43
Course: Amount Learned3.47
Course: Appropriateness of Workload3.07
Course: Fairness of Grading Process3.43
Course: Quality of Text3.1
Course: Overall Quality3.33

Course Information

Prerequisite: COMS W1003 or knowledge of C. Datatypes 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. Not intended for computer science majors. Taught in C. Note: Due to significant overlap in these classes, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, or W3139.

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: 3133