StudyPath

CSC 451 Analysis of Algorithms

400 levelComputing & ICT10 topics

CSC 451 covers 10 topics. StudyPath paces them into daily study sessions that finish before your exam date, with practice questions and worked answers for each one.

Study CSC 451 on StudyPath

Free for every student. No card.

Course outline

The topics this course covers, in teaching order.

  1. Asymptotic notation and growth of functions
  2. Analysis of iterative and recursive algorithms
  3. Recurrence relations and the master theorem
  4. Divide-and-conquer algorithms
  5. Dynamic programming
  6. Greedy algorithms
  7. Graph algorithms: shortest paths and spanning trees
  8. Backtracking and branch-and-bound
  9. Complexity classes P and NP
  10. NP-completeness and reductions

A sample from this course

One topic, as StudyPath teaches it.

Asymptotic notation and growth of functions

Asymptotic notation is the language used to describe how an algorithm’s time or space requirement grows as input size becomes very large. For exam purposes, you must master the meanings of Big-O, Big-Theta, and Big-Omega, compare common growth rates, and know how to ignore constants and lower-order terms when classifying functions.

What you get for CSC 451

Course outlinesBrowse the full catalogue by course code
›
About StudyPathWhat StudyPath is, and what it costs
›
Contact & supportQuestions, problems, anything at all
›