P.S.V.

COLLEGE OF ENGINEERING AND TECHNOLOGY

(Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai)
Accredited by the NAAC with ‘A’ Grade
(Inclusion under sections 2(f) & 12(B) of the UGC Act, 1956)
(An ISO 9001: 2015 Certified Institution)
Bangalore - Chennai Highway, (NH- 46), Mittapalli,
Balinayanapalli Post, Krishnagiri -635 108.

DEPARTMENT OF INFORMATION TECHNOLOGY

Course Code / Course Title: C204 – Data Structures and Algorithms Year/ Sem: II / III
COURSE OUTCOMES:
CO DESCRIPTION
C204.1 Understanding of abstract data types
Design, implement and analyze linear data structures, such as lists, queues, and stacks,
C204.2
according to the needs of different applications.
C204.3 Implement and analyze the sorting and hashing techniques
Design, implement, and analyze efficient tree structures to meet requirements such as searching,
C204.4
indexing, and sorting
C204.5 Model problems as graph problems and implement efficient graph algorithms to solve them

COURSE OUTCOMES VS POs and PSOs MAPPING:

PO PO PO PSO PSO PSO
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12 1 2 3
C204.1 1 2 2 3 1 - - - 2 - 2 1 1 - -
C204.2 2 3 2 2 2 - - - 2 - 2 2 3 2 -
C204.3 2 2 3 2 3 - - - 3 - 2 2 3 2 1
C204.4 2 2 3 2 3 - - - 3 - 2 2 3 2 1
C204.5 3 3 3 3 1 - - - 3 - 2 2 3 2 1
Avg 2.00 2.40 2.60 2.60 2.00 0.00 0.00 0.00 2.60 0.00 2.00 1.80 2.60 1.80 1.00
* For Entire Course PO /PSO Mapping; 1 (Low); 2(Medium); 3(High) Contribution to PO/PSO

P01 Engineering Knowledge P07 Environment & Sustainability PSO1 Programming skills
P02 Problem Analysis P08 Ethics PSO2 Manage business solutions
P03 Design & Development P09 Individual & Team Work PSO3 Research
P04 Investigations P10 Communication Skills
P05 Modern Tools P11 Project Mgt. & Finance
P06 Engineer & Society P12 Life Long Learning
JUSTIFICATION FOR MAPPING:
PO/PSO
CO JUSTIFICATION
MAPPED
PO1-L Understand the concept of abstract data type
PO2-M To analyze the problems in data types
PO3-M To design and develop solutions to the problems in data types.
PO4-H Built ability to investigate various data types
C204.1 PO5-L Modern tools can be used to implement various data types
PO9-M Programs may be developed individually and/or as team Work.
PO11-M Projects can be done based on data types
PO12-L Data types are used in lifelong learning and development process.
PSO1-L Data types are used to develop programs and to solve complex engineering problems
PO1-M Understand the concept of linear data structures
PO2-M To analyze the problems related to linear data structures
PO3-H To design and develop solutions to the problems in linear data structures
PO4-M Built ability to investigate various real world problems
PO5-H Modern tools can be used to develop solutions to problems
C204.2 PO9-M Programs may be developed individually and/or as team Work
PO11-M Mini projects can be developed related to linear problems.
PO12-M Linear problems may cause lifelong learning
PSO1-H Developing solutions for linear problems will enrich programming skills

PSO2-M Developing solutions for linear problems will create the knowledge in managing business
solutions
C204.3 PO1-H Understand the concept of sorting and hashing techniques
PO2-H To analyze the problems in sorting and hashing techniques
PO3-H To design and develop solutions to the problems in hashing.
PO4-M Built ability to investigate various sorting problems
PO5-L Modern tools can be used to design solutions to sorting problems
PO9-H Sorting and hashing programs may be developed individually and/or as team Work.
PO11-M Programs can be developed as case study or mini projects
PO12-M Sorting and hashing techniques will be a lifelong learning process
PSO1-H Developing solutions for sorting problems will enrich programming skills

PSO2-M Developing solutions for hashing problems will create the knowledge in managing
business solutions
PSO3-L Basic concepts of sorting and hashing techniques in data structures will lead to do research
 in the respective major.
PO1-H Understand the concept of tree structures
PO2-H To analyze the problems in tree structures
PO3-H To design and develop solutions to the problems in tree structures
PO4-M Built ability to investigate various searching and indexing problems
PO5-L Modern tools can be used to design solutions to searching problems

PO9-H Various searching and indexing programs may be developed individually and/or as team
C204.4 Work.
PO11-M Programs can be developed as case study or mini projects
PO12-M Searching and indexing techniques will be a lifelong learning process
PSO1-H Developing solutions for searching problems will enrich programming skills

PSO2-M Developing solutions for indexing problems will create the knowledge in managing
business solutions
PSO3-L Basic concepts of searching and indexing techniques in data structures will lead to do
research in the respective major.
PO1-H Understand the concept of graphs
PO2-H To analyze the problems in graph
PO3-H To design and develop solutions to the problems in graph
PO4-H Built ability to investigate various graph problems
PO5-L Modern tools can be used to design solutions to graph problems
PO9-H Various graph algorithms may be developed individually and/or as team Work.
C204.5
PO11-M Programs can be developed as case study or mini projects
PO12-M Graph algorithms will be a lifelong learning process
PSO1-H Developing solutions for graph problems will enrich programming skills

PSO2-M Developing solutions for graph problems will create the knowledge in managing business
solutions
PSO1-L Basic concepts of graph in data structures will lead to do research in the respective major.

Prepared by Approved by

(Course Instructor) (HOD)