Prerequisites: CS 014 with a grade of “C-” or better; CS 111; MATH 009C or MATH 09HC; proficiency in C++
Description: Explores basic algorithm analysis using asymptotic notations, summation and recurrence relations, and algorithms and data structures for discrete structures including trees, strings, and graphs. Also covers general algorithm design techniques including “divide-and-conquer,” the greedy method, and dynamic programming. Integrates knowledge of data structures, algorithms, and programming.
Serves as a prerequisite for
CS 145 CS 151 CS 165 CS 179E CS 179G CS 206 CS 218 CS 220 CS 229 CS 230 CS 234 CS 235 CS 236 CS 238 CS 240 CS 246 CS 257 CS 272Referenced in
- Computer Engineering — Major Requirements
- Computer Science and Engineering — Major Requirements
- Computer Science and Engineering — Business Informatics Major
- Graduate Program
- Mathematics — Major Requirements for the Bachelor of Arts and Bachelor of Science in Mathematics
- Statistics — Major Requirements