This course covers fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming and NP completeness. | Prerequisites for Brooklyn Engineering Students: (CS-UY 2134 or CS-UY 1134) and (CS-UY 2124 or CS-UY 1124) (C- or better) and MA-UY 2314; Corequisite: EX-UY 1 | Prerequisites for Abu Dhabi Students: (ENGR-UH 3510 or CS-UH 1050) (C- or better) and CS-UH 1002 | Prerequisite for Shanghai Students: CSCI-SHU 210 (C- or better) and CSCI-SHU 2314

Computer Science (Undergraduate)
3 credits – 14 Weeks

Sections (Fall 2024)

CS-UY 2413-000 (12269)
09/03/2024 – 12/12/2024 Mon,Wed
2:00 PM – 3:00 PM (Early afternoon)
at Brooklyn Campus
Instructed by Hellerstein, Lisa

CS-UY 2413-000 (12270)
09/03/2024 – 12/12/2024 Mon,Wed
5:00 PM – 6:00 PM (Late afternoon)
at Brooklyn Campus
Instructed by Hellerstein, Lisa