Name of the program and semester: B.

Tech, CSE 3rd Sem

Course Code: BTCS 301-18

Course Incharge Name: Er. Rajni Bedi

Course Name: Data structure &Algorithms

3.1.1 Course Outcomes (Cos)

Course Outcomes
After the course completion, students will be able to:

C301-18.1 For a given algorithm student will be able to analyze the algorithms to determine
the computational complexity.
C301-18.2 Student will be able to implement operations like searching, insertion, deletion
and traversing on various data structures and determine computational
complexity.
C301-18.3 Students will be able to design various tree and graph applications using non-
linear data structures.

C301-18.4 Student will be able to implement different sorting and searching techniques on
various data structures and compare their performance in term of Space and
Time complexity.
C301-18.5 Students will be able to choose appropriate data structure as applied to specific
problem definition;

3.1.2 CO-PO Mapping:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
C301-18.1 3 3 - 2 - - - - - - - 2
C301-18.2 3 2 2 1 - - - - - - - 2
C301-18.3 3 3 3 1 - - - - - - - 2
C301-18.4 3 3 3 2 - - - - - - - 2
C301-18.5 3 3 3 2 - - - - - - - 2
Average

Note:

1. Enter correlations levels 1, 2 or 3 as defined below:

1. Slight (Low)
2. Moderate (Medium)
3. Substantial (High)