Algorithm design and analysis; techniques based on divide and conquer, branch and bound, dynamic programming, and the greedy approach; computer engineering applications such as circuit partitioning and logic circuit technology mapping; computational complexity and NP-completeness.
(Lec: 3, Lab: 0.5, Tut: 0.5)