Design and Analysis of Algorithms
computer science
about this course
Algorithms are unambiguous instructions for solving problems. From a utilitarian perspective, efficient use of computer machinery is both desirable and necessary. One of the key concerns regarding efficiency in computing is the time taken by a computing machine to run an algorithm. This course introduces some general principles and guidelines which enable designing faster algorithms for a wide range of computational problems.
Learning Outcomes include:
Learn to distinguish slow algorithms from faster ones by quantifying the amount of time taken by an algorithm to solve a problem through asymptotic analysis.
A view of the general
paradigms used for solving a problem, and an
overview of basic complexity classes.
Prove the correctness of an algorithm, and do a runtime analysis.
Ability to abstract computational tasks, and applying algorithmic techniques towards problem solving.
in these programmes
- computer science
required · 4-year major, 4-year double major, 3-year major, 3-year double major, 4-year minor, 3-year minor
planning & teaching
recently taught by
- Syed Mohammad MeesumAssistant Professor, Computer Science
Recorded in 2025 T3, 2024 T3. Instructors may change.