CSE 101Design and Analysis of Algorithms
Design and analysis of efficient algorithms with emphasis of nonnumerical algorithms such as sorting, searching, pattern matching, and graph and network algorithms. Measuring complexity of algorithms, time and storage. NP-complete problems.
Prerequisites
From the catalog: “CSE 21 or MATH 154 or MATH 158 or MATH 184 or MATH 188 and CSE 12 or DSC 30; restricted to undergraduates. Graduate students will be allowed as space permits.”
Where it sits in degree plans
Suggested plans most often put it in Year 2 · Spring (3 programs).
Required in (5)
- Artificial Intelligence
- Bioengineering: Bioinformatics (B.S.)
- Biology with a Specialization in Bioinformatics (B.S.)
- Computer Science (B.S.)
- Computer Science with Specialization in Bioinformatics (B.S.)