Graduate Course Descriptions

The following directory lists the graduate courses which the University expects to offer, although the University in no way guarantees that all such courses will be offered in any given academic year, and reserves the right to alter the list if conditions warrant. Click on the links below for a list of courses in that subject area. You may then click “View Classes” to see scheduled classes for individual courses.

5050. Algorithms and Complexity

3.00 credits

Prerequisites: Open to grad students in CSE, others with consent. Recommended preparation: Discrete math; fluency in a high-level programming language; data structures, algorithms at the level of CSE 2050. Students cannot receive credit for both CSE 3500 and 5050.

Grading Basis: Graded

Design and analysis of efficient computer algorithms. Algorithm design techniques, including divide-and-conquer, depth-first search, and greedy approaches. Worst-case and average-case analysis. Models of computation. NP-complete problems.


Last Refreshed: 23-FEB-24 05.20.22.336543 AM
To view current class enrollment click the refresh icon next to the enrollment numbers.
Term Class Number Campus Instruction Mode Instructor Section Session Schedule Enrollment Location Credits Grading Basis Notes
Fall 2024 4918 Storrs Online Asynchronous Bansal, Mukul 001 Reg 0/60 No Room Required - Online 3.00 Graded