Department of Computer Science and Engineering(Data Science)

Course Name : Data Structures using C

Course Number : 20CS302PC

Course Designation : Core

Credits : 3

Prerequisites : Programming with problem

solving

II B Tech – I Semester
(2022-23)

Dr. Kishore Kumar M

Associate Professor
Academic Calender
Syllabus

Introduction to Data Structures, abstract data types, Linear list – singly linked list
implementation, insertion, deletion and searching operations on linear list, Stacks-
Unit – I
Operations, array and linked representations of stacks, stack applications, Queues-
operations, array and linked representations.

Dictionaries: linear list representation, skip list representation, operations -

insertion, deletion and searching. Hash Table Representation: hash functions,
Unit – II
collision resolution-separate chaining, open addressing-linear probing, quadratic
probing, double hashing, rehashing, extendible hashing.
Search Trees: Binary Search Trees, Definition, Implementation, Operations-
Unit – III Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree,
Operations–Insertion, Deletion and Searching, Red –Black, Splay Trees
Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting:
Unit – IV
Heap Sort, External Sorting- Model for external sorting, Merge Sort.
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –
Unit – V Moore algorithm, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed
Tries, Suffix tries.

Text Books & Reference Books

Text Books
Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan
1 AndersonFreed, UniversitiesPress
DataStructures using C–A.S.Tanenbaum,Y.Langsam, and M.J.Augenstein, PHI/Pearson
2 Education.
Suggested / Reference Books
Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and
1
B.A.Forouzan, Cengage Learning.
 Time Table

Room No: 140,141 W.E. F: 10/10/2022

TO: 4/02/2023

Class 1 2 3 4 5 6
Hour
9:20 – 10.20 – 11:20– 1:00 – 3:00 –
Time 2:00 – 3:00
10:20 11:20 12:20 2:00 4:00

MON

TUE
DSC Lab CSD-B

LUNCH BREAK
WED 12:20 – 1:00
CSD-A CSD-B

THU
DSC Lab CSD-A

FRI
CSD-B CSD-A

SAT
CSD-A CSD-B
Programme Educational Objectives (PEO’s)

1. Exploring basic data structures such as stacks and queues.

2. Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs

3. Introduces sorting and pattern matching algorithms.

Programme Specific Outcomes (PSOs)

1. Ability to select the data structures that efficiently model the information in a problem.

2. Ability to assess efficiency trade-offs among different data structure implementations or

combinations.

3. Implement and know the application of algorithms for sorting and pattern matching.

4. Design programs using a variety of data structures, including hash tables, binary and

general tree structures, search trees, tries, heaps, graphs, and AVL-trees.

Programme Outcomes (PO’s)

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization for the solution of complex engineering
problems.
2. Problem analysis: Identify, formulate, research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems
and design system components or processes that meet the specified needs with
appropriate consideration for public health and safety, and cultural, societal, and
environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools, including prediction and modelling to complex
engineering activities, with an understanding of the limitations.
6. The engineer and society: Apply to reason informed by the contextual knowledge to
assess societal, health, safety, legal, and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
9. Individual and teamwork: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the
engineering community and with the 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.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
Prerequisites: “A Course on Programming for Problem Solving”

Course Objectives

Students will learn:

1. Exploring basic data structures such as stacks and queues.

2. Introduces a variety of data structures such as hash tables.
3. Discussion of search trees.
4. Understand the sorting algorithms.
5. Introduces pattern matching algorithms

Course Outcomes

Students will be able to:

1. Exploring basic data structures.

2. Understand the hash table representation.
3. Implement searching for trees.
4. Apply sorting on the information.
5. Design pattern matching on a problem.

Mapping of Course outcomes with PO’s, PSO’s & PEO’s

Course Outcomes PO’s PSOs PEO’s

1, 2, 3, 4, 5, 8, 9, 10, 11,12 1, 2, 3 1, 2, 3
CO1
1, 2, 3, 4, 5, 9, 10, 11, 12 1, 2 1, 2
CO2
1, 2, 3, 5, 6, 7, 9, 10, 12 1, 2 1, 2, 3
CO3
1, 2, 3, 5, 8, 9, 10, 11, 12
CO4 1, 2, 3 1, 2, 3
1, 2, 3, 4, 6, 7, 9, 10, 11, 12
CO5 1, 2, 3 1, 2, 3
 Articulation matrix of Course outcomes with PO’s

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 2 3 3 2 2 3 3
CO2 3 2 3 2 3 3 2 2 3
CO3 3 2 3 3 2 3 3 2 3
CO4 3 2 3 2 3 3 2 3 2
CO5 2 3 3 2 3 2 3 2 2 2

Course Schedule
Distribution of Hours in Unit – Wise

Unit Topic Chapters Total No.

of Hours
Book1 Book2

I Introduction to Data Structures Ch1, Ch2 10

Dictionaries
II Ch3, Ch4 6
Hash Table Representation
III Search Trees Ch5, Ch19 8
Graphs
IV Ch16, Ch17, Ch18 8
Sorting
V Pattern Matching and Tries Ch8, Ch9, Ch10 8
Total contact classes for Syllabus coverage 40

Assignment Tests : 02 (Before Mid1 & Mid2 Examinations)

Number of hours/lectures available in Semester / Year: 64

The number of topics in each unit is not the same – because of the variation, all the units have
unequal distribution of hours
Lecture Plan

Expected Actual Teaching-Learning

S.
Topic Date of Date of Process
No.
Completion Completion
Unit-I
1 Abstract data types, Linear list 11.10.2022 11.10.2022 PPT & Digital Board
2 Singly linked list 13.10.2022 14.10.2022 PPT & Digital Board
implementation, insertion
3 Singly linked list deletion and 15.10.2022 15.10.2022 PPT & Digital Board
searching operations on linear
list
4 Stacks-Operations 22.10.2022 22.10.2022 PPT & Digital Board
5 array representations of stacks 26.10.2022 26.10.2022 PPT & Digital Board
6 linked representations of stacks 27.10.2022 27.10.2022 PPT & Digital Board
7 stack applications 29.10.2022 29.10.2022 PPT & Digital Board
8 Queues-operations 01.11.2022 01.11.2022 PPT & Digital Board
9 Array representations 03.11.2022 03.11.2022 PPT & Digital Board
10 Linked representations 04.11.2022 04.11.2022 PPT & Digital Board
Tutorial -1
Unit-II
1 linear list representation, skip 08.11.2022 08.11.2022 PPT & Digital Board
list representation
2 operations - insertion, deletion 10.11.2022 10.11.2022 PPT & Digital Board
and searching.
3 hash functions 12.11.2022 12.11.2022 PPT & Digital Board
Tutorial -2
4 Collision resolution-separate 14.11.2022 14.11.2022 PPT & Digital Board
chaining
5 open addressing-linear probing, 16.11.2022 17.11.2022 PPT & Digital Board
quadratic probing, double
hashing
6 rehashing, extendible hashing 18.11.2022 18.11.2022 PPT & Digital Board

Unit-III
Binary Search Trees, 22.11.2022 22.11.2022 PPT & Digital Board
1
Definition
2 Implementation 24.11.2022 24.11.2022 PPT & Digital Board
 Operations- Searching, 25.11.2022 25.11.2022 PPT & Digital Board
3
Insertion and Deletion
4 AVL Trees 29.11.2022 29.11.2022 PPT & Digital Board
Definition, Heigh to fan AVL 01.12.2022 01.12.2022 PPT & Digital Board
5
Tree
Operations–Insertion, Deletion 02.12.2022 02.12.2022 PPT & Digital Board,
6
and Searching Tutorial -3
7 Red –Black 13.12.2022 13.12.2022 PPT & Digital Board

8 Splay Trees 15.12.2022 15.12.2022 PPT & Digital Board

Unit-IV
1 Graphs 17.12.2022 18.12.2022 PPT & Digital Board
Graph Implementation 19.12.2022 20.12.2022 PPT & Digital Board
2
Methods.
3 Graph Traversal Methods 23.12.2022 24.12.2022 PPT & Digital Board

4 Sorting 26.12.2022 27.12.2022 PPT & Digital Board

5 Heap Sort 30.12.2022 30.12.2022 PPT & Digital Board

6 External Sorting 03.01.2023 03.01.2023 PPT & Digital Board

7 Model for external sorting 05.01.2023 06.01.2023 PPT & Digital Board
Merge Sort. 16.01.2023 17.01.2023 PPT & Digital Board,
8
Tutorial-4

Unit-V

1 Pattern Matching Algorithms 19.01.2023 19.01.2023 PPT & Digital Board

Pattern matching algorithms- 20.01.2023 20.01.2023 PPT & Digital Board
2
Brute force
3 the Boyer –Moore algorithm 23.01.2023 24.01.2023 PPT & Digital Board
the Knuth-Morris-Pratt 27.01.2023 27.01.2023 PPT & Digital Board,
4
algorithm
5 Tries 30.01.2023 30.01.2023 PPT & Digital Board

6 Standard Tries 31.01.2023 31.01.2023 PPT & Digital Board

7 Compressed Tries 02.02.2023 02.02.2023 PPT & Digital Board

Suffix tries. 03.02.2023 03.02.2023 PPT & Digital Board
8
Tutorial-5
Total No of classes: 40
Date of Unit completion & Remarks

Unit – I
Date: 04.11.2022
Remarks:

Unit – II
Date: 18.11.2022
Remarks:

Unit – III
Date: 15.12.2022
Remarks:

Unit – IV
Date: 17.01.2023
Remarks:

Unit – V
Date: 03.02.2023
Remarks:
Unit Wise Questions (With different Levels of thinking – Blooms Taxonomy and Course
Outcomes)

Question Bank for Mid -1

UNIT 1: LONG ANSWER QUESTIONS
1. Demonstrate insert and delete operations on Single Linked List with the help of a C program?
[L2, C01]
2. Illustrate infix to postfix conversion using stack implementation with an example? [L3, C01]
3. Demonstrate insert and delete operations on Double Linked List with the help of a C
program? [L3, C01]
4. Discuss Stack ADT and write the operations that can be performed on stack using linked list
with an example neatly? [L2, C01]
5. Explain Queue ADT, Write the operations that can be performed on queue using Array with an
example neatly? [L1, C01]
6. Explain Infix to prefix Conversion? [L2, C01]
7. Illustrate the post fix evaluation for the following 6,2,3, +, -,3,8,2, /, +, *,2, ^,3, + using stack
and represent the evaluation step by step? [L3, C01]
8. Evaluate (A + B) * C + (D – E) / F + G from infix to postfix conversion using stack? [L5, C01]
9. Illustrate the post fix evaluation for the following expression 2,3,5,6, +, *, *,5, /,2, - using stack
and show the evaluation step by step? [L3, CO1]

UNIT 2: LONG ANSWER QUESTIONS

1. Illustrate insert and delete operations on Skip List using examples? [L2, CO2]
2. Explain the advantages of hashing and discuss various hash functions.? [L1, CO2]
3. Explain Dictionary operations with example? [L1, CO2]
4. Explain the following Over Flow Technique a) Linear Probing b) quadratic probing c) Double
Hashing d) Extendable Hashing.? [L1, CO2]
5. Demonstrate the implementation of dictionary using sorted chain and Linear List? [L3, CO2]
6. Explain the advantages of hashing and discuss various hash functions.? [L1, CO2] Illustrate
insert and delete operations on Skip List with an examples? [L3, C02]
7. What is a Dictionary and analyze its operations with suitable example? [L4, CO2]
8. Explain Queue ADT, write the operations that can be performed on queue using arrays with an
example neatly?
9. Sketch the dictionary using Linear list with its operations? [L3, C02]
10. Discuss the following?
a) Linear Probing b) quadratic probing c) Double Hashing d) Extendable Hashing.? [L2,
C02]
11. Demonstrate the implementation of dictionary using sorted chain and Linear List? [L3, C02]
12. What is a Collision? and solve the Hash Function H=Key mod 11, where 11 is the size of the
hash table. Insert the following data in to the hash table, use linear probing to address the
collisions. 34, 46, 23, 11, 66, 99, 38, 97, 87. [L5, CO2]
13. What is hash function? Compare all hash functions using with examples? [L4, C02]
 14. Formulate the Hash data structure with following data: Hash function h= key mod 13 where 13
is the size of the hash table, Insert the data 11, 23, 45, 56, 67, 89, 65, 26, 88, 39, 63, 117 in to
hash table use separate chaining to address the collision? [L6, C02]

UNIT 3: LONG ANSWER QUESTIONS

1. Distinguish Rotations in AVL Trees with an example each? [L4, C03]
2. Explain Binary Search Tree operations? [L1, C03]
3. Summarize the delete operation of Binary Search tree with example? [L5, CO3]
4. Illustrate Algorithm of insert operation of AVL Tree with example? [L3, CO3]
5. What is a Binary search tree? Design a Binary Search tree using the following data 14, 10, 19, 35,
42, 27 ,31, 23, 54, 9. [L6, C03]

SHORT ANSWERS(UNIT-1,2,3)
1. Discuss Stack ADT Push operation with example? [L2, CO1]
2. Explain Queue ADT enque operation with example? [L1, CO1]
3. Differentiate between sorted array and chain? [L2, CO2]
4. Demonstrate Rehashing Technique with example? [L3, CO2]
5. Define the following. [L1, CO3]
i). Binary Search Tree ii). AVL Tree
6. Differentiate Linear and Nonlinear data structure? [L4, CO1]
7. Construct Queue ADT Dequeue operation with example? [L3, CO1]
8. Differentiate collision and overflow? [L4 CO2]
9. Summarize Various Dictionary operations? [L5, C02]
10. Define the following. [L1, CO3]
a) Full Binary Tree b) Perfect Binary Tree

Question Bank for Mid -2

SHORT ANSWERS(UNIT-3,4,5)

PART A

1. Define Red Black Trees with example? [L3, CO3]

2. Distinguish the difference between BFS and DFS? [L2, CO4]
3. Explain Bubble Sort concept? [L1, CO4]
4. Explain the standard Tries? [L1, CO5]
5. Describe the difference between Brute force and Boyer Moore? [L1, CO5]
6. Define Splay Tree with example? [L3, CO3]
7. Define Heap Sort with example? [L2, CO4]
8. Define external sorting with example? [L1, CO4]
9. Differentiate between Brute force and Boyer more? [L1, CO5]
10. Describe the Applications of Tries? [L1, CO5]
LONG ANSWER QUESTIONS(UNIT-3,4,5)

PART-B
11. a) Define Red black tree with example [L3, CO3]
b) Define Spay Tree with example [L3, CO3]
12. a) Differentiate between splay trees and Red Black Trees? [L2, C03]
b) Explain the deletion operation of Red Black Trees? [L1, CO3]
13. a) Implement program on selection sort? [L3, CO4]
b) Implement program on insertion sort? [L3, CO4]
14. a) Explain Adjacency List with example? [L1, CO4]
b) Explain the incidence matrix with example? [L1, CO4]
15. a) Explain the KMP algorithm? [L1, CO5]
b) Explain compressed trie? [L1, CO5]
16. a) Explain suffix trie? [L1, CO5]
b) Differentiate between Brute Force and Kmp? [L1, CO5]
17. a) Explain the properties of Red Black Trees? [L1, CO3]
b) Explain insertion operation of Red Black Trees? [L1, CO3]
18. a) Explain Rotations of Splay Trees? [L1, CO3]
b) Explain the insertion and deletion operations of Splay Trees? [L1, CO3]
19. a) Explain BFS concept with example? [L1, CO4]
b) Explain DFS Concept with example? [L1, CO4]
20. a) Implement program on Bubble sort? [L3, CO4]
b) Explain the Heap Sort with example? [L1, CO4]
21. a) Explain the Pattern Matching? [L1, CO5]
b) Explain applications of pattern matching? [L1, CO5]
22. a) Explain Brute Force Pattern matching with example? [L1, CO5]
b) Explain Boyer Moore pattern with example? [L1, CO5]
Case Studies (With Higher Levels of thinking – Blooms Taxonomy) for the academic year
2022-23 II B Tech I semester

# 1 Algorithms
Hashing, BST, Graph Traversals (DFS, BFS), Sorting Techniques, KMP Pattern Matching
Algorithm

# 2 (Covering Entire Syllabus)

NeoColab Case Studies
Previous Question paper

II B. Tech I Semester Regular Examinations, March 2022

DATA STRUCTURES USING C

(Computer Science and Engineering(Data Science))

Time: 3 hours
Max Marks: 70

Answer any Five Questions

All Questions carry equal marks
*****
1. a) Demonstrate insert and delete operations on Single Linked List with the help of a C program?
b) Illustrate infix to postfix conversion using stack implementation with an example?

2.a) Illustrate insert and delete operations on Skip List using examples?
b) Explain the advantages of hashing and discuss various hash functions.

3.a) Explain Binary Search Tree and its operations?

b) Describe the different Categories of Hash Function?

4.a) Define Red black tree with example.

b) Define Spay Tree with example.

5.a) Implement program on selection sort?

b) Implement program on insertion sort?

6.a) Explain BFS concept with example?

b) Explain DFS Concept with example?

7.a) Explain the Pattern Matching?

b) Explain applications of pattern matching?

8. a) Explain Brute Force Pattern matching with example?

b) Explain Boyer Moore pattern with example?
Tutorial Sheet

Unit-I Topics Revised

Topic Name Date
Linked List 05.11.2022

Unit-II Topics Revised

Topic Name Date
Hash Functions 12.11.2022

Unit-III Topics Revised

Topic Name Date
Red Black Trees 14.12.2022

Splay Trees 16.12.2022

Unit-IV Topics Revised

Topic Name Date
BFS 28.12.2022

DFS 29.12.2022

Unit-V Topics Revised

Topic Name Date
Brute Force Algorithm 21.01.2023

Boyer More 27.01.2023

KMP 28.01.2023
Topics beyond Syllabus

S. No Name of the Topic

1 Quick sort
2 Heap Sort

Course Assessment Sheet

Batch: 2022

Academic Year/Sem: 2022-2023

Course Name: Data Structures Using C

Course Number: 20CS302PC

Course Attainment (70% of Direct + 30% of Indirect) on a scale of 1 to 3.

Remarks and suggestions:

Course Coordinator
Blooms Taxonomy Direct

Level 1 Remembering Exhibit memory of previously learned material by recalling

facts, terms, basic concepts, and answers.
Level 2 Understanding Demonstrate understanding of facts and ideas by organizing,
comparing, translating, interpreting, giving descriptions, and
stating main ideas.
Level 3 Applying Solve problems to new situations by applying acquired
knowledge, facts, techniques and rules differently.
Level 4 Analyzing Examine and break information into parts by identifying
motives or causes. Make inferences and find evidence to
support generalizations.
Level 5 Evaluating Present and defend opinions by making judgments about
information, the validity of ideas, or quality of work based on
a set of criteria.
Level 6 Creating Compile information together in a different way by
combining elements in a new pattern or proposing alternative
solutions.
Direct Course Assessment Sheet
CSP Rubric Name & Number

CSP Rubric
S.No. Criteria LEVEL ( Level: 3-Excellent Level: 2-Good Level: 1-Poor)
The student speaks in phase with the given topic confidently using
Communicati

3
Audio-Visual aids. Vocabulary is good
Oral

Student speaking without proper planning, fair usage of Audio-Visual

on

1 2
aids. Vocabulary is not good
The student speaks vaguely not in phase with the given topic. No
1
synchronization among the talk and Visual Aids
Proper structuring of the document with relevant subtitles, readability
Writing Skills

3 of a document is high with the correct use of grammar. Work is

genuine and not published anywhere else
2 Information is gathered without continuity of topic, sentences were
2
not framed properly. Few topics are copied from other documents
Information gathered was not relevant to the given task, a vague
1
collection of sentences. Content is copied from other documents
The student identifies most potential ethical or societal issues and tries
3
Awareness
Social and

to provide solutions for them discussing with peers

Ethical

3 The student identifies the societal and ethical issues but fails to
2
provide any solutions discussing with peers
1 The student does not attempt to identify the societal and ethical issues
3 The student uses appropriate methods, techniques to model and solve
Knowledge

the problem accurately

Content

2 The student tries to model the problem but fails to solve the problem
4
1 The student fails to model the problem and also fails to solve the
problem
3 Listens carefully to the class and tries to answer questions confidently
Participatio
Student

Listens carefully to the lecture but doesn’t attempt to answer the

2
5
n

questions
The student neither listens to the class nor attempts to answer the
1
questions
The program structure is well organized with the appropriate use of
Technical and analytical

technologies and methodology. Code is easy to read and well

3
documented. The student can implement the algorithm to produce
accurate results
The program structure is well organized with the appropriate use of
Skills

6 technologies and methodology. Code is quite difficult to read and not

2
properly documented. The student can implement the algorithm
providing accurate results.
The program structure is not well organized with mistakes in the usage
1 of appropriate technologies and methodology. Code is difficult to read
and the student is not able to execute the program
Independently able to write programs to strengthen the concepts
Kn

led
act
ica

ow
Pr

ge

7 3
l

covered in theory
 Independently able to write programs but not able to strengthen the
2
concepts learned in theory
Not able to write programs and not able to strengthen the concepts
1
learned in theory
The student uses appropriate methods, techniques to model and solve
Understanding
of Engineering
core 3 the problem accurately in the context of multidisciplinary projects

8 The student tries to model the problem but fails to solve the problem
2
in the context of multidisciplinary projects
The student fails to model the problem and also fails to solve the
1
problem in the context of multidisciplinary projects

Direct Course Assessment

Direct Attainment Calculation

Program- Year -
AY:2022-23 B.Tech. II-I- CSD-A
SEM-Branch
Data Structures
Subject Name: Faculty Name: Dr.M.Kishore Kumar
using C

MID 1 MID-2 Avg of Mids End Exam Total

S.no Roll Number
(30M) (30M) (30M) (70M) (100M)

1 217R1A6701 30 30 30
2 217R1A6702 29 30 30
3 217R1A6703 27 27 27
4 217R1A6704 24 28 26
5 217R1A6705 30 28 29
6 217R1A6706 29 29 29
7 217R1A6707 29 30 30
8 217R1A6708 29 28 29
9 217R1A6709 27 28 28
10 217R1A6710 29 28 29
11 217R1A6711 10 23 17
12 217R1A6712 30 29 30
13 217R1A6713 29 28 29
14 217R1A6714 20 30 25
15 217R1A6715 28 29 29
16 217R1A6716 30 30 30
17 217R1A6717 27 29 28
18 217R1A6718 18 23 21
19 217R1A6719 30 29 30
20 217R1A6720 5 28 17
21 217R1A6721 0 0 0
22 217R1A6722 30 30 30
23 217R1A6723 16 20 18
24 217R1A6724 0 0 0
25 217R1A6725 30 30 30
26 217R1A6726 30 29 30
27 217R1A6727 30 30 30
28 217R1A6728 24 27 26
29 217R1A6729 30 30 30
30 217R1A6730 27 15 21
31 217R1A6731 30 30 30
32 217R1A6732 30 29 30
33 217R1A6733 30 28 29
34 217R1A6734 30 30 30
35 217R1A6735 30 29 30
36 217R1A6736 29 28 29
37 217R1A6737 30 30 30
38 217R1A6739 25 28 27
39 217R1A6740 22 18 20
40 217R1A6741 20 28 24
41 217R1A6742 24 28 26
42 217R1A6743 30 30 30
43 217R1A6744 24 27 26
44 217R1A6745 0 0 0
45 217R1A6746 29 30 30
46 217R1A6747 29 28 29
47 217R1A6748 30 30 30
48 217R1A6749 30 29 30
49 217R1A6750 30 30 30
50 217R1A6751 19 16 18
51 217R1A6752 27 27 27
52 217R1A6753 5 23 14
53 217R1A6754 29 29 29
54 217R1A6755 27 19 23
55 217R1A6756 27 22 25
56 217R1A6757 27 27 27
57 217R1A6758 26 26 26
58 217R1A6759 30 30 30
59 217R1A6760 30 30 30
60 217R1A6761 29 28 29
61 217R1A6762 20 16 18
62 217R1A6763 29 28 29
63 217R1A6764 24 22 23
64 227R5A6701 27 25 26
65 227R5A6702 29 25 27
66 227R5A6703 27 28 28
67 227R5A6704 27 26 27
68 227R5A6705 27 28 28
69 227R5A6706 30 30 30
70 227R5A6707 24 26 25
71 227R5A6708 30 27 29
Average Marks 25.77
Number of students attempted 71 71 71

Course Attainment Calculation

Number of
Students % Target Attainment Attainment Level
reached target

Interna1 Attainment(b) 65 91.5549296 3

External Attainment(a) 71 100 3
Course Attainment (0.75*a+0.25*b) 3

Direct Attainment Calculation

Program- Year -
AY:2022-23 B.Tech. II-I- CSD-B
SEM-Branch
Data Structures
Subject Name: Faculty Name: Dr.M.Kishore Kumar
using C
 MID 1 MID-2 Avg of Mids End Exam Total
S.no Roll Number
(30M) (30M) (30M) (70M) (100M)

1 217R1A6765 26 24 20
2 217R1A6766 15 25 23
3 217R1A6767 20 25 27
4 217R1A6768 26 27 26
5 217R1A6769 25 27 28
6 217R1A6770 27 28 28
7 217R1A6771 27 28 26
8 217R1A6772 26 26 26
9 217R1A6773 25 26 29
10 217R1A6774 29 29 28
11 217R1A6775 28 27 30
12 217R1A6776 30 29 24
13 217R1A6777 21 26 30
14 217R1A6779 30 29 21
15 217R1A6780 26 15 25
16 217R1A6781 25 24 26
17 217R1A6782 25 27 28
18 217R1A6783 27 28 26
19 217R1A6784 24 27 29
20 217R1A6785 29 28 29
21 217R1A6786 29 28 27
22 217R1A6787 26 28 29
23 217R1A6788 29 28 27
24 217R1A6789 27 27 30
25 217R1A6790 30 30 26
26 217R1A6791 26 26 29
27 217R1A6792 30 28 25
28 217R1A6793 23 27 29
29 217R1A6794 29 29 26
30 217R1A6795 24 27 28
31 217R1A6796 28 27 27
32 217R1A6797 28 25 25
33 217R1A6798 25 25 30
34 217R1A6799 30 30 26
35 217R1A67A0 25 26 30
36 217R1A67A1 29 30 25
37 217R1A67A2 25 25 26
38 217R1A67A3 24 27 26
39 217R1A67A4 26 26 26
40 217R1A67A5 26 26 26
41 217R1A67A6 26 26 26
42 217R1A67A7 27 24 28
43 217R1A67A8 28 28 28
44 217R1A67A9 28 28 30
45 217R1A67B0 29 30 28
46 217R1A67B1 28 27 24
47 217R1A67B2 23 25 29
48 217R1A67B3 29 28 28
49 217R1A67B4 28 27 27
50 217R1A67B5 28 26 25
51 217R1A67B6 23 27 23
52 217R1A67B7 20 26 28
53 217R1A67B8 28 27 26
54 217R1A67B9 26 25 27
55 217R1A67C0 27 26 23
56 217R1A67C1 22 24 27
57 217R1A67C2 25 28 25
58 217R1A67C3 25 25 25
59 217R1A67C4 25 25 29
60 217R1A67C5 29 28 26
61 217R1A67C6 26 26 30
62 217R1A67C7 30 30 29
63 217R1A67C8 29 28 26
64 227R5A6709 24 27 26
65 227R5A6710 25 26 26
66 227R5A6711 25 25 25
67 227R5A6712 26 25 26
68 227R5A6713 26 26 26
69 227R5A6714 25 26 26
70 227R5A6715 29 26 28
Average Marks 26.74
Number of students attempted 70 70 70
 Course Attainment Calculation

Number of
Students % Target Attainment Attainment Level
reached target

Interna1 Attainment(b) 65 91.5549296 3

External Attainment(a) 70 100 3
Course Attainment (0.75*a+0.25*b) 3

Program Outcome Attainment Calculation

PO Attainment Level Calculation= (1/3)* course attainment level * correlation level

(CL) of PO
Course PO PO PO PO PO PO PO PO PO PO1 PO1 PO1
1 2 3 4 5 6 7 8 9 0 1 2
Data
Structure 3 3 3 3 2 2 2 2
s

Program Specific Attainment Calculation

PSO Attainment Level Calculation= (1/3)* course attainment level * correlation level (CL) of
PSO
PSO Attainment Level Calculation= (1/3)* course
attainment level * correlration level (CL) of PSO
Course PSO1 PSO2 PSO3
DSC 2.0 2.0 2.2

Assignment Questions- MID-2

CMR TECHNICAL CAMPUS

UGC AUTONOMOUS
B.Tech. III Semester, Assignment-I
Department of CSE(DATA SCIENCE)
Subject: Data structures using C Date:28-01-2023
Subject Code:20CS302PC Max. Marks: 05
Note: Answer all the Questions

****
5 X 01 = 05 Marks

Q.No Questions Marks CO BL

 UNIT-III
1 Insert 8,18,5,15,17,25,40,80 for red black tree? 1M CO1 L1
UNIT-IV
2 Create max heap for the following elements (82,90,10,12,15,77,55,23) 1M CO2 L6
3 For the graph given below. Find DFS stepwise 1M CO2 L4

UNIT-V
4 Explain Boyer Moore Pattern Matching Algorithm with suitable example 1M CO3 L5
5 Write a short note on Trie tree 1M CO3 L&

CO-PO & PSO Mapping

CO CO1 CO2 CO3
PO
PSO

BL – Bloom’s Taxonomy Levels (L1- Remembering, L2- Understanding, L3 – Applying,

L4 – Analyzing, L5 – Evaluating, L6 - Creating)

MID TERM-2 QUESTION PAPER

CMR TECHNICAL CAMPUS

UGC AUTONOMOUS
B.Tech. III Semester II-Mid Examination
Subject: Data Structures using C Date:07-02-2023
Time: 1 Hours Max. Marks: 25
Note
i. This Question paper contains Part- A and Part- B.
ii. All the Questions in Part A are to be answered compulsorily.
iii. All Questions from Part B are to be answered with internal choice among them.

****
PART-A 5 X 02 = 10 Marks

Q. Questions Marks
BL CO
No.
1a Define AVL tree. Give Example 2M L1 CO3
1b Differentiate between Internal and External sorting and list sorting 2M L4
CO4
ttechniques.
1c Explain the two types of heap? 2M L5 CO4
1d Write a short note on trie tree. 2M L1 CO5
1e What is the principle idea behind the KMP algorithm? 2M L1 CO5

PART- B
03 + 06 + 06 = 15 Marks

Q. Questions Marks
BL CO
No.
2 Explain the properties of Red Black tree? Insert 10, 18, 7, 15, 16, 3M
L5
30, 25, 40, 60 in the Red Black tree
OR CO3
3 What is AVL tree and construct an AVL tree by inserting numbers 3M
L3
ffrom 1 to 8.
4a What is DFS & BFS technique? 3M L1
4b Implement DFS algorithm 3M L5
OR CO4
5a Explain the concept of Merge Sort? 3M L2
5b Perform Merge Sort on elements (10,5,7,6,1,4,8,3,2,9) 3M L5
6a Write the Knuth Morris Pratt Pattern matching algorithm 3M L1
6b Apply KMP to search the Pattern “ABCDABCY” in the text 3M
L3
“ABCXABCDABXABCDABCDABCY”
CO5
OR
7a Write a short note on Standard trie. 3M L3
7b Write a short note on Compressed trie and suffix trie 3M L3
CO-PO & PSO Mapping
CO CO3 CO4 CO5

PO
PSO

BL – Bloom’s Taxonomy Levels (L1- Remembering, L2- Understanding, L3 – Applying,

L4 – Analyzing, L5 – Evaluating, L6 - Creating)