CUET-PG SERIES Data-science-a-i-cyber-security-and-computer-sci
Programming And Data Structures
5 previous year questions.
Volume: 5 Ques
Yield: Medium
High-Yield Trend
5
2024 Chapter Questions 5 MCQs
01
PYQ 2024
hard
data-science-a-i-cyber-security-and-computer-sci ID: cuet-pg-
Match List I with List II
Choose the correct answer from the options given below:
| LIST I | LIST II |
|---|---|
| (A) Circular Linked List | (I) Recursive Function Calls |
| (B) Doubly Linked List | (II) Round Robin Queue in CPU |
| (C) Stack | (III) Hash Tables |
| (D) Singly Linked List | (IV) Undo and Redo Functionality |
1
(A) - (I), (B) - (II), (C) - (III), (D) - (IV)
2
(A) - (II), (B) - (III), (C) - (IV), (D) - (I)
3
(A) - (II), (B) - (IV), (C) - (I), (D) - (III)
4
(A) - (III), (B) - (II), (C) - (I), (D) - (IV)
02
PYQ 2024
medium
data-science-a-i-cyber-security-and-computer-sci ID: cuet-pg-
A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?
1
6
2
2
3
4
4
0
03
PYQ 2024
medium
data-science-a-i-cyber-security-and-computer-sci ID: cuet-pg-
Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below:
1
S1 is true but S2 is false
2
Both S1 and S2 are false
3
Both S1 and S2 are true
4
S2 is true but S1 is false
04
PYQ 2024
medium
data-science-a-i-cyber-security-and-computer-sci ID: cuet-pg-
The worst-case time complexity of inserting a node in a doubly linked list is:
1
O(n log n)
2
O(log n)
3
O(n)
4
O(1)
05
PYQ 2024
medium
data-science-a-i-cyber-security-and-computer-sci ID: cuet-pg-
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below:
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below:
1
(B), (D), (E), (A), (C)
2
(B), (D), (A), (E), (C)
3
(A), (D), (B), (C), (E)
4
(E), (D), (C), (A), (B)