Math, Statistics, & Comp Scnc
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.
Pointers and dynamic memory allocation in C/C++, recursion, stacks, queues, heaps, binary and multiway trees, graphs, hash tables. Sorting and searching algorithms. Course Information: Prerequisite(s): Grade of C or better in MCS 160 or Grade of C or better in MCS 260; and Grade of C or better in MCS 275 . Class Schedule Information: To be properly registered, students must enroll in one Discussion/Recitation and one Lecture.