ITUE204 : Design and analysis of algorithms

CO1: Analyze the time and space complexity of algorithms to evaluate efficiency of algorithm for solving computational problems. 

CO2: Apply efficient algorithm design technique such as Divide & Conquer, Greedy, Dynamic Programming, Backtracking, Branch & Bound to solve computational problem. 

CO3: Apply Graph algorithms to find shortest path, exploring connectivity.

CO4: Identify whether a given problem is tractable or intractable, and apply reduction theory to relate the complexity of different problems.