Scribd
Upload
82 views3 pages

CO-PO Mapping for Operation Research

The document outlines the course outcomes, mapping of course outcomes to program outcomes and program specific outcomes, and justification for the mappings of a course on operation research. The 5 course outcomes include understanding objectives and models of operation research, solving linear programming problems using different methods, solving transportation and assignment problems, and understanding metaheuristics. The outcomes are mapped to 12 program outcomes and 3 program specific outcomes on a scale of 1 to 3.

Uploaded by

panimalarcsbs2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
82 views3 pages

CO-PO Mapping for Operation Research

The document outlines the course outcomes, mapping of course outcomes to program outcomes and program specific outcomes, and justification for the mappings of a course on operation research. The 5 course outcomes include understanding objectives and models of operation research, solving linear programming problems using different methods, solving transportation and assignment problems, and understanding metaheuristics. The outcomes are mapped to 12 program outcomes and 3 program specific outcomes on a scale of 1 to 3.

Uploaded by

panimalarcsbs2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Course Outcomes &CO-PO-PSO Mapping and Justification

Subject Operation research 17CS653

COURSE OUTCOMES:

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

17CS653.1 Understand the objectives, phases, models, used in operation research L2

Solve linear programming problems using simplex method ,Big M method 2-


17CS653.2 L3
phase method

Solve linear programming problems using duality theory and post optimality
17CS653.3 L3
analysis

17CS653.4 Solve problems on transportation, assignment problems and game theory. L3

Understand the nature of metaheuristics, simulated annealing and genetic


17CS653.5 L2
algorithms, tabu search method

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

17CS653.1 2 2 - - - - - - - - - - - - -

17CS653.2 2 2 - - - - - - - - - 1 - - -

17CS653.3 2 2 - - - - - - - - - 1 - - -

- - -
17CS653.4 2 3 - - - - - - - - - 1

17CS653.5 1 1 - - - - - - - - - 1 - - -

Avg. 1.0 - -
1.8 2.0 - - - - - - - - - -
Mapping

Page 1 of 3
CO-PO-PSO JUSTIFICATION

CO No. PO/PSO CL Justification

Moderately mapped as students gain knowledge on objectives, phases and


PO1 2
models of formulation of linear programming problem .
17CS653.1 Moderately mapped as students have an ability to formulate a solution

PO2 2 plan and methodology for an linear programming problem and evaluate
problem statements and identifies objective function.
Moderately mapped as students apply the knowledge of engineering

PO1 2 fundamentals and gauss –Jordan technique on simplex method and Big-M
method.
Moderately mapped as students are having ability to identify solution for
17CS653.2
PO2 2 simplex problem and Big-M and improve the objective function value in
the next occurring tables.
Slightly mapped as students apply the linear programming model using
PO12 1
simplex method in every field of business
Moderately mapped as students apply the knowledge of numerical

PO1 2 techniques such as gauss-Jordan method to solve revised simplex


problems.
Moderately mapped as students are having ability to identify solution for
17CS653.3
PO2 2 duality theory and post optimality analysis and improve the objective
function value in the next occurring tables.
Slightly mapped as students apply the linear programming model using
PO12 1
revised simplex method in business field.
Moderately mapped as students apply the knowledge of Vogels
PO1 2
approximation method to solve transportation problems.
Highly mapped as students are having ability to identify optimal solution

17CS653.4 PO2 3 for Transportation problem and assignment problems using Loop
construction and MODI method.
Slightly mapped as students apply the linear programming model using
PO12 1
Transportation problem and assignment problem in business field.
Slightly mapped as students gain knowledge nature of metaheuristics,
PO1 1
simulated annealing and genetic algorithms, tabu search method.
Slightly mapped as students identifies mathematical algorithmic
17CS653.5 knowledge thatapplies to a given problem such as simulated annealing
PO2 1
,genetic algorithms and tabu search method.

PO12 1 Slightly mapped as students apply the linear programming model using

Page 2 of 3
tabu search method in business field

Prepared by HoD

Kavitha Bai A S [Link]

Page 3 of 3

You might also like