DHIRAJLAL GANDHI COLLEGE OF TECHNOLOGY,

12 (a) Consider the following stack values to perform push

SALEM operation 10,20,30,40,50,60,70 into the dynamically
Department of Computer Science and Engineering allocated memory cell and pop out 2 values from the BTL1 CO2
memory. Write the routine for both the push and pop
Year/Sem/ II/ III/ A&B&C
Time 3 hours operation. (OR)
Sec 12 (b) i) Describe in detail about prim’s algorithm with an
Max.Marks 100 Date 15.11.2024(AN) example. BTL1 CO4
ii) Explain Kruskal’s algorithm with an example.
MODEL EXAM - CS3301-DATA STRUCTURES
13 (a) Distinguish between B tree and B+ tree. Create a B tree of
PART-A (10X2=20) BL COs order 5 by inserting the following elements:
BTL1 CO4
Differentiate linear data structures from 3,14,7,1,8,5,11,17,13,6,23,12,20,26,4,16,18,24,25 and 19.
1 BTL6 CO1 (OR)
nonlinear data structures.
What is ADT? List out the applications of 13(b) Write the following routines to implement the binary search
2 BTL2 CO1 tree operations.
data structures. BTL1 CO3
Define stack. Mention the applications of i)Perform search operation in BST
3 BTL2 CO3 ii)Find_min and Find_max
stack.
Define binary tree. Give the node structure 14 (a) Distinguish between Breadth First Search and Depth First
BTL6 CO4
4 BTL1 CO3 Search and illustrate with example.(OR)
for binary tree.
14 (b) State and explain topological sort with suitable example. BTL6 CO4
Write the postfix and prefix forms of the 15 (a) i)Sort an element using shell sort. Give appropriate
5 expression. BTL6 CO4 algorithm for shell sort. BTL6 CO5
A+B*(C-D)/(P-R) ii)Explain open addressing in detail. (OR)
6 Write short notes on Bi-Connectivity. BTL6 CO4 15 (b) i)Distinguish between linear search and binary search. State
Define i) Graph ii) Indegree and out and explain the algorithms for both the search with
BTL1 CO5
7 BTL6 CO4 example.
degree of a graph
ii)Explain Rehashing and extendible hashing.
8 What is articulation point? BTL2 CO4 PART-C (1X15=15)
What are the advantage and disadvantage 16 (a) i)Find out the inorder, postorder and preorder traversals of
9 BTL6 CO4
of separate chaining and linear probing? the following tree.
State the complexity of binary search and
10 BTL2 CO4
linear search.
PART-B (5X13=65) BTL6 CO3
i)State the polynomial representation for
6x3+9x2+7x+1 using linked list. Write
procedure to add two polynomial and ii) Perform Merge sort and explain with its algorithm.
explain with suitable example. 2,6,5,4,8,9,1,77,89,1,44(OR)
11(a) BTL1 CO1
ii)What are the ways to insert a node in 16 (b) i) Write the algorithm for selection sort with a following
linked list? Write an algorithm for inserting example.
a node before a given node in a linked list. 3,7,6,5,9,66,22,25,78,90,21,65 BTL6 CO4
(OR) ii)Explain the algorithm for insertion sort with an suitable
example.
i)What are the various operations of
doubly linked list? Explain it.
11(b) BTL6 CO1
ii)Write a procedure to deleting the last
node from a circularly linked list.
Course Coordinator ModuleCoordinator HOD-CSE