FORMAT : QP09 KCE/DEPT.

OF CSE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SUBJECT: DATA STRUCTURES

YEAR/SEMESTER: II/III

QUESTION BANK (24CSPC302)

(Version: 1)

PREPARED BY
Ms.B.Bavithra, AP/ CSE
Ms.R.Aruna, AP/CSE

DS 4.1 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

24CSPC302 DATA STRUCTURES L T P C

SDG-04, 09 3 0 0 3

UNIT I LIST 9

Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list
implementation –Singly linked lists- Circularly linked lists- Doubly-linked lists – Applications of
lists –Polynomial ADT – Radix Sort –Multilists.

UNIT II STACKS, QUEUES 9

Stack ADT – Operations - Applications – Balancing Symbols- Evaluating arithmetic expressions-

Conversion of Infix to postfix expression – Function Calls - Queue ADT– Operations - Circular
Queue – DeQueue – Applications of queues.

UNIT III TREES 9

Tree ADT – Tree traversals - Binary Tree ADT – Expression trees – Binary search tree ADT –
AVL Trees – Priority Queue (Heaps) – Binary Heap.

UNIT IV MULTIWAY SEARCH TREE AND GRAPHS 9

B Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of graph - Breadth-first

traversal - Depth-first traversal – Bi-Connectivity – Euler Circuit - Topological Sort- Dijkstra's
algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9

Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort - Insertion sort -
Shell sort – Merge sort. Hashing- Hash Functions – Separate Chaining – Open Addressing –
Rehashing – Extendible Hashing.
TOTAL: 45 PERIODS

SIGNATURE OF STAFF IN-CHARGE HOD/CSE

(Ms.B.Bavithra, Ms.R.Aruna)

DS 4.2 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

COURSE PLAN

Sub. Code : 24CSPC302 Branch / Year / Sem : B.E CSE-B / II /III

Sub.Name : Data Structures Batch : 2024-2028
Staff Name : Ms.B.Bavithra Academic Year : 2025-26 (ODD)
Ms.R.Aruna

COURSE OBJECTIVE
1. To understand the concepts of ADTs
2. To Learn linear data structures – lists, stacks, and queues
3. To understand non-linear data structures – trees and graphs
4. To understand sorting, searching and hashing algorithms
5. To apply Tree and Graph structures

TEXT BOOKS
T1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education,2005.
T2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007.

REFERENCE BOOKS
R1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2015
R2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to
Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
R3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st
edition, Pearson, 2002.
R4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

WEB RESOURCES
W1. https://www.cse.iitkgp.ac.in/~pds/semester/2016a/JM/Wk11-linkedlist.ppt
(Topic.No:03)
W2. https://courses.cs.washington.edu/courses/cse326/RadixSort.ppt (Topic.No:08)
W3. https://www.cs.ust.hk/~huamin/COMP171/stack-queue.ppt
(Topic.No:10,15)
W4. https://nptel.ac.in/courses/106102064/6 (Topic.No:20)
W5. www.csie.ntu.edu.tw/~ds/ppt/ch6/chapter6.PPT (Topic.No:30)
W6. https://www.cs.princeton.edu/courses/archive/spring13/cos423/lectures
/04GreedyAlgorithmsII.pdf (Topic.No:36-39)

DS 4.3 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

Topic Topic Books for Page No. Teaching No. of Cumulative

No Reference Methodology Hours No. of
Required periods
UNIT I LIST 9+1
1. Abstract Data Types T1 47-48
BB/PPT 01 01
(ADTs), List ADT T2 34-36
2. Array-based T1 49
BB/PPT 01 02
implementation
3. Linked list T1 49-56
implementation- T2 191-
BB/PPT 02 04
Singly linked lists W1 222

4. Circularly linked T2 236-251

BB/PPT 01 05
lists
5. Doubly-linked lists T1 67-68
T2 251- L.VIDEO 01 06
258
6. Applications of lists T1 73-78 BB/PPT 01 07
7. Polynomial ADT T1 57-59 BB/PPT 01 08
8. Radix Sort T2 432-436 BB/PPT
01 09
W2
9. Multilists T1 77-78 BB/PPT 01 10
LEARNING OUTCOME
At the end of unit, students will be able to
 Gain knowledge on Abstract data type & Linked lists
 Implement the operations on various lists.
 Implement radix sort technique
UNIT II STACKS, QUEUES 9+1
T1 65-72
Stack ADT-
10. T2 116-132 L.VIDEO 01 11
Operations
W3
Applications-
11. T1 72-79 BB/PPT 01 12
Balancing symbols
Evaluating arithmetic
12. T2 132-138 BB/PPT 01 13
expressions
Conversion of Infix T2 296-307
13. BB/PPT 02 15
to postfix expression R1 95-102
14. Function Calls T1 100-102 BB/PPT 01 16
15. Queue ADT-Operations T1 79-82 BB/PPT 01 17
T2 144-162
W3
16. Circular Queue T2 162-168 BB/PPT 01 18
17. DeQueue T2 168-174 BB/PPT 01 19
Applications of
18. queues. T1 100-101 BB/PPT 01 20

DS 4.4 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

Topic Topic Books for Page No. Teaching No. of Cumulative

No Reference Methodology Hours No. of
Required periods
LEARNING OUTCOME
At the end of unit, students will be able to
 Understand about Linear data structures Stacks and Queues.
 Implement the operations on Stack and Queue.
 Identify appropriate data structures to handle data.
UNIT III TREES 9+1
T1 89-90
19. Tree ADT BB/PPT 01 21
T2 322-329
T1 01 22
91-95 NPTEL
20. Tree traversals T2
336-351
W4
T1 95-97
21. Binary Tree ADT BB/PPT 01 23
T2 329-336
T1 123-127
22. Expression trees BB/PPT 01 24
R4 406-410
23. Applications of trees T2 360-363 BB/PPT 01 25
Binary search tree
24. T2 354-360 L.VIDEO 01 26
ADT
25. AVL Trees T2 368-373 BB/PPT 02 28
Priority Queue
26. T2 174-182 BB/PPT 01 29
(Heaps)
27. Binary Heap T1 205-207 BB/PPT 01 30
LEARNING OUTCOME
At the end of unit, students will be able to
 Understand various non linear data structures
 Implement various operations on trees.
 Appraise the application of trees.

UNIT IV MULTIWAY SEARCH TREE AND GRAPHS 9+1

T2 363-367
28. B-Tree BB/PPT 01 31
R2 484-499
29. B+ Tree T2 367-368 L.VIDEO 01 32
Graph Definition,
R1
30. Representation of 517-520 BB/PPT 01 33
W5
Graph, Types of Graph
Breadth-first BB/PPT
31. T2 394-396 01 34
traversal VLAB
BB/PPT
32. Depth-first traversal T2 396-398 01 35
VLAB
33. Bi-connectivity T1 318-321 01
BB/PPT 36
34. Euler circuits T1 321-326
T2 399-401
35. Topological Sort BB/PPT 01 37
R2

DS 4.5 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

Topic Topic Books for Page No. Teaching No. of Cumulative

No Reference Methodology Hours No. of
Requi periods
red
36. Dijkstra's algorithm W6 612-615 BB/PPT 01 38
Minimum Spanning T2
37. 390-391 BB/PPT 01 39
Tree W6
T2
38. Prim’s Algorithm 391-393 BB/PPT
W6 01 40
39. Kruskal's algorithm W6 617-620 BB/PPT
LEARNING OUTCOME
At the end of unit, students will be able to
 Gain knowledge about non-linear data structures.
 Implement the graph traversal operations.
 Implement various operations of graph.
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9+1

40. Searching – Linear 446-451

T2 BB/PPT
Search 01 41
41. Binary Search T2 451-455 BB/PPT
42. T1 235-236
Sorting-Bubble sort BB/PPT
T2 416-417
01 42
43. T2 414-416 BB/PPT
Selection sort
R3 370-373
44. T2 410-413 BB/PPT
Insertion sort
R3 369-370 01 43
45. 238-240 BB/PPT
Shell sort T1
46. Merge sort T2 424-429 BB/PPT 01 44
47. T1 165-165
Hashing L.VIDEO 01 45
R1 468-476
48. T1 166-168
Hash Functions BB/PPT 01 46
T2 457-468
49. Separate Chaining T1 168-172 BB/PPT 01 47
50. Open Addressing T1 173-180 BB/PPT 01 48
51. T1 181-183
Rehashing BB/PPT 01 49

52. Extendible Hashing T1 184-190 BB/PPT 01 50

LEARNING OUTCOME
At the end of unit, students should be able to
 Gain knowledge about sorting and searching algorithms.
 Implement various sorting techniques.
 Understand the concept of hashing techniques.

DS 4.6 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

COURSE OUTCOME
At the end of the course, the students will be able to
1. Define linear and non-linear data structures.
2. Implement linear and non–linear data structure operations.
3. Use appropriate linear/non–linear data structure operations for solving a given
problem.
4. Apply appropriate graph algorithms for graph applications.
5. Analyze the various searching and sorting algorithms

CONTENT BEYOND THE SYLLABUS

 Application of various Data structures used in cyber Security

INTERNAL ASSESSMENT DETAILS

ASSESSMENT I II MODEL

Topic Nos. 1- 13 14-27 1-52

Date

ASSIGNMENT DETAILS

ASSIGNMENT I II

Topic Nos. for 1-22 23-52

reference / Activity
Deadline

DS 4.7 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

Class Strength : 58

DS 4.8 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

ASSIGNMENT – I
SL. ROLL NO ACTIVITY NAME TOPIC
NO
1. Certification course Certification course on data structure
24CSB01
2. Singly linked lists
24CSB02 SEMINAR
3. List ADT
24CSB03 SEMINAR
4. QUIZ Circularly linked lists
24CSB04
5. SEMINAR ADT
24CSB05
6. QUIZ Array-based implementation
24CSB06
7. QUIZ Applications of lists
24CSB07
8. Certification course Certification course on data structure
24CSB08
9. Certification course Certification course on data structure
24CSB09
10. QUIZ Linked list implementation and types
24CSB10
11. SEMINAR Polynomial ADT
24CSB11
12. QUIZ Radix Sort
24CSB12
13. QUIZ Linked list implementation
24CSB14
14. SEMINAR Stack ADT
24CSB15
15. SEMINAR Stack operations
24CSB16
16. Certification course Certification course on data structure
24CSB17
17. SEMINAR Balancing Symbols
24CSB18
18. QUIZ Doubly-linked lists
24CSB19
19. SEMINAR Abstract Data Types (ADTs)
24CSB21
20. QUIZ Linked list implementation
24CSB22
21. Certification course Certification course on data structure
24CSB23
22. Applications of stack
24CSB24 MINDMAP
23. Certification course on data structure
24CSB25 MINDMAP
24. 24CSB26 MINDMAP Multilists

DS 4.9 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

25. SEMINAR Evaluating arithmetic expressions

24CSB27
26. PPT DeQueue
24CSB28
27. Certification course Certification course on data structure
24CSB29
28. Array-based implementation
24CSB30 MINDMAP
29. Tree ADT
24CSB31 MINDMAP
30. Queue ADT
24CSB32 MINDMAP
31. Certification course Certification course on data structure
24CSB33
32. PPT Conversion of Infix to postfix expression
24CSB34
33. Applications of queues
24CSB35 MINDMAP
34. Queue Operations
24CSB36 MINDMAP
35. Poster Presentation Queue ADT
24CSB37
36. PPT Binary Tree ADT
24CSB38
37. MINDMAP Tree traversals
24CSB39
38. Circular Queue
24CSB40
PPT
39. Applications of queue
24CSB41
PPT
40. Poster Presentation Binary Tree ADT
24CSB42
41. MINDMAP DeQueue
24CSB43
42. PPT Applications of queues
24CSB44
43. FLASH CARD Stack
24CSB45
44. Applications of stack
24CSB46
Poster Presentation
45. Linked list implementation
24CSB47
Poster Presentation
46. PPT Binary Tree ADT
24CSB48
47. PPT Applications of list
24CSB49
48. Poster Presentation Function Calls
24CSB50
49. 24CSB51 FLASH CARD Applications of queues

DS 4.10 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

50. FLASH CARD Array-based implementation

24CSB52
51. Poster Presentation Stack types
24CSB53
52. PPT Binary Tree ADT
24CSB54
53. FLASH CARD Array-based implementation
24CSB55
54. Linked list implementation
24CSB56
FLASH CARD
55. Overview of data structure
24CSB57
FLASH CARD
56. PPT Stack operations
24CSB58
57. Poster Presentation Expression trees
24CSB59
58. FLASH CARD Array-based implementation
24CSB60

Class Strength : 58
ASSIGNMENT – II
SL. ROLL NO ACTIVITY NAME TOPIC
NO
1. CONCEPT MAP Binary search tree ADT
24CSB01
2. MINDMAP Hash Functions
24CSB02
3. MINDMAP AVL Trees
24CSB03
4. POSTER Priority Queue (Heaps)
24CSB04
5. MINDMAP Insertion sort
24CSB05
6. Binary Heap
24CSB06 POSTER
7. B Tree
24CSB07 POSTER
8. Depth-first traversal
24CSB08 CONCEPT MAP
9. Graph Definition & types
24CSB09 CONCEPT MAP
10. POSTER Searching
24CSB10
11. MINDMAP Binary search tree
24CSB11
12. B+ Tree
24CSB12 POSTER
13. Selection sort
24CSB14 POSTER

DS 4.11 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

14. MINDMAP Kruskal's algorithm

24CSB15
15. MINDMAP Linear Search
24CSB16
16. CONCEPT MAP Representation of Graphs
24CSB17
17. MINDMAP Binary Search
24CSB18
18. POSTER Sorting
24CSB19
19. MINDMAP Binary search tree ADT
24CSB21
20. POSTER Bubble sort
24CSB22
21. CONCEPT MAP Types of graph
24CSB23
22. Certification course Certification course on data structure
24CSB24
23. Certification course Certification course on data structure
24CSB25
24. Certification course Certification course on data structure
24CSB26
25. MINDMAP Shell sort
24CSB27
26. FLASHCARD Merge sort
24CSB28
27. CONCEPT MAP Breadth-first traversal
24CSB29
28. Certification course Certification course on data structure
24CSB30
29. Certification course Certification course on data structure
24CSB31
30. Certification course Certification course on data structure
24CSB32
31. CONCEPT MAP Separate chaining
24CSB33
32. FLASHCARD Hashing
24CSB34
33. Certification course Certification course on data structure
24CSB35
34. Certification course Certification course on data structure
24CSB36
35. PPT Separate Chaining
24CSB37
36. FLASHCARD AVL Trees
24CSB38
37. Certification course Certification course on data structure
24CSB39
38. FLASHCARD Convert the following infix expression to
24CSB40
postfix expression (A – B ) + C * D / E – C.

DS 4.12 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

39. FLASHCARD Prim's algorithm

24CSB41
40. PPT Euler Circuit
24CSB42
41. Certification course Certification course on data structure
24CSB43
42. FLASHCARD Draw expression tree (infix, prefix, postfix
24CSB44
notation) for the following expression X + Y * Z /w
43. QUIZ B- Tree
24CSB45
44. PPT Kruskal's algorithm
24CSB46
45. PPT Binary search tree ADT
24CSB47
46. Rehashing
24CSB48
FLASHCARD
47. Draw expression tree (infix, prefix, postfix
24CSB49
FLASHCARD notation) for the following expression a+b-c*d+e*f
48. PPT Dijkstra's algorithm
24CSB50
49. AVL Trees
24CSB51
QUIZ
50. Certification course on data structure
24CSB52
QUIZ
51. PPT Topological Sort
24CSB53
52. FLASHCARD Open Addressing
24CSB54
53. Minimum Spanning Tree
24CSB55
QUIZ
54. Extensible hashing
24CSB56
QUIZ
55. Prim's algorithm
24CSB57
QUIZ
56. FLASHCARD Construct the binary tree for the following:
Inorder 4 2 5 1 3
24CSB58
Preorder 1 2 4 5 3
Postorder 4 5 2 3 1
57. PPT Kruskal's algorithm
24CSB59
58. QUIZ Bi-Connectivity
24CSB60

Evaluation :
MIND MAP CONCEPT MAP
 Content: 10 Marks  Content: 10 Marks
 Presentation : 25 Marks  Presentation : 25 Marks
 Q&A: 5 Marks  Q&A: 5 Marks
PPT SEMINAR
 Presentation : 15 Marks  Presentation : 15 Marks

DS 4.13 KCE/CSE/QB/II YR/DS

 FORMAT : QP09 KCE/DEPT. OF CSE

 Communication : 5 Marks  Communication : 5 Marks

 Report :15 Marks  Report :15 Marks
 Q&A : 5 Marks  Q&A : 5 Marks
POSTER PRESENTATION CERTIFICATION COURSE
 Content: 10 Marks Successful completion : 40
 Presentation : 25 Marks
 Q&A: 5 Marks
QUIZ
 No. of 2 mark question (20 No’s)– 40

COURSE ASSESSMENT PLAN

CO CO Description Weightage CAT1 CAT2 MODEL ASSIGN.- ASSIGN.- AU
1 2
CO1 Define linear and 20% √ √ √
non-linear data
structures.
CO2 Implement linear 20% √ √ √
and non–linear
data structure
operations
CO3 Use appropriate 20% √ √ √ √ √
linear/non–linear
data structure
operations for
solving a given
problem.
CO4 Apply appropriate 20% √ √ √
graph algorithms
for graph
applications.
CO5 Analyze the 20% √ √ √
various searching
and sorting
algorithms

COURSE OUTCOME ALLIGNMENT MATRIX – MODEL EXAM SAMPLE QUESTION SET

Q.No Question Marks CO BTL

1 State the advantage of ADT 2 CO1 L1

2 Compare array ADT with List ADT 2 CO1 L2

3 Write a program to reverse a string using LIFO 2 CO3 L3

ADT.

4 Brief about the generalized version of Queue. And 2 CO1 L1

list the operations performed by it.

DS 4.14 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

5 Illustrate Heap Data Structure. 2 CO2 L2

6 How to resolve dangling threads in binary tree ? 2 CO3 L2
Illustrate.
7 Give the adjacency matrix representation of the 2 CO2 L3
following graph

A B C

D E

8 Give the procedure for finding articulation point. 2 CO2 L2

9 List the limitations of linear probing 2 CO1 L1

10 State the complexity of binary search 2 CO5 L1

11.a. i. State the polynomial representation for 7 CO2 L3

6x3+9x2+7x+1 using linked list. Write
procedure to add and multiply two
polynomial and explain with suitable example.
ii. What are the ways to insert a node in linked 6
list?. Write an algorithm for inserting a node
before a given node in a linked list.

11.b. With suitable illustration explain the procedure

to perform operations on Doubly linked list
i. Insertion of an element after a given 5 CO2 L2
element 4
ii. Deletion of an element in the last position 4
iii. Searching for an element
12.a. i. Write algorithm to check if the given 6 CO3 L3
parenthesized arithmetic expression contains
balanced parenthesis
ii. Convert infix expression to postfix expression 7
and evaluate it.
Q.No Question Marks CO BTL

12.b. i. Write a C program to implement a LIFO list 7 CO3 L3

that grows and shrinks dynamically.
ii. Convert the following Infix expression to 3
Postfix expression. (4 + 8)* (6 – 5)/((3 – 2)* (2
+ 2)) 3
iii. Find the value of the following postfix
expression. Show stack contents-step by step
output. 54 6 + 7 4 – * 9 / 35 15 + +

DS 4.15 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

13.a. Write a routine for Post order traversal. Is it 6 CO3 L3

possible to find minimum and maximum
value in the binary search tree using traversals?
Discuss . Display the given tree using
Inorder, Preorder and Postorder traversals.
Delete 11 and 10 from the below binary search tree.
Display tree after each deletion
7

7
2 1
2
1 3 1 3
1 0
1 2 4
0 8 0
13.b. Write a routine for AVL tree insertion. Insert 7 CO3 L3
the following elements in the empty tree and
how do you balance the tree after each element
insertion? Elements : 2,5,4,6,7,9,8,3,1,10. 6
14.a. i. Apply an appropriate algorithm to find the 6 CO4 L4
shortest path from A to every other node of A,
for the given graph below. Write the procedure

3 A
1
B C
6 7
5
D E
6

14.a. ii. Construct the MST of the graph given below 7 CO4 L4
and write the procedure

Q.No Question Marks CO BTL

14.b. i. Apply Kruskal’s algorithm on the graph given 7 CO4 L4
in Fig and find MST

ii. Find Shortest path applying Prim’s algorithm 6

DS 4.16 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

on the given graph

15.a. Consider a hash table with 9 slots. The hash 13 CO3 L4

function is h(k) = k mod 9. The following keys are
inserted in the order 15, 38, 8, 5, 20, 33, 14, 30.
Draw the contents of the hash table when the
collisions are resolved by i) Chaining ii) Linear
Probing iii) Double hashing. The second hash
function h2(x) = 7 – (x mod 7).
15.b. Given input {4371, 1323, 6173, 4199, 4344, 9679, 13 CO3 L4
1989} and a hash function h(x)= x(mod10),
show the resulting
 open hash table
 closed hash table using linear probing
 closed hash table using quadratic probing
 closed.
16.a. Write a function to perform selection sort. Give 6 CO5 L3
example.
Give the routine for Insertion sort. Sort the 7
following sequence using insertion sort 3, 10, 4, 2, 2
8, 6, 5, 1.
Compare Binary search and Linear search.
16.b. Construct an AVL tree by inserting the following 15 CO3 L3
elements in the given order. 63, 9, 19, 27, 18, 108,
99, 81. Write the procedure for balancing the tree
after deletion.

ASSESSMENT PAPER QUALITY MATRIX

PART BTL1 BTL2 BTL3 BTL4 BTL5 BTL6

A 1,4,9,10 2,5,6,8 3,7

B 11.a,b 12.a,b 14.a,b

13.a,b 15.a,b

DS 4.17 KCE/CSE/QB/II YR/DS

FORMAT : QP09 KCE/DEPT. OF CSE

C 16.a,b

TOTAL 8 21 45 26
Distribution 29 71 -

Prepared by Verified by
Ms.B.Bavithra HOD/CSE
Ms.R.Aruna

Approved by
PRINCIPAL

DS 4.18 KCE/CSE/QB/II YR/DS