CSI 403
Design and Analysis of Algorithms
University at Albany · UGRD · Fall 2026
1 section
Catalog description
Algorithm efficiency based on asymptotic notation and analysis for iterative and recursive algorithms. Algorithm design strategies: iterative, divide-and-conquer, greedy and dynamic programming. Set management including hashing, disjoint sets and heaps. Algorithms on graphs and trees. Prerequisite(s): grade of C or better in both I CSI/I ECE 210 and I CSI/I ECE 213.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #albany_2-CSI403Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?