Course Outcomes & CO-PO-PSO Mapping and Justification

Subject DESIGN AND ANALYSIS OF ALGORITHMS 18CS42

COURSE OUTCOMES:

Cognitive
CO No. On completion of this course, students will be able to:
Level

Understand the notion of an algorithm, asymptotic notations and divide

18CS42.1 L2
and conquer.

Analyze the recursive and non-recursive algorithms and divide and

18CS42.2 L4
conquer.

18CS42.3 Understand the algorithm design techniques using greedy method. L2

Understand the algorithm design techniques using dynamic

18CS42.4 L2
programming.

Explain the algorithm design techniques using backtracking, branch and

18CS42.5 L2
bound and NP-complete and NP-hard problems.

CO-PO-PSO MAPPING

CO No. PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

18CS42.1 3 3 1 - - - - - - - - 1 3 - -

18CS42.2 2 3 1 - - - - - - - - 1 3 - -

18CS42.3 2 2 3 - - - - - - - - 1 3 - -

18CS42.4 2 2 3 - - - - - - - - 1 3 - -

18CS42.5 2 2 3 - - - - - - - - 1 3 - -
Avg.
2.2 2.4 2.2 - - - - - - - - 1.0 3.0 - -
Mapping

Page 1 of 3
CO-PO-PSO JUSTIFICATION

CO No. PO/PSO CL Justification

Strongly mapped as students will be able to gain the knowledge of

PO1 3
asymptotic notations, divide and conquer.
Strongly mapped as students will be able to analyze the algorithms of divide
PO2 3
and conquer.
Slightly mapped as students will be able to design new algorithms using
18CS42.1 PO3 1
divide and conquer technique.
Slightly mapped as students will be able to apply the concept of divide and
PO12 1
conquer technique in searching and sorting etc. problem types.
Strongly mapped as students will be able to apply the searching and sorting
PSO1 3
techniques in real world problems.
Moderately mapped as students will be able to gain the knowledge of
PO1 2 general plan of recursive and non-recursive algorithms and theory of
backward substitution in divide and conquer technique.
Strongly mapped as students will be able to analyze the time and space
PO2 3
complexity of recursive and non-recursive algorithms.

18CS42.2 Slightly mapped as students will be able to design new algorithms using
PO3 1
divide and conquer technique.
Slightly mapped as students will be able to analyze the efficiency of any new
PO12 1
algorithm designed by divide and conquer.
Strongly mapped as students will be able to apply the searching and sorting
PSO1 3
techniques in real world problems.
Moderately mapped as students will be able to gain the knowledge of greedy
PO1 2
method concepts.
Moderately mapped as students will be able to analyze the time and space
PO2 2
complexity of greedy algorithms.
Strongly mapped as students will be able to design new algorithms using
18CS42.3 PO3 3
greedy technique.
Slightly mapped as students will be able to analyze the efficiency of any new
PO12 1
algorithm designed by greedy techniques.
Strongly mapped as students will be able to apply the greedy techniques in
PSO1 3
real world problems such as Resource management in software.

Page 2 of 3
 Moderately mapped as students will be able to gain the knowledge of
PO1 2
dynamic method concepts.
Moderately mapped as students will be able to analyze the time and space
PO2 2
complexity of dynamic programming algorithms.
Strongly mapped as students will be able to design new algorithms using
18CS42.4 PO3 3
dynamic programming technique.
Slightly mapped as students will be able to analyze the efficiency of any new
PO12 1
algorithm designed by dynamic programming techniques.
Strongly mapped as students will be able to apply the dynamic programming
PSO1 3
techniques in real world problems such as TSP, reliability design.
Moderately mapped as students will be able to gain the knowledge of
PO1 2
backtracking, branch and bound concepts.
Moderately mapped as students will be able to analyze the time and space
PO2 2
complexity of backtracking, branch and bound algorithms.
Strongly mapped as students will be able to design new algorithms using
18CS42.5 PO3 3
backtracking, branch and bound technique.
Slightly mapped as students will be able to analyze the efficiency of any new
PO12 1
algorithm designed by backtracking, branch and bound techniques.
Strongly mapped as students will be able to apply the backtracking, branch
PSO1 3 and bound in real world problems such as event scheduling, stratification of
triangle meshes in computer graphics.

Prepared by HoD

Kavitha Bai A S/Vijayashree HP/Rosline Mary Dr.M.Ramakrishna

Page 3 of 3