The field of computer algorithms has flourished since the early 1960's when the users of electronic computers started to pay attention to the performance programs. This course emphasizes most of the algorithm design techniques that have proved their utility in the solution to many problems, such as induction, divide and conquer, dynamic programming, greedy approach, backtracking, randomized algorithms and approximation algorithms. This course will also gives an introduction to the field of computational complexity.
|