Computer Science
Based on all available term-level grade data for this course
Ranked highest to lowest GPA — using A, B, C, D, and F outcomes only
Compare a professor, browse nearby courses, or ask Sparky.
Get a quick summary of difficulty, fit, and professor picks.
Design, usage and analysis of data structures: review of lists, stacks and queues; hash tables, priority queues, search trees, introduction to graphs; searching and sorting; runtime analysis; programming projects and lab exercises. Course Information: 4 hours. Prerequisite (s): Grade of C or better in CS 141 or Grade of C or better in CS 107 ; and Grade of C or better in CS 151 ; and Credit or concurrent registration in CS 211 or Credit or concurrent registration in ECE 266 . Class Schedule Information: To be properly registered, students must enroll in one Lecture-Discussion and one Laboratory.
