HANDOUT

HANDOUT
II YEAR – SEMESTER I
DEPARTMENT OF DATA SCIENCE
ACADEMIC YEAR 2022-23
 DEPARTMENT OF AI & DS

HANDOUT-INDEX

S.No Contents
1 Vision, Mission, PEOs, POs, PSOs & COs
2 Institution Academic Calendar
3 Department Academic Calendar
4 Subject wise
i) Syllabus Copy
ii) Lesson Plan
iii) Question Bank
iv) End Examination Questions (Previous3
Academic Year)
v) Mid-1 & Mid-2 Questions (Previous3
Academic Year)
 SRI INDUCOLLEGEOFENGINEERING&TECHNOLOGY
B.TECH–CSE (DS)

INSTITUTION VISION
To be a premier Institution in Engineering Technology and Management with competency, values
and social consciousness.

INSTITUTION MISSION

IM1 Provide high quality academic programs, training activities and research facilities.

IM2 Promote Continuous Industry-Institute Interaction for Employability, Entrepreneurship,

Leadership and Research aptitude among stakeholders.

IM3 Contribute other Economical and technological development of the region, state and nation.

DEPARTMENT VISION
To be are cognized knowledge center in the field of Information Technology with self-
motivated, employable engineers to society.

DEPARTMENT MISSION
The Department has following Missions:
DM1 To offer high quality student centric education in Information Technology.

DM2 To provide a conducive environment to wards innovation and skills.

DM3 To involve in activities that provide social and professional solutions.

DM4 To impart training on emerging technologies namely cloud computing and IOT with

involvementof stakeholders.

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO1: Higher Studies: Graduates with an ability to apply knowledge of Basic sciences and
programming skills in their career and higher education
PEO2:Lifelong Learning: : Graduates with an ability to adopt new technologies for ever changing IT
industry needs through Self-Study, Critical thinking and Problem solving skills..
PEO3: Professional skills: Graduates will be ready to work in projects related to complex problems
involving multi-disciplinary projects with effective analytical skills
PEO4: Engineering Citizenship: Graduates with an ability to communicate well and exhibit social,
technical and ethical responsibility in process or product.
 PROGRAM OUTCOMES (POs) & PROGRAM SPECIFIC OUTCOMES (PSOs)

PO Description

PO1 Engineering Knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering problems .
Problem Analysis: Identify, formulate, review research literature, and analyze complex engineering
PO2
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
Design / development of Solutions: Design solutions for complex engineering problems and design
PO3
system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations.
Conduct investigations of complex problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions..
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
PO5 and IT tools including prediction and modeling to complex engineering activities with an understanding
of the limitations..
The engineer and Society: Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.

PO7 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
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the engineering
PO10
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.
Project management and finance: Demonstrate knowledge and understanding of the engineering and
PO11
management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
PO12 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 Chang
Program Specific Outcomes

Foundation of mathematical concepts: Touse mathematical methodologies to crack problem using suitable
PSO1
mathematical analysis, data structure and suitable algorithm
PSO2 Foundation of Computer System: The ability to interpret the fundamental concepts and methodology of computer
systems. Students can understand the functionality of hardware and software aspects of computer systems.
Foundations of Software development: The ability to grasp the software development lifecycle and methodologies
PSO3
of software systems. Possess competent skills and knowledge of software design process. Familiarity and practical
proficiency with a broad area of programming concepts and provide new ideas and innovations towards research
 COURSE OUTCOME

Course name: R20CSE2101 – Data Structures

At the end of the course student will be able to:
C212.1 Select the data structures that efficiently model the information in a problem. (Apply)
C212.2 Ability to assess efficiency trade-offs among different data structure implementations or
combinations. (Analyze)
C212.3 Implement and know the application of algorithms for sorting and searching. (Analyze)
C212.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 (Apply)
C212.5 Ability to select the data structures that efficiently model the information in a problem
(Analyze)
C212.6 Illustrate the concept of Text pattern matching algorithm (Evaluate)
ACADEMIC CALENDAR
 SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY
(An Autonomous Institution under UGC, New Delhi)
B.Tech. - II Year – I Semester L T P C
3 0 0 3
(R20CSE2101) Data Structures
Course Objectives:
 Exploring basic data structures such as stacks and queues.
 Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
 Introduces sorting and pattern matching algorithms

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

UNIT - II
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion and
searching. Hash Table Representation: hash functions, collision resolution-separate chaining, open
addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing.

UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and
Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and
Searching, Red –Black, Splay Trees.

UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting: Heap Sort, External
Sorting- Model for external sorting, Merge Sort.

UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm,
the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.

TEXTBOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson
Freed, Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
Education.
REFERENCE BOOKS:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A.
Forouzan, Cengage Learning. R20 B.TECH.
Course Outcomes:
 Ability to select the data structures that efficiently model the information in a
problem. (Understand)
 Ability to assess efficiency trade-offs among different data structure implementations
or combinations. (Create)
 Implement and know the application of algorithms for sorting and searching. (Create)
 Design programs using a variety of data structures, including hash tables, binary and
general tree structures, search trees, tries, heaps, graphs, and AVL-trees (Create)
 Ability to select the data structures that efficiently model the information in a problem
(Analyze)
 Illustrate the concept of Text pattern matching algorithm (Analyze)

SRI INDU COLLEGE OF ENGINEERING & TECHNOLOGY (AUTONOMOUS)

 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II-I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

Unit/ Page (s) Proposed

Book Teaching Proposed
Item Topic (s) No. of CO/RBT
Reference From To Methodology Date of
No. Periods
Handled
UNIT-I
I Introduction 13

1.1 Introduction to Data Structures R1 Black board 27/09/22 CO1, L1

3 8 01

1.2 Abstract data types R1 9 15 Black board 01 28/09/22 CO1, L1

PowerPoint
1.3 Linear list – singly linked list R1 193 194 02 29/09/22 CO1, ,L2
implementation Presentation
Insertion, deletion and searching
1.4 operations on linear list R1 195 212 Black board 02 11/10/22 CO1, L2

1.5 Stacks-Operations, stack applications R1 80 81 MODEL 02 14/10/22 CO1,L2

Array and linked representations

1.6 R1 83 89 Black board 01 15/10/22 CO1, L1
of stacks
1.7 Queues-operations R1 148 150 Black board 01 18/10/22 CO1, L2
1.8 Queues using array R1 150 150 Black board 01 19/10/22 C01,L2

1.9 Queues using Linked list R1 151 158 Black board 02 21/10/22 CO1,L1

Review Signature of the HOD/Coordinator

UNIT –II
Dictionaries
II 12

2.1 Dictionaries: linear list representation T1 395 395 Black board 01 26/10/22 CO2, L1

2.2 Skip list representation W1 PPT 01 28/10/22 CO 2, L1

Power point
2.3 Operations - insertion, deletion and searching W1 02 01/11/22 CO 2, L2
Presentation
Power point
Hash Table Representation: hash functions 02/11/22 CO 2, L2
2.3 W 397 398 Presentation 01
Collision resolution-separate chaining R1 Black board 04/11/22 CO2, L2
2.4 620 621 02
Open addressing-linear probing R1 Black board 11/11/22 CO 2, L3
2.5 623 624 02
Quadratic probing, , double hashing R1 Black board 15/11/22 CO2, L3
2.6 625 625 02

2.7 Rehashing, extendible hashing W2 PPT 01 19/11/22 CO 2, L2

Review Signature of the HOD/Coordinator

 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation
Unit/ Proposed Proposed
Book Teaching
Item Topic (s) Page (s) No. of Date of CO/RBT
Reference Methodology
No. Periods Handled
UNIT- III
III Search Trees 11
Search Trees: Binary Search Trees, Seminar 02 22/11/22 CO4,L3
3.1 Definition T1 226 226

3.2 Implementation, Operations- Searching, T1 227 228 Black board 02 23/11/22 CO3, L4
Insertion
3.3 T1 230 231 Black board 01 25/11/22 CO3,L3
Deletion of elements
R1 Power point 01 26/11/22 CO3, L4
3.4 AVL Trees, Definition, Height of an AVL 341 342
Tree Presentation
Operations – Insertion R1 Black board 01 02/12/22 CO4, L4
3.5 348 348
Deletion and Searching, R1 Black board 02 03/12/22 CO4, L3
3.6 349 351
3.7 Red –Black T1 518 525 Black board 01 09/12/22 CO4, L3
3.8 Splay Trees T1 542 542 Black board 01 13/12/22 CO4, L3

Review Signature of the HOD/Coordinator

UNIT- IV
IV Graphs 09
Graphs: Graph Implementation Black board 14/12/22 CO4, L2
4.1 T1 257 263 01

4.2 Graph Traversal Methods T1 273 Black board 16/12/22 CO4, L2

272 02

4.3 Sorting: Heap Sort T1 347 Black board 20/12/22 CO3, L4

347 02

4.4 External Sorting T1 372 Black board 24/12/22 CO3, L4

372 01
Model for external sorting T1 Power point 27/12/22 CO3, L2
4.5 376 376 Presentation 02
4.6 Merge Sort T1 335 Black board 28/12/22 CO3, L4
335 01
Review Signature of the HOD/Coordinator
UNIT- V
V Pattern Matching and tries 13
5.1 Pattern Matching and Tries T1 557 561 Black board 30/12/22 CO6,L3
02
The Brute force & Boyer –Moore algorithm Power point 04/01/23 CO6, L4
5.2 W6 - - Presentation 03
W7 - - Power point 07/01/23 CO6, L4
5.3 the Knuth-Morris-Pratt algorithm Presentation 02
5.4 Standard Tries Black board 12/01/23 CO6, L6
W8 - - 02
Compressed Tries Black board 17/01/23 CO6, L6
5.5 W8 - - 02
5.6 Suffix tries Black board 18/01/23 CO6, L6
W8 - - 02
Review Signature of the HOD/Coordinator
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

LIST OF TEXT BOOKS AND REFERENCES

TEXT BOOKS:
T1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed, Universities
Press.
T2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson Education.

REFERENCE BOOK:
R1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A. Forouzan, Cengage.

WEB LINKS

W1 . https://nptel.ac.in/noc/courses/noc18/SEM1/noc18-cs25/

W2 . https://nptel.ac.in/courses/106/105/106105085/
W3 . https://nptel.ac.in/courses/106/105/106105085/

W4 . https://www.coursera.org/specializations/data-structures-algorithms

W5 . https://www.edx.org/course/data-structures-fundamentals

W6 https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/

W7 https://www.geeksforgeeks.org/kmp-algorithm-for-pattern-searching/

W8 https://www.geeksforgeeks.org/types-of-tries/
 SRI INDU COLLEGE OF ENGG &
Prepared on: 29/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

CONTENT BEYOND THE SYLLABUS

Proposed Resource
S.No Topics Actions Date Person/Mode POs PSOs
1 Binary Tree , Terminology NPTEL Dr K Gunasekaran PO1,PO4 PSO1
and B+ Tree
2 List implementation using NPTEL Dr K Gunasekaran PO1 PSO1
Array

ASSIGNMENT I & II

S.No. Course Date

Assignment Questions Books Date Of
Outcome Of
To be Submission
Announcement
Referred
Explain the following data
structures operations? 30.10.22
I. T2 14.10.22
a) Stack operations CO1
b) Queue operations
Describe Linked list? Distinguish
2. CO1 T2 14.10.22 30.10.22
between array and linked list?

Discuss the term Dictionary? What

3. are the various applications of T2 14.10.22 30.10.22
Dictionary and Hashing? CO2
What are the various types of
4. CO2 T1 14.10.22 30.10.22
hash functions?
Write a procedure to perform
5. insertion deletion and searching T1 14.10.22 30.10.22
CO4
in Binary search tree?
a) Develop a program to insert
the elements into AVL tree?
6. b) Construction of AVL tree step by T2 28.12.22 10.1.23

step with diagrams for the list {25,30, CO4

35, 40, 50, 55, 60, 65, 70, 75}

7.
Explain Breadth first search T2 28.12.22 28.12.22
traversal with example? CO3

8. Discuss about merge sort technique T2 28.12.22 28.12.22

with suitable example? CO3
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

Course Date
Assignment Questions Books Date Of Submission
S.No. Outcome Of
To be Referred
Announcement
9. T2 28.12.22 28.12.22
Write and explain
Boyer Moore pattern CO6
matching algorithm?
10. T2 28.12.22 28.12.22
Calculate the failure function
CO6
(or) prefix table in a search string
“ABACAABADCABACABAA
BB”.

SELF STUDY TOPICS

S.No. Topics Books & Journals Course Outcomes

1 Quick sort Data structures through C by CO1,CO3

“Yashvant Kanetkar”
Circular queue Data structures through C by CO1,CO2
2
“Yashvant Kanetkar”
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

QUESTION BANK WITH BLOOMS TAXONOMY LEVEL (BTL)

(1. Remembering 2. Understanding 3. Applying 4. Analyzing 5. Evaluating 6. Creating)

UNIT I
PART A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Define a data structure? Mar 2018 1 CO1
2. Define Linear data structure? Dec 2016 1 CO1

3. Describe Non Linear data structure? 2 CO1

4. Write about abstract data type? Nov 2018 3 CO1
5. Define Stack? DEC 2012
1 CO1
6. Describe Queue? Oct 2018
2 CO1
7. Describe Linked list? Nov 2019
2 CO1
8 Explain the advantages and disadvantages of linked list.
2 CO1,CO2
9 What ate the advantages and disadvantages of arrays? Oct 2016
1 CO1
10 Explain the applications of Linked list? DEC 2017
2 CO1
PART B
10 MARKS QUESTIONS
1 Discuss about implementation of single linked list. Oct 2019 2 CO1
2 Write a program to implement single linked list? Dec 2016 6 CO1,CO2
3 Explain the following data structures 2 CO1
a)Stack operations b)Queue operations
4 Write about Stack representation using array and linked list? July 2021 Nov 2019 3
CO1,CO2
5 Write about Queue representation using array and linked list? Mar 2021 3 CO1,CO2
6 Write a program to implement stack using Linked list? 6 CO1,CO2
7 Write a program to implement Queue using array? Oct 2020 6
CO1,CO2
8 Explain about Stack applications and Queue applications. 2 CO1,CO2
9 Describe Linked list? Distinguish between array and linked list? Mar 2018 4 CO1
10 Explain about following 2 CO1
a) Data structure b) Abstract Data Type
c) Linear data structure d) Non Linear Data structure
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

UNIT II
PART A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Describe Dictionary? Mar 2020 1 CO1,CO2
2. What is Hash Function? DEC 2016 1 CO2
3. Write about Linear Probing and Quadratic Probing? Dec 2016 3 CO2
4. Define collision? 3 CO1,CO2
5. Describe skip list? Nov 2019 2 CO1,CO2
6. List the collision resolution techniques? OCT 2020 1 CO1,CO2

7. Define chaining? 1 CO2

8 Define double hashing? Dec 2017 1 CO2

9 What is the use of rehashing technique? 3 CO2

10 What is the use extensible hashing?

3 CO2
PART B
10 MARKS QUESTIONS
1 What are the two methods of representing Liner list? Explain with example DEC 2012 1 CO2
2 Write about Hash table and Hash function? DEC 2016 3 CO2
3 What are the various types of hash functions? 1 CO2
4 Demonstrate skip list representation and its node structure with example? Oct 2021 Nov 3 CO2
2019
5 Explain 2 CO1,CO2
a) How does collision occur? Mar 2021 Oct 2020
b) Explain chaining and open addressing methods for detecting collision and overflow?
6 Write about following collision handling techniques? a) Quadratic Probing 3 CO2
b) Double hashing Mar 2021
7 Discuss about the Rehashing Technique and its advantages? 2
CO2
8 Explain the concept of extensible hashing with suitable example 2 CO2
9 What is hashing? Explain the differentiation between hashing and skip list? DEC 2013 2 CO2
10 Discuss the term Dictionary? What are the various applications of Dictionary and Hashing? 3 CO1,CO2
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

UNIT III
PART A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Define a Binary Search tree? How do we represent it? July 2021 1 CO1.CO3
2. List the operations in Binary Search Tree? Mar 2021 1 CO3
3. What is an AVL Tree? Give one example? Nov 2019 1 CO3
4. Write short notes on Balance factor in AVL tree? 3 CO3
5. Differentiate AVL tree and Binary search tree? DEC 2015 4 CO1,CO3
6. What are the applications of AVL tree? 1 CO3
7. List the rotations in AVL tree? 1 CO3
8 Write the disadvantages of Binary search tree? 3 CO3
9 List the rules of Red-Black Tree? Dec 2016 1 CO1,CO3
10 What is Splay tree? OCT 2020
1 CO1,CO3
PART B
10 MARKS QUESTIONS
1 Write a procedure to perform insertion deletion and searching in Binary search tree? 6 CO2,CO3
Dec 2017, Dec 2016
2 Explain in detail deletion of an element in BST in different cases? 2 CO1,CO4
3 Write a program to perform following operations in Binary search tree? 6 CO1,CO4
a) Insert an element into a binary search tree
b) Delete an element from a binary search tree OCT 2020
4 Define Binary search tree? Construct binary search tree step by step with diagrams 6 CO1,CO4
using list of numbers {4,5,1,2,9,7,3,6,10,12,11}. July 2021
5 Describe AVL Tree? Illustrate different rotations in AVL tree for balancing with 4 CO4
appropriate example? Nov 2019
6 Write list of operations perform on AVL tree with example? Mar 2021 3 CO4
7 a) Explain a balance factor in AVL tree with example? 2 CO4
b)Explain representation of AVL tree with example?
8 a) Develop a program to insert the elements into AVL tree? 6 CO4
b) Construction of AVL tree step by step with diagrams for the list {25, 30, 35, 40,
50, 55, 60, 65, 70, 75}. DEC 2011 DEC 2018
9 Illustrate Red-Black tree with example? 4 CO1,CO4
10 Illustrate Splay-tree with example? Oct 2021 4 CO1,CO4
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

UNIT IV
PART A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Define a graph? DEC 2015 1 CO5,CO4
2. Write short notes on directed graph? Mar 2021 3 CO4

3. Write short notes on undirected graph? DEC 2016 3 CO4

4. What the graph traversing techniques? 1 CO1,CO5
5. Define complete graph and weighted graph? July 2021 1 CO4
6. Describe heap sort ? 2 CO4
7. Describe external sorting? OCT 2020 2 CO4
8 What is merge sort? 1 CO4
9 What is in-degree and out-degree of graph? July 2017 1 CO4
10 Compare BFS and DFS? 4 CO5,CO4

PART B
10 MARKS QUESTIONS
1 Write about various graph representation techniques? Dec 2017, July2021 3 CO4
2 Classify the types of graphs? Explain basic terminologies in graph? 2 CO4
3 Explain Breadth first search traversal with example? Mar 2021 2 CO5,CO4
4 Explain Depth first search traversal with example? Mar 2021 2 CO5,CO4
5 Write a program to implement breadth first search? 6 CO5,CO3
6 Write a program to implement depth first search? 6 CO5,CO4
7 Explain about heap sort with example? DEC 2015, July 2021, Mar 2021, Oct 21 2 CO3
8 Explain external sorting model for external sorting? Oct 2020 2 CO3
9 Discuss about merge sort technique with suitable example? Nov 2019 2 CO3
10 a) Distinguish between heap sort and merge sort? 4 CO3
b) What are applications of heap sort and merge sort?
 SRI INDU COLLEGE OF ENGG &
Prepared on: 23/09/22
TECH LESSON PLAN
Rev1:
(Regulation :R20)
Department of Artificial Intelligence and Data
Science
Sub. Code & Title R20CSE2101 Data Structures
Academic Year: 2022-23 Year/Sem./Section II/I/-
Faculty Name & Dr S R MUGUNTHAN, Professor
Designation

UNIT V
PART A
1 MARK QUESTIONS BT COURSE
LEVEL OUTCOME
1 Define Trie? Mar 2019 1 CO1,CO6
2. What are the different types of Pattern Matching Algorithms? CO6
1
3. Define String and Alphabet? DEC 2015 1 CO6
4. Describe Prefix and Suffix with example.? Oct 2020 2 CO6
5. What is Substring? Write down the substrings of the String “DATASTRUCTURES”. DEC 1 CO6
2017
6. What is the average-case and worst-case running time of KMP algorithm? 1 CO6
7. What is the running time of Brute-force algorithm? DEC 2016 1 CO6
8 What are the applications of pattern matching? 1 CO1,CO6
9 Write about Compressed Trie? 3 CO6
10 Write about Suffix Trie? OCT 2020 3 CO6

PART B
10 MARKS
QUESTIONS
1 Discuss about various types of tries. 2 CO1
2 Write and explain Boyer Moore pattern matching algorithm? Nov 2019 6 CO6
3 6 CO1,CO6
Write and explain Knuth-Morris-pratt pattern matching algorithm? OCT 2020 Mar 2021
Nov 2019
4 What are the advantages of trie? Compare trie with Hash table? 4 CO6
5 Explain about the compressed triewith an example. Mar 2020 2 CO6

6 Calculate the failure function (or) prefix table in a search string 6 CO6
“ABACAABADCABACABAABB”. DEC 2016
7 Differentiate standard tries and compressed tries? 4 CO6
8 Explain the Brute-force algorithm with an example OCT 2020 2 CO1,CO6
9 Explain about the Suffix tries with an example. Nov 2018 2 CO6
10 Draw the Standard Trie and Compressed Trie for the following String 6 CO6
{area, array, aim, acid, act, rest, rate, ratio}Dec 2018
PREVIOUS YEAR QUESTION PAPER