COMPSCI 2210A/B
DATA STRUCTURES AND ALGORITHMS
Lists, stacks, queues, priority queues, trees, graphs, and their associated algorithms; file structures; sorting, searching, and hashing techniques; time and space complexity.
Difficulty
2.9 of 5 Stars
Useful
3.9 of 5 Stars
Attendance
10 rating(s)
Written Reviews (0)
Prerequisites
Either 1) COMPSCI 1027A/B, COMPSCI 1037A/B, the former Computer Science 2101A/B, , COMPSCI 2121A/Bor DIGIHUM 2221A/Bin each case with at least 65%, and 1.0 course with at least 60% in each from: APPLMATH 1201A/B, NMM 1411A/B, NMM 1412A/B, NMM 1414A/B, CALCULUS 1000A/B, CALCULUS 1301A/B, CALCULUS 1500A/B, CALCULUS 1501A/B, MATH 1600A/B, the former Applied Mathematics 1411A/B, the former Applied Mathematics 1412A/B, the former Applied Mathematics 1414A/B, the former Applied Mathematics 1413; or 2) INTEGSCI 1001Xwith at least 60%.
Antirequisites
Extra Info
3 lecture hours.
Locations
Western Main Campus