Complexity analysis and order notations, recurrence equations, brute force, divide-and-conquer techniques and the master theorem, transform-and-conquer and problem reduction, greedy method, dynamic programming, the knapsack and travelling salesman problems, graph algorithms, text processing and pattern matching techniques, P, NP, and NP-complete classes.
Weekly Contact: Lab:1 hr. Lecture:3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1