5CS4-05.1

Describe asymptotic analysis concepts and use them to evaluate the time-complexity of different algorithms.

5CS4-05.2

Explain, apply and analyze the divide and conquer, greedy method and dynamic programming techniques to solve various engineering problems.

5CS4-05.3

Discuss and use Branch and Bound, and pattern-matching algorithms.

5CS4-05.4

Discuss randomized algorithms for min-cut and 2-SAT problem.

5CS4-05.5

Understand the concepts of NP-Hard and NP-Complete problems.

 COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

PSO 1

PSO 2

PSO 3

CO1

2

-

1

-

-

-

-

-

-

-

-

-

3

-

-

CO2

3

2

2

-

3

-

-

-

-

-

-

-

3

-

-

CO3

2

2

-

-

3

-

-

-

-

-

-

-

3

-

-

CO4

2

1

-

-

-

-

-

-

-

-

-

-

3

-

-

CO5

-

-

-

-

-

-

-

-

-

-

-

-

3

-

-

Avg

2.25

1.67

1.5

-

3

-

-

-

-

-

-

-

3

-

-