CSC 372 Analysis of Algorithms

Course Goals

The primary objective of this course is to take students further into the area of analysis of algorithms, a central topic in computer science. The course also facilitates life-long learning in computer science by providing the student with foundational material that continues to be applicable even as the discipline rapidly evolves.

Course Outcomes

A student who successfully completes this course should, at a minimum, be able to:

  1. be able to solve recurrence relations using several different methods such as the substitution method, recursion trees, and the master theorem
  2. be able to apply dynamic programming to solve problems
  3. be able to apply greedy algorithms to solve problems
  4. be able to use amortized complexity to bound the run time of an algorithm
  5. be able to explain the theoretical background of the FFT and derive its run time
  6. be able to use known algorithms to solve problems in Computational Geometry
  7. gain experience working in teams solving problems using C++
Computer Science Student Outcomes
Course Outcomes #1 #2 #3 #4 #5 #6 #7
1 X X
2 X
3 X
4 X X
5 X
6 X
7 X X X