FORM NO.
- F/COE/005
Page 1 of 1
FACULTY OF E & T DEPARTMENT OF CSE
UNIVERSITY EXAMINATION – OCT/NOV-2022
FULL TIME (1)
DEGREE : B.Tech BRANCH: CSE
SUBJECT CODE: SUB.NAME: Data Structures
YEAR/SEMESTER: II / III MAX.MARKS: 50
DATE OF EXAM: DURATION: 2 Hours
PORTION: All Units
ANSWER ANY 5 QUESTIONS (5x10=50 Marks)
Sl.
No. QUESTION Units Marks CO BL
What are the different operations that can be performed on a LIST
1 1 10 CO1 L1
ADT? Explain each.
2 Explain simulating pointers in detail. 1 10 CO1 L2
Write an algorithm and simulate the conversion of infix to postfix
3 2 10
expression using stack for the given expression. CO4 L2
( A - ( B / C + ( D % E * F ) / G ) * H )
Explain the basic operations of a QUEUE using linked list with suitable
4. 2 10 CO4 L2
examples.
Write the properties of binary trees. Illustrate how binary trees are
5. 3 10 CO3 L3
represented using arrays and queues.
6. Illustrate the various operations that can be performed on 2-3 trees. 3 10 CO3 L3
7. Compare Linear search and Binary search with suitable examples. 4 10 CO2 L4
Sort the given numbers using radix sort. 345, 654, 924, 123, 567,
8. 4 10 CO2 L4
472, 555, 808 and 911. Write the procedure for radix sort.
Construct a minimum spanning tree of the graph given using Prim’s
9. algorithm. Start from vertex D. 5 10
CO5 L5
10. Explain Depth First search with a suitable example. 5 10 CO5 L2
Signature of HoD Signature of Staff
FACULTY OF E & T DEPARTMENT OF CSE
UNIVERSITY EXAMINATION – OCT/NOV-2022
FULL TIME (2)
DEGREE : B.Tech BRANCH: CSE
SUBJECT CODE: SUB.NAME: Data Structures
YEAR/SEMESTER: II / III MAX.MARKS: 50
DATE OF EXAM: DURATION: 2 Hours
PORTION: All Units
ANSWER ANY 5 QUESTIONS (5x10=50 Marks)
Sl.
No. QUESTION Units Marks CO BL
Why a sparse matrix required if we can use the simple matrix to store
1 1 10 CO1 L2
elements? Explain.
2 Write in detail about indirect addressing in data structures 1 10 CO1 L1
Simulate the conversion of infix to prefix expression using
3 2 10
stack for the given expression.
CO4 L3
2 * 3 / ( 2 – 1 ) + 5 * ( 4 - 1).
Also evaluate the converted prefix expression.
Enumerate various operations that can be performed on a
4. 2 10 CO4 L3
Circular linked list.
Discuss various operations that can be performed on Binary
5. 3 10 CO3 L4
search tree with suitable examples.
Appraise various methods involved in inserting or deleting a
6. 3 10 CO3 L4
node from an AVL tree.
7.
Insert the keys 7, 24, 18, 52, 36, 54, 11 and 23 in a chained 4 10
hash table of 9 memory locations. Use h(k) = k mod m. CO2 L5
Sort the given integers in and show the intermediate results
8. 4 10
using selection sort. 39, 9, 81, 45, 90, 27, 72, 18. Write the CO2 L5
algorithm for selection sort.
Illustrate Kruskals algorithm to find the minimum spanning tree
9. 5 10 CO5 L3
with suitable example.
10. Explain how graphs can be represented in computer memory 5 10 CO5 L2
Signature of HoD Signature of Staff
FACULTY OF E & T DEPARTMENT OF CSE
UNIVERSITY EXAMINATION – OCT/NOV-2022
FULL TIME (3)
DEGREE : B.Tech BRANCH: CSE
SUBJECT CODE: SUB.NAME: Data Structures
YEAR/SEMESTER: II / III MAX.MARKS: 50
DATE OF EXAM: DURATION: 2 Hours
PORTION: All Units
ANSWER ANY 5 QUESTIONS (5x10=50 Marks)
Sl.
No. QUESTION Units Marks CO BL
1 Elucidate how a linear list is implemented using arrays and linked list 1 10 CO1 L2
2 Illustrate how a matrix is implemented using 2 dimensional arrays. 1 10 CO1 L2
Write an Algorithm to perform following operations on a Doubly
3 2 10
Linked list with suitable examples.
CO4 L3
i) Insert before a given node
ii) Forward and Backward Traversal
Explain the basic operations of STACK using linked list with
4. 2 10 CO4 L2
algorithms
Define AVL Trees. What is balance factor in AVL trees? Insert
5. 3 10
the following nodes into an empty AVL tree. 63, 9, 19, 27, 18, CO3 L4
108, 99, 81.
Write the routine for binary tree traversals. For the given tree
6. 3 10
give the in-order, pre order and post order traversal.
CO3 L3
Demonstrate the steps involved in searching an element using
7. 4 10 CO2 L5
binary search.
Illustrate with example the open addressing and chaining
8. 4 10 CO2 L3
methods of collision resolution methods in hashing.
i) Define Minimum Spanning Tree (MST).
9.
ii) For the given graph, use Kruskal’s algorithm to determine the
MST.
iii) Evaluate the cost of MST.
5 10 CO5 L5
10. Explain Breadth First Search with suitable example. 5 10 CO5 L2
Signature of HoD Signature of Staff
