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 – 15 Weeks
Sections (Spring 2025)
CS-UY 2413-000 (16641)01/21/2025 – 05/06/2025 Mon,Wed2:00 PM – 3:00 PM (Early afternoon)at Brooklyn CampusInstructed by Aronov, Boris
CS-UY 2413-000 (16642)at Brooklyn CampusInstructed by