Scribd
Upload
2 views

DAA CO-PO JUSTIFICATION - Copy

The document outlines the course outcomes for the Design and Analysis of Algorithms (PC502CM) at Matrusri Engineering College for the academic year 2024-25. It details the competencies students are expected to achieve, including algorithm complexity analysis, problem-solving strategies, and understanding NP-hardness. Additionally, it includes a mapping of course outcomes to program outcomes and confirms that there are no changes to the syllabus.

Uploaded by

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

DAA CO-PO JUSTIFICATION - Copy

The document outlines the course outcomes for the Design and Analysis of Algorithms (PC502CM) at Matrusri Engineering College for the academic year 2024-25. It details the competencies students are expected to achieve, including algorithm complexity analysis, problem-solving strategies, and understanding NP-hardness. Additionally, it includes a mapping of course outcomes to program outcomes and confirms that there are no changes to the syllabus.

Uploaded by

hodit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

MATRUSRI ENGINEERING COLLEGE

SAIDABAD, HYDERABAD – 500 059


DEPARTMENT OF INFORMATION TECHNOLOGY

Subject with Code: Design and Analysis of Algorithms -PC502CM


AY-2024-25
Faculty Name: Dr G.Shyama Chandra Prasad

CO Definition – The student can able to


Course
Explanation
Outcome

PC502CM.1 To Compute and analyze complexity of algorithms using Asymtotic notations

To solve problems using divide and conquer and greedy strategy and computing
PC502CM.2
time and space compexity
To Illustrate Dynamic programming strategies and back tracking strategies.
PC502CM.3

To Examine various graph algorithms and their complexities.


PC502CM.4

To understand NP-hard and NP-completeness


PC502CM.5

A. CO mapping with POs

PO PO PO PO PO PO PO
CO’s PO1 PO2
3 4 5 6 7 8 9
PO 10 PO 11 PO 12 PSO1 PSO2

3 2 2 2 – – – – – – – – 2 2
PC502CM.1

3 2 2 2 – – – – – – – – 2 2
PC502CM.2

3 2 2 3 – – – – – – – – 2 2
PC502CM.3

3 2 3 2 – – – – – – – – 2 2
PC502CM.4

2 2 3 3 – – – – – – – – 2 2
PC502CM.5

PC502CM 2.3
2.67 2 2.5 2 2
(AVG) 3

B. Course Mapping with POs:


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

Course 2.67 2 2.5 2.33 2 2

C. Any change in Syllabus: No change.


Course Name: Design and Analysis of Algorithms Course Code: PC 502 CM
Year-Sem: B.E. III/IV Semester: V
A.Y: 2023-24
Course Explanation POs PSOs Cognitive Level
Outcome
To Compute and analyze complexity of PO1,PO2,PO3,P PSO1,PS Understand ,Applying,
PC502CM.1
algorithms using Asymtotic notations O4 O2 Analyzing, Evaluating
To solve problems using divide and
PO1,PO2,PO3,P PSO1,PS Understand and
PC502CM.2 conquer and greedy strategy and
O4 O2 Analyze
computing time and space compexity
To Illustrate Dynamic programming Understand ,Applying,
PO1,PO2,PO3,P PSO1,PS
PC502CM.3 strategies and back tracking strategies. Analyzing, Evaluating
O4 O2

To Examine various graph algorithms Understand ,Applying,


PO1,PO2,PO3,P PSO1,PS
PC502CM.4 and their complexities. Analyzing, Evaluating
O4 O2

To understand NP-hard and NP- Understand ,Applying,


PO1,PO2,PO3,P PSO1,PS
PC502CM.5 completeness Analyzing, Evaluating
O4 O2
Justification for CO-PO Mapping

COs Justification for CO-PO Mapping

CO1

CO2
CO3
CO4

CO5

Faculty Name: Dr. Shyama Chandra Prasad

Signature: Verified and Approved by: HoD - IT

You might also like