Madhya Pradesh SET (MP SET) Data Structures and Algorithms Previous Year Questions
Try the preview and open any solution for a worked explanation.
Madhya Pradesh SET (MP SET) practice pack
The practice pack for Madhya Pradesh SET (MP SET) is coming soon to LawMint.
Question 1
In a positive weighted undirected graph G(V, E), where E and V denote the number of edges and vertices in the graph, what would be the time-complexity to find the shortest path from a single source to all other vertices using Dijkstra's algorithm implemented using the binary heap (for priority queue implementation) data structure ?
Question 2
for i = 1 to n
for j = 1 to (n− i) + 1
The loop will run for __________ times.
Question 3
for i = 1 to n
for j = 1 to i
This defines :
Question 4
Structural relationship between data items is called :
Question 5
Which notation provides a strict upper bound for ?
Question 6
Performance measurement is concerned with obtaining the space and time requirements of a particular program. These quantities depend on which of the following ?
(i) Compiler
(ii) Options used
(iii) Computer on which the program is run
(iv) Programming languages used
Question 7
O-notation for the function is :
Question 8
In which of the following hash functions, do consecutive keys map to consecutive hash values ?
Question 9
B-tree are balanced search trees specifically designed to be stored on magnetic disks. Which of the following are true about B-tree ?
(i) B-tree are designed to work on direct access secondary storage devices.
(ii) B-tree are similar to red-black trees but they are better at maximizing disk I/O operation.
(iii) B-tree differ from red-black trees in that B-tree nodes may have many children.
(iv) Many database systems use B-tree.
Question 10
The result of evaluating the expression
4 * 2 + 8 / 2 ↑ 2 − 16 ↑ 4
is :
Previous papers with Data Structures and Algorithms questions
Madhya Pradesh SET (MP SET) practice pack
The practice pack for Madhya Pradesh SET (MP SET) is coming soon to LawMint.