ALGORITHM AND COMPLEXITY

Course Outcomes

At the end of the course, students should be able to:

  1. Use Big-O notation formally to analyze time and space complexity.
  2. Choose and apply appropriate algorithm design techniques.
  3. Solve problems using divide and conquer, backtracking, greedy, and dynamic programming.
  4. Describe the behavior and running time of searching, sorting, and graph algorithms.

https://docs.google.com/presentation/d/1xV36kzWOoQ-7MDHhEVChL-YIREzSa8iW/edit?usp=drive_link&ouid=115848848609438889926&rtpof=true&sd=true