Description |
The objective of this course is to provide students with the knowledge and skills in complexity analysis and design of computer algorithms. Topics to be covered include: sorting algorithms, search algorithms, divide and conquer, greedy method, trees, graphs, dynamic programming, backtracking, branch and bound, Lower bound theory, NP-complete problems. The practical part of the course will include writing programs for solving problems using techniques taught in this course.
|