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.
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: 27-SEP-22 05.20.19.331028 AM
|Term||Class Number||Campus||Instruction Mode||Instructor||Section||Session||Schedule||Enrollment||Location||Credits||Grading Basis||Notes|
|1223 17511 1 001||Spring 2022||17511||Storrs||Online||Bansal, Mukul||001||Reg||12:00am‑12:00am
||18/30||No Room Required - Online||3.00||Graded|
|1228 14263 1 001||Fall 2022||14263||Storrs||Online||Bansal, Mukul||001||Reg||12:00am‑12:00am
||15/40||No Room Required - Online||3.00||Graded||To view the syllabus visit this url;