Data Structures (Sample) Course Report
Data Structures (Sample) Course Report
Data Structures
(CSA03)
Data Structures.
(CSA03)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
C01 3
C02 3
C03 3
CO4 3
CO5 3
CO6 3
CO7 3
CO8 3
CO9 3
CO10 3
PO and PSO mapped in the Course:
PO 1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.
PO 2. Problem analysis: Identify, formulate, review research literature, and analyse
complex engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
PO 10. Communication: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.
c.Administrative Planning
The first Course Committee meeting was held on 2nd august 2022. The members discussed
the following agenda to prepare the lesson plan for the course : Data Structures. (CSA03).
Minutes of Meeting attached in Annexure 1.
The second Course Committee meeting was held on 30th august 2022. The members
discussed the following agenda to prepare the lesson plan for the course : Data
Structures(CSA03).
Minutes of Meeting attached in Annexure 2.
The third Course Committee meeting was held on 2nd September 2022. The members
discussed the following agenda to prepare the lesson plan for the course : Data
Structructures (CSA03).
Minutes of Meeting attached in Annexure 3.
d.Course Materials
Course materials for Data Structures. (CSA03) is compiled in the Annexure D.
I. TEXT BOOKS
1. Alfred. V. Aho, John. E. Hopcroft, Jeffrey. D. Ullman, "Data Structures and Algorithms”,
Addison - Wesley Publications., 2009.
2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed., Pearson
Education Asia, 2002.
3. Jean-Paul Tremblay, Paul G.Sorenson “An Introduction to Data Structures with
Applications”, Mcgraw Hill,1984.
II. REFERENCES
1. A.P Godse and G.A Godse “C Programming and Data Structures”, Technical
Publications, Pune, 2011.
2. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, “Data Structures using C”,
Pearson Education Asia, 2004.
3. Yashavant P. Kanetkar, “Let Us C” Infinity Science Press, 2008.
Author Name
Sl No. Book Name
e.Schedule
COURSE OUTCOMES
Data Structures
(CSA03)
1.1 Syllabus:
Basic Understanding of Data - Data object- Data structure - Abstract Data Types (ADT) -
realisation of ADT in ‘C’- Primitive and non-primitive data structure - Linear and non-linear
data structure - static and dynamic data structure –persistent data structure -Linked data
structure - Succinct data structure - Implicit data structure - Compressed data structure -
Search data structure - Recursion.
• Didactic examination for 30 marks conducted on 7th August 2022. The exam
contained two questions for 10 marks and 20 marks. The focus was to make the
student explain the concept and explain basic equations. (Question paper and
answer key, sheet samples attachment : Annexure 4).
• A remedial theory examination was conducted on 16th August 2022 for slow
learners who failed to attain CO1 in the previous exam. (Question paper and answer
key, sheet samples attachment : Annexure 5 )
3 192011146 MANOJ P 57
9 192111121 K.V.N.SANTHOSHINI 87
14 192111194 K.UDAY 60
36 192124064 C.SASIKUMAR 62
37 192125013 K PAVANI K 85
72 192121157L KADALARASU S 39
74 192124158 PAVAN K B 65
86 192011320 DHARMATEJA B 52
• A remedial theory examination was conducted on 13th September for slow learners
who failed to attain CO2 in the previous exam. (Question paper and answer key,
sheet samples attachment : Annexure 8).
Nett Attainment
Table 2: Barchart showing 80% of the students have attained the set cutoff demonstrating
a high level of attainment for CO 2 : Linear Data structures in the Course CSA0375 Data
structure with manipulations.
1 192011110 KAMESHWARAN .E 80
2 192011133 KUPPAM MADESH .S 0
3 192011146 MANOJ P 58
4 192110132 GURRAMKONDA NAVEEN KUMAR 0
5 192110315 B SATHISH KUMAR REDDY 63
6 192110599 KARIMBAI CHENCHU HARSHITHA 65
7 192110685 VALLAM KONDU HIMAJA 75
8 192111002 MUDIYAM GURU VARDHAN 57
9 192111121 K.V.N.SANTHOSHINI 73
10 192111132 KAITEPALLI JYOTHI PRAKASH 0
11 192111134 KURRA OMKAR 25
12 192111156 MOREESU CHANDU 0
13 192111160 VAKATI SAHITHI 65
14 192111194 K.UDAY 47
15 192111249 MAHIJA LAKSHMI P 77
16 192111284 B SAI LOKESH 63
17 192111292 DUNDE SHINI 82
18 192111325 GRANDHI ANURADHA 73
19 192111330 KOPPALA SAI MANOJ 0
20 192111338 BONASI HEMANTH 63
21 192111339 U NANDA KUMAR REDDY 60
22 192111366 BONGU SAI SRINIVAS REDDY 65
23 192111378 JONNALAGADDA NARENDRA 72
24 192111409 OBILI.DINESH KUMAR REDDY 83
25 192111452 KATHASAGARAM.AKHIL VINEETH 82
26 192111455 JAYALLU PRAJWAL REDDY 67
27 192111555 AMBALA GOWTHAMI 88
28 192111557 KARNATILAKSHMI SRAVANI 0
29 192111725 NAGIREDDY POOJITHA 0
30 192111726 VEESAM CHANDU SREE 73
31 192111728 POOJARI ROHITH KUMAR 72
32 192121102 B.SIRI SAHITHI 60
33 192121135 SHAIK KASHIFA 0
34 192121142 SHAIK ESARAR ALLAH WARIS 0
35 192124047 VALLIPI GANESH KUMAR 57
36 192124064 C.SASIKUMAR 0
37 192125013 K PAVANI K 78
38 192125057 KOLLURU MANOJ SAI 70
39 192125075 SYED FAHAD ANSARI 63
40 192125078 TANGUTURI VENKATA LAKSHMI AJAY 43
41 192011267 VELIKANTI VIMAL KUMAR 70
42 192110102 V J PRIYATHAM KRISHNA 0
43 192110200 GANGAVARAM JAHNAVI 55
44 192110245 GODDUMARRI OBULESU 50
45 192110324 GUNTAKA ANJI REDDY 52.5
46 192110412 VALLABHANENI PRASANNA KUMAR 60
47 192110466 N. NAGARJUNA NAGARJUNA 87.5
48 192110468 PUSALA SOMA SEKHAR 85
49 192110473 PAPPALA VENKATA SIVA SAIKUMAR 85
50 192110504 JONNA HIMAVARSHA 77.5
51 192110518 ANUKULA SRIDHAR REDDY 0
52 192110558 NAVEEN KUMAR.R 35
53 192110657 LOKA KIRAN KUMAR 0
54 192110663 EGUTURU MADAN BABU 77.5
55 192110683 ARAVA MANOJ 77.5
56 192110687 MACHUPALLI KEERTHANA 82.5
57 192110693 CHAGALAKONDU MAHA LAKSHMI BHAVISHYA 65
58 192110694 NARUKULA SRINIVASA BALAJI 85
59 192110695 SANNAYI SRAVANTHI 87.5
60 192110705 NAGIREDDYPALLI PAVAN KUMAR REDDY 0
61 192110713 MEKAPOTHU VENKATA SAI REDDY 0
62 192111141 VIDAVALURU HARIKA 80
63 192111354 KONANKI RAGA PRIYA 87.5
64 192111474 S.VENKATA SAI 70
65 192111528 KAKUMANU JAYA SAI AKASH 60
66 192111530 YEKKANTI SUDEEP REDDY 40
67 192111609 DUGGIRALA SIDDARDHA 30
68 192111627 M.PREM SWAROOP 52.5
69 192111633 NERELLA ABHIRAM 60
70 192111694 Sriram Gokul Krishna Grohith 50
71 192111695 YEKKANTI SANDEEP REDDY 37.5
72 192121157L KADALARASU S 0
73 192124034 BACHINA MANITEJA MANITEJA 72.5
74 192124158 PAVAN K B 80
75 192124164 D MUBARAK ALI mubarak ali 42.5
76 192125032 DABBUKOTU RAGHU 65
77 192125112 VARRA PRAKASH REDDY 32.5
78 192125113 CHALAVADI VENKATA NARENDRA 57.5
79 192211004 VISHNU PRIYA B 80
80 192011099 ISKALA SRI CHARAN 60
81 192011158 MUMMADIRAJU NITHIN VARMA 72
86 192011320 DHARMATEJA B 40
• Assignment questions from Expression tree, Binary Search Tree and AVL Tree are
given for 30 marks on 29th october 2022. It consists of three questions and each
question is for 10 marks. The focus was to make the student understand the
problem and write solutions for the given problem. (Question paper and answer key,
sheet samples attachment : Annexure 10).
Table 3: Barchart showing 85% of the students have attained the set cutoff demonstrating
a high level of attainment for CO 3 : non-linear data structure Trees and its types in the
course CSA0375 : Data structure with manipulations.
1 192011110 KAMESHWARAN .E 70
3 192011146 MANOJ P 72
9 192111121 K.V.N.SANTHOSHINI 57
14 192111194 K.UDAY 77
36 192124064 C.SASIKUMAR 63
37 192125013 K PAVANI K 85
72 192121157L KADALARASU S 0
74 192124158 PAVAN K B 80
75 192124164 D MUBARAK ALI mubarak ali 78
87 192011320 DHARMATEJA B 67
4.1 Syllabus:
Hashing - Hash Function - Separate Chaining – Open Addressing - Linear Probing - Priority
Queue –Heaps – Insertion sort - Quick Sort - Merge Sort - Radix Sort – Heap Sort – Time
complexity.
4.2 Evaluation Details:
CO 4 Attainment was evaluated using the following sessions:
• Assignment questions from hashing and sorting are given for 30 marks on 9th
November 2022. It consists of three questions and each question is for 10 marks.
The focus was to make the student understand the problem and write solutions for
the given problem. (Question paper and answer key, sheet samples attachment :
Annexure 12).
Table 4: Barchart showing more than 89% of the students have attained the set cutoff
demonstrating a high level of attainment for CO 4 : Hashing and sorting algorithms in the
course CSA03 Data structures.
1 192011110 KAMESHWARAN .E 73
2 192011133 KUPPAM MADESH .S 80
3 192011146 MANOJ P 75
9 192111121 K.V.N.SANTHOSHINI 87
14 192111194 K.UDAY 65
36 192124064 C.SASIKUMAR 78
37 192125013 K PAVANI K 85
72 192121157L KADALARASU S 0
86 192011320 DHARMATEJA B 50
• Didactic examination for 30 marks conducted on 12th November 2022. The exam
contained three questions for 10 marks each. The focus was to make the student
model the Graph Data Structure and write solutions for the given problems.
(Question paper and answer key, sheet samples attachment : Annexure 14).
• A remedial theory examination was conducted on 15th November 2022 for slow
learners who failed to attain CO5 in the previous exam. (Question paper and answer
key, sheet samples attachment : Annexure 15).
Table 5: Barchart showing more than 85% of the students have attained the set cutoff
demonstrating a high level of attainment for CO5 : Graph Data structures in the Course
CSA0375 Data structure with manipulations.
1 192011110 KAMESHWARAN .E 63
3 192011146 MANOJ P 75
9 192111121 K.V.N.SANTHOSHINI 83
14 192111194 K.UDAY 75
36 192124064 C.SASIKUMAR 85
37 192125013 K PAVANI K 75
72 192121157L KADALARASU S 0
74 192124158 PAVAN K B 84
86 192011320 DHARMATEJA B 60
ADT array – Operations on arrays - Searching Algorithms - Linear Search - Binary Search ADT
– Linked List - Stack – Queue – Applications.
Trees:Preliminaries - Binary Tree - Binary Search Tree - Tree Traversals - AVL Tree -
Applications of Search Trees – B Tree – Trie - 2-3 tree - 2-3-4 tree - Red Black Tree – Splay
Tree
Hashing - Hash Function - Separate Chaining – Open Addressing - Linear Probing - Priority
Queue –Heaps – Insertion sort - Quick Sort - Merge Sort - Radix Sort – Heap Sort – Time
complexity.
6.2 Evaluation Details:
CO 6 Attainment was evaluated using the following sessions:
• Didactic examination for 100 marks conducted on 25th November 2022.. The exam
contained ten questions for 10 marks each. The focus was to make the student
explain concepts of linear and non linear data structures and write solutions for the
given problems. (Question paper and answer key, sheet samples attachment :
Annexure 17).
Table 6: Barchart showing 100% of the students have attained the set cutoff demonstrating
a high level of attainment for CO6 : Linear and Non Linear data structures, Hashing and
Sorting techniques in the Course CSA0375 Data structure with manipulations.
1 192011110 KAMESHWARAN .E 0
3 192011146 MANOJ P 58
9 192111121 K.V.N.SANTHOSHINI 92
14 192111194 K.UDAY 69
36 192124064 C.SASIKUMAR 60
37 192125013 K PAVANI K 94
72 192121157L KADALARASU S 62
74 192124158 PAVAN K B 63
7.1 Syllabus:
Trees:Preliminaries - Binary Tree - Binary Search Tree - Tree Traversals - AVL Tree -
Applications of Search Trees – B Tree – Trie - 2-3 tree - 2-3-4 tree - Red Black Tree – Splay
Tree
• Quiz for 10 marks conducted on 28th November 2022 among teams. The exam
contained questions from the above syllabus for 10 marks for each team. The focus
was to make the student answer the questions. (Sample Questions Annexure 19).
Table 7: Barchart showing more than 95% of the students have attained the set cutoff
demonstrating a high level of attainment for CO7 : Linear and Non Linear data structures,
Hashing and Sorting techniques in the Course CSA0375 Data structure with manipulations.
Figure 7: curve showing a normal distribution of the marks obtained by students for the
attainment of CO 7 of Course CSA03 : Data structures
1 192011110 KAMESHWARAN .E
67
2 192011133 KUPPAM MADESH .S
73
3 192011146 MANOJ P
89
4 192110132 GURRAMKONDA NAVEEN KUMAR
87
5 192110315 B SATHISH KUMAR REDDY
85
6 192110599 KARIMBAI CHENCHU HARSHITHA
85
7 192110685 VALLAM KONDU HIMAJA
88
8 192111002 MUDIYAM GURU VARDHAN
85
9 192111121 K.V.N.SANTHOSHINI
93
10 192111132 KAITEPALLI JYOTHI PRAKASH
83
11 192111134 KURRA OMKAR
91
12 192111156 MOREESU CHANDU
76
13 192111160 VAKATI SAHITHI
86
14 192111194 K.UDAY
91
15 192111249 MAHIJA LAKSHMI P
89
16 192111284 B SAI LOKESH
81
17 192111292 DUNDE SHINI
88
18 192111325 GRANDHI ANURADHA
83
19 192111330 KOPPALA SAI MANOJ
83
20 192111338 BONASI HEMANTH
88
21 192111339 U NANDA KUMAR REDDY
88
22 192111366 BONGU SAI SRINIVAS REDDY
91
23 192111378 JONNALAGADDA NARENDRA
86
24 192111409 OBILI.DINESH KUMAR REDDY
88
25 192111452 KATHASAGARAM.AKHIL VINEETH
82
26 192111455 JAYALLU PRAJWAL REDDY
83
27 192111555 AMBALA GOWTHAMI
88
28 192111557 KARNATILAKSHMI SRAVANI
90
29 192111725 NAGIREDDY POOJITHA
87
30 192111726 VEESAM CHANDU SREE
79
31 192111728 POOJARI ROHITH KUMAR
74
32 192121102 B.SIRI SAHITHI
85
33 192121135 SHAIK KASHIFA
75
34 192121142 SHAIK ESARAR ALLAH WARIS
73
35 192124047 VALLIPI GANESH KUMAR
77
36 192124064 C.SASIKUMAR
84
37 192125013 K PAVANI K
90
38 192125057 KOLLURU MANOJ SAI
79
39 192125075 SYED FAHAD ANSARI
71
40 192125078 TANGUTURI VENKATA LAKSHMI AJAY
88
41 192011267 VELIKANTI VIMAL KUMAR 75
72 192121157L KADALARASU S 0
74 192124158 PAVAN K B 82
86 192011320 DHARMATEJA B 40
ADT array – Operations on arrays - Searching Algorithms - Linear Search - Binary Search ADT
– Linked List - Stack – Queue – Applications.
Trees:Preliminaries - Binary Tree - Binary Search Tree - Tree Traversals - AVL Tree -
Applications of Search Trees – B Tree – Trie - 2-3 tree - 2-3-4 tree - Red Black Tree – Splay
Tree
Hashing - Hash Function - Separate Chaining – Open Addressing - Linear Probing - Priority
Queue –Heaps – Insertion sort - Quick Sort - Merge Sort - Radix Sort – Heap Sort – Time
complexity.
8.2 Evaluation Details:
CO 8 Attainment was evaluated using the following sessions:
• Class Practical experiments conducted as per the schedule and assessed for 100
marks. The focus was to make the student demonstrate technical competence of the
course CSA0375:Data Structures with data manipulations (Record of experiments
Annexure 21).
Table 8: Bar chart showing 100% of the students have attained the set cut-off
demonstrating a high level of attainment for CO 8: Coding in Linear & Non Linear Data
Structures in the Course CSA03: Data structure.
Figure 7: curve showing a normal distribution of the marks obtained by students for the
attainment of CO 8 of Course CSA03 : Data structures
1 192011110 KAMESHWARAN .E 75
2 192011133 KUPPAM MADESH .S 78
3 192011146 MANOJ P 84
9 192111121 K.V.N.SANTHOSHINI 90
14 192111194 K.UDAY 89
36 192124064 C.SASIKUMAR 83
37 192125013 K PAVANI K 91
72 192121157L KADALARASU S 13
74 192124158 PAVAN K B 84
86 192011320 DHARMATEJA B 0
ADT array – Operations on arrays - Searching Algorithms - Linear Search - Binary Search ADT
– Linked List - Stack – Queue – Applications.
Trees:Preliminaries - Binary Tree - Binary Search Tree - Tree Traversals - AVL Tree -
Applications of Search Trees – B Tree – Trie - 2-3 tree - 2-3-4 tree - Red Black Tree – Splay
Tree
Hashing - Hash Function - Separate Chaining – Open Addressing - Linear Probing - Priority
Queue –Heaps – Insertion sort - Quick Sort - Merge Sort - Radix Sort – Heap Sort – Time
complexity.
9.2 Evaluation Details:
CO 9 Attainment was evaluated using the following sessions:
• University Practical examination for 100 marks conducted on xth October 2022. The
exam contained four questions. The focus was to make the student demonstrate
technical competence (Question paper and answer key, sheet samples attachment :
Annexure 23).
Table 9: Bar chart showing more than 95% of the students have attained the set cut-off
demonstrating a high level of attainment for CO 9: Coding in Linear and Non Linear data
structures in the Course CSA03: Data structure.
Table 9: Normal Distribution chart showing more than 95% of the students have attained
the set cut-off demonstrating a high level of attainment for CO 9: Coding in Linear and Non
Linear data structures in the Course CSA03: Data structure.
1 192011110 KAMESHWARAN .E 72
3 192011146 MANOJ P 87
9 192111121 K.V.N.SANTHOSHINI 76
14 192111194 K.UDAY 88
36 192124064 C.SASIKUMAR 84
37 192125013 K PAVANI K 89
74 192124158 PAVAN K B 50
86 192011320 DHARMATEJA B 0
ADT array – Operations on arrays - Searching Algorithms - Linear Search - Binary Search ADT
– Linked List - Stack – Queue – Applications.
Trees:Preliminaries - Binary Tree - Binary Search Tree - Tree Traversals - AVL Tree -
Applications of Search Trees – B Tree – Trie - 2-3 tree - 2-3-4 tree - Red Black Tree – Splay
Tree
• Comprehensive viva voce examination for 100 marks conducted on xth October
2022 to assess the student's communication skills, as well as their knowledge of the
subject matter. The student is expected to demonstrate their ability to answer these
questions thoroughly and thoughtfully
Table 10: Bar chart showing more than 58.15% of the students have attained the set cut-off
demonstrating a high level of attainment for CO 10: Identify suitable data structures and
find solution to real time problems Data structures in the Course CSA03: Data structure.
Figure 10: Frequency distribution curve showing a gaussian distribution of the marks
obtained by students for the attainment of CO 10 of Course CSA03 : Data structures
3 192011146 MANOJ P 36
9 192111121 K.V.N.SANTHOSHINI 70
14 192111194 K.UDAY 65
36 192124064 C.SASIKUMAR 75
37 192125013 K PAVANI K 80
72 192121157L KADALARASU S 0
73 192124034 BACHINA MANITEJA MANITEJA 75
74 192124158 PAVAN K B 75
86 192011320 DHARMATEJA B 0
Data Structures.
(CSA03)
CO2 Knowledge in Linear Data structures such as Array, PO1 Class Test-2
List, Stack, Queue
CO3 Knowledge in non-linear data structure Trees and its PO1 Assignment 1
types
CO4 Understand hashing data structure and various PO1 Assignment 2
sorting techniques
CO5 Ability to model Graph Data structure for the given PO1 Class Test-3
problem
CO6 Ability to integrate knowledge acquired throughout PO1 Model Exam
the course and display knowledge related to data
structure
CO7 Ability to interact in the concepts of Linear and Non PO1 Quiz
linear data structures
CO8 Ability to code Linear , non linear , hashing data PO2 Class Practical
structures such as array, stack,queue, linked lists and
its operations
CO9 Ability to formulate, design and solve problems PO2 University
related to Data Structures using any of the skills Practical
acquired throughout the course
CO10 Ability to identify suitable data structures and find PO10 Comprehensive
solution to real time problems Viva Voce
Sl Batch No. CO1 CO2 CO3 CO4 CO5 CO6 CO7 CO8 CO9 CO10
No.
1 Batch I 77.50 60 85 92.50 70 60 100 100 100 94.87
Attainment 3 3 3 3 3 3 3 3 3 3
Value
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3
CO6 3
CO7 3
CO8 3
CO9 3
CO10 3