Firefox https://newerp.kluniversity.in/index.php?r=examsection%2Fexamqpinitia...

B.Tech - Even Sem : Semester in Exam-I

Academic Year:2020-2021
19SC1202 - DATA STRUCTURES
Set No: 7
Time: Max.Marks: 50
CO COI
S.NO Answer All Questions Choice Options Marks CO
BTL BTL
Identify the time complexity by analyzing the
choice
1. following snippet: for(int i=1; i<= n*n; i++) { for(int 4.5Marks CO1 4 2
Q-2
j=1; j<= n*m; j++) {Some O(1) instructions ; }}
The given string is “ Raja, Ram, Mohan, Roy”. Write a
2. 4.5Marks CO1 4 2
method to insert / push all the 4 strings in to the stack.
Pictorially illustrate a Circular Queue having size=5
with initial index of front =rear=-1. a)q.Cir_enqueue
(33), b) q.Cir_enqueue (24), c) q.Cir_enqueue (15),
d)q.Cir_dequeue (), e)q.Cir_enqueue (42), f)
choice
3. q.Cir_dequeue (), g) q.Cir_enqueue (78), 8Marks CO1 4 1
Q-4
h)q.Cir_dequeue (), i)q.Cir_enqueue (87), j)
q.Cir_enqueue (51), k) q.Cir_enqueue (6), l)
q.Cir_dequeue (). At every steps highlight the index of
front and rear.
In a village, at hospital vaccination center, the villagers
are standing in queue for vaccination. Implement this
4. 8Marks CO1 4 1
enqueue and dequeue operation using single linked
list.
Convert the given Infix to post fix expression: ( ( A - (
choice
5. 8 + B ) ) * 4 ) ^ ( C + D ). Also implement the method 12.5Marks CO1 4 1
Q-6
using a routine.
Write the following routine to implement 1) Create a
6. list 2) display the list and 3) Delete a node at any 12.5Marks CO1 4 3
position using Single linked list.
Find the difference between maximum and minimum choice
7. 4.5Marks CO2 4 1
element present in the DLL data structures. Q-8
Form the hash function using following steps. Step1:
Divide the key value into a number of parts. That is,
divide k into parts k1, k2, ..., kn, where each part has
the same number of digits except the last part which
may have lesser digits than the other parts. Step 2: Add
8. 4.5Marks CO2 4 1
the individual parts. That is, obtain the sum of k1 + k2
+ ... + kn. The hash value is produced by ignoring the
last carry, if any.” Now for the given hash table of size
100 , calculate the hash value using method for keys
5678 and 34567.

1 of 2 09-03-2022, 17:13
Firefox https://newerp.kluniversity.in/index.php?r=examsection%2Fexamqpinitia...

Perform a binary search operation step by step using

choice
9. following data {13,23,33,43,53,63,73,83,93}, In which 8Marks CO2 4 1
Q-10
find a key element 27 is present or NOT in the list.
Consider a hash table of size 10. Using quadratic
10. probing, insert the keys 72, 27, 36, 24, 63, 81, and 101 8Marks CO2 4 2
into the table. Use h(k) = (K+K+K) mod m.
In a hospital, during pandemic, for the maintenance of
patients, a bulk of male and female nurses are hired.
The nurses data are connected as a double linked list,.
choice
11. The data members are Nurses Id number, Nurses 12.5Marks CO2 4 2
Q-12
name, height and weight. 1) Search a particular Nurse
Id number “30123” is in the list or not 2) Write a
method to display the all nurses data.
Insert the keys 77, 34, 28, 42, 26, 44, 17, and 23 in a
12. Separate chaining hash table of size 7.Use the hash 12.5Marks CO2 4 2
function K mod m. And Implement it.
[object HTMLDivElement]

2 of 2 09-03-2022, 17:13