CSE 3101 3.0 Design and Analysis of Algorithms This course is intended to teach students the fundamental techniques in the design of algorithms and the analysis of their computational complexity. Each of these techniques is applied to a number of widely used and practical problems. At the end of this course, a student will be able to: choose algorithms appropriate for many common computational problems; to exploit constraints and structure to design efficient algorithms; and to select appropriate tradeoffs for speed and space.

Topics covered may include the following:

Suggested reading: Course Learning Outcomes Prerequisites: General prerequisites, CSE2001 3.0, MATH1090 3.0, MATH1310 3.0