GURU NANAK INSTITUTE OF TECHNOLOGY

(A UGC Autonomous Institution – Affiliated to JNTUH)

Ibrahimpatnam, Ranga Reddy (District) - 501 506.

AY: 2024-25 Regulation: R22

Branch: CSE/IT /AIDS/AIML/CSC Year–Semester: II-I

Subject name: Data Structures Subject code: 22PC0CS01

QUESTION BANK
Part –A:

1 Mark Questions:
Bloom’s
CO
Unit No Q.No Question Taxonomy
Mapped
Level
1 What is the advantage of linked list over arrays? CO1 L1
2 What is the difference between stack and queue? CO1 L1
3 Define data structure and its types. CO1 L1
Mention various operations that can be performed on data CO1 L1
4 structure?
Write the difference between single linked list and double CO1 L1
5 linked list?
Unit 1
6 List any two differences between array and linked list? CO1 L1
7 How will we identify the first and last node of a linked list? CO1 L1
8 Evaluate the post-fix expression 3 4 * 2 5* + CO1 L1
What is the difference between linear and non-linear data CO1 L1
9 structure?
10 Define structure and write the syntax. CO1 L1
1 Define skip list. CO2 L1
2 List various operations performed in a dictionary? CO2 L1
3 Write any two advantages of rehashing? CO2 L1
4 What are the various open addressing methods available? CO2 L1
5 Define collision with an example. CO2 L1
Unit 2 What are the hash functions t hat are used in linear probing CO2 L1
6 and quadraticprobing?
7 What is the difference between chaining and linear probing? CO2 L1
If the hash table size is n, then what is the maximum number of CO2 L1
8 collisions that can occur?
 9 State the significance of hashing function CO2 L1
10 Define mid-square method with hash table size 100. CO2 L1
Unit 3 1 What are the properties of binary search trees? CO3 L1
What is the difference between full binary tree and complete CO3 L1
2 binary tree?
3 List any three applications of binary search trees. CO3 L1
4 List various types of rotations in AVL tree. CO3 L1
5 Write the difference between binary tree and binary search tree? CO3 L1
What is the maximum number of nodes in an AVL tree of a CO3 L1
6 given height?
What is the pre-order, in-order and post-order sequence we CO3 L1
7 use in abinary search tree?
8 What are the rotations in splay trees called as? CO3 L1
9 Define splaying with an example. CO3 L1
10 Write any two disadvantages of binary search trees? CO3 L1
What is the difference between adjacency list and adjacency CO4 L1
1 matrix?
2 Define DFS with an example. CO4 L1
3 Define min-heap and max-heap with an example each. CO4 L1
4 Distinguish between tree and graph. CO4 L1
5 Define BFS with an example. CO4 L1
Unit 4 6 What is the difference between DFS and BFS traversal methods? CO4 L1
7 What do you mean by connected and disconnected graphs? CO4 L1
What is the worst-case time complexity of merge sort and heap CO4 L1
8 sort?
What do you mean by complete graph and how do you represent CO4 L1
9 it?
10 What is degree and order of a node in a graph? CO4 L1
1 What is the disadvantage of Brute force method. CO5 L1
What is the time complexity of Brute force algorithm in CO5 L1
2 pattern matching.
3 Draw the standard trie for the word SUCCESS using prefixes. CO5 L1
4 What is the time complexity of searching a character in a trie? CO5 L1
5 What is Longest proper Prefix which is also Suffix (LPS) Table? CO5 L1
Unit 5 6 Find out the LPS table for the pattern (P)=ABCDABD CO5 L1
What is the time complexity of Knuth-Morris Pratt (KMP) CO5 L1
7 algorithm?
8 Define Tries in pattern matching. CO5 L1
9 Write down the properties of Tries. CO5 L1
Draw the standard tries for CAT, BAT, BALL, RAT, CAP & CO5 L1
10 BE
Part –B:

10 Marks Questions:
Bloom’s
CO
Unit No Q.No Question Taxonomy
Mapped
Level
Design an algorithm that efficiently performs CO1
1 insertion and deletion operations on a queue data L2
Unit 1 structure.
Explain with clear illustration to insert the element 25 at the CO1 L3
2 end of a singly linkedlist with node values 2-> 10-> 18.
 Illustrate with clear steps to delete the element 4 from the CO1 L3
3 beginning of a singlylinked list with node values :
4->8-> 15->20.
Discuss push and pop operations in stack data structure using CO1 L3
4 array with the given elements: 10 25 20 18
Write short notes on the applications of the following data CO1 L2
5 structures:
a. Stack b.Queue c.Linked Lists
What are the advantages and disadvantages of linked lists when CO1 L2
6 compared with arrays.
Write down your name as a string. Insert all the characters of CO1
your nameinto an empty stack. Start popping out all the
characters of your name from the stack. For each vowel you L2
7 pop out from the top of the stack and insert the vowel in a
queue. Repeat this procedure
till the stack is completely empty. Print the content of the queue
after theentire process is done.
Discuss the various types of linked lists and provide suitable CO1 L2
8 examples for each type
Convert the given infix to postfix expression using stacks CO1 L2
9
(A+B)*(C-D)
Describe in detail the queue data structure implemented using a CO1 L2
10 linked list and provide an example to illustrate your
explanation
Explain any three different collision handling techniques in CO2 L2
1 hashing and provide an example for each?
What is hash function? Outline different hash functions with CO2 L2
2 suitable examples.
Given the input 4371, 1323, 6173, 4199, 4344, 9679, 1989 and a CO2
3 hash function of h(k)=k mod 9. Create a hash table using L3
separate chaining method.
Discuss various merits and demerits of various collision CO2
4 resolution techniques L2
The elements 37 ,90, 55, 22, 17, 49, 87 are inserted into an CO2
empty hash table of size 10. Create the hash table and count the L3
5 maximum number ofcollisions when the method used is
quadratic probing. (h(k) = k mod 10)
Unit 2 CO2
The elements 4,1,5,12,7,32,16,13,10,21,19,15,20, are inserted
6 into an empty Bucket (Bucket size 4). Find out the maximum L3
local depth andglobal depth using Extendible Hashing.
Build skip list for given list of elements 3, 7, 2, 9, 6, 10, 25, CO2 L3
7 15, 20, 50and search for elements 2, 25, 9. Illustrate using a
diagram.
Describe hashing? Discuss different types of collision CO2 L2
8 resolution technique with example for each.
a) Discuss dictionary representations with relevant examples. CO2
9 L2
b) Discuss the importance of Rehashing with an example.
The elements 16,38,49,44,13,11,78 is inserted into an empty CO2
10 hash table ofsize 7. Create the hash table when the method L3
used is Rehashing. (h(key) = key mod tablesize)
Write the recursive procedures for performing pre-order, in- CO3 L2
1 order, and post-order traversals of a binary tree.
Create a binary search tree with node values CO3
Unit 3 2 59,28,18,67,60,38,80,30,90,75 and find out the pre-order, L3
in-order and post-order.
Draw the binary search tree and find out the pre-order sequence CO3
3 when the in-order sequence is 10,11,12,13,16,18,19,20,21,25 L3
 and the post-ordersequence is 10,12,11,18,16,20,25,21,19,13.
Construct an AVL tree for the given node values CO3
4 50,20,60,10,8,15,32,46,11,48 and also write the steps to L3
insert into an empty AVL tree.
Create a red-black tree with the given node values CO3 L3
5 10,18,7,15,16,30,25
Create a splay tree with node values CO3 L3
6 12,46,21,9,13,17,4,20,19,52 andsearch for 21, 4 and 52.
List the rules followed when nodes are inserted in a red-black CO3
7 tree? Give an example. L2
What is the need of splay trees? Discuss how splay rotations CO3 L2
8 are performed with neat illustrations.
Create a binary search tree with node values CO3 L3
9 62,96,11,39,45,83,21 andinsert the nodes 8, 85, and 42.
For the following nodes 30,20,10,40,50,60,25 create an AVL CO3 L3
10 tree. Writedown the steps of insertion.
Construct adjacency list and adjacency matrix for the CO4
following graph.Consider A as the starting node. L3

Construct adjacency matrix of the following graph. Then CO4

find out theDFS sequence using stack. Consider A as the L3
starting node.

Unit 4 2

Sort the list of elements 10, 25, 32, 12, 5, 46, 89, 23, 45 using CO4
3 the min-heap algorithm and the heapify function L3
a) Write the algorithm to implement merge sort technique. CO4
4 b) Sort the following list of elements using merge sort L3
algorithm 10, 25,32, 12, 5, 46, 89, 23, 45.
Design the algorithms for Breadth- First Search (BFS) and CO4 L2
5 explain the situations in which each graph traversal method is
most suitable.
Construct adjacency matrix of the following graph. Then CO4 L3
6 find out theBFS sequence using queue. Consider 0 as the
starting node.
 Create a max heap using the heapify CO4 L3
7 function for the following node values: 19,
17, 21, 15, 18, 20, 25, 13, 16
Find out the BFS and DFS sequence for the following graph. CO4 L3

9 Design the algorithms for Depth-First Search (DFS) and explain

the situations in which each graphtraversal method is most suitable.
Create a max heap for the following node values CO4 L3
10 5,17,10,6,3,14,23,9,12 using heapify function.
1 Write the Brute force algorithm with suitable example. CO5 L2
Construct the match and mismatch matrix for the following CO5
by bruteforce algorithm and find the maximum number of L3
2 comparisons.
Text (T) = THIS IS A SIMPLE EXAMPLE
Pattern (P) = SIMPLE
Explain bad character Heuristic strategy of Boyer Moore CO5 L2
3 algorithm for
pattern matching with suitable example.
Construct the match and mismatch matrix for the following CO5
by BoyerMoore algorithm and find the maximum number of L3
4 comparisons.
Text (T) = THISISACOMPLEXEXAMPLE
Unit 5 Pattern (P) = PLEXE
Write down the algorithm steps to create LPS table (Prefix CO5 L2
5 table) in KMPalgorithm with example.
Solve by Knuth-Morris Pratt (KMP) pattern CO5
matching.Text (T) = ABC ABCDAB L3
6
ABCDABCDABDE
Pattern (P) = ABCDABD
Construct a Standard Tries for the set of strings S= {bear, bell, CO5 L3
7 bid, bull,buy, sell, stock, stop} and explain.
Construct a Compressed Tries for the set of strings S= {bear, CO5
8 L3
bell, bid,bull, buy, sell, stock, stop} and explain.
9 Explain Suffix Trie with suitable example CO5 L2
10 Discuss compact representation of the suffix tries. CO5 L2