LawMint Sign in

Rajasthan SET (RSET) Data Structures and Algorithms Previous Year Questions

Try the preview and open any solution for a worked explanation.

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Question 1

Consider an undirected graph G. Let a breadth-first traversal of G be done starting from node r. Let d(r, u) and d(r, v) be the length of the shortest path from r to u and v respectively in G. If u is visited before v during the breadth-first traversal which of the following is correct ?

Select one answer

Question 2

Which Algorithmic graph traversal model relies on a queue data structure to explore nodes layer by layer ?

Select one answer

Question 3

Which of the following algorithm(s) use the Greedy Strategy ?
a. Bellman-Ford Algorithm
b. Kruskal’s Algorithm
c. Huffman Coding
d. Dijkstra’s Algorithm

Select one answer

Question 4

Let S be a sorted array of n integers, let t(n) denote the time taken for the most efficient algorithm to determine if there are two elements with sum less than 1000 in S. Which of the following statement is true ?

Select one answer

Question 5

A Monte Carlo Algorithm :

Select one answer

Question 6

Consider the following code :

long long pow (long long x, int n)
{
    if (n==0)
        return 1;
    if (n==1)
        return x;
    if (is Even(n))
        return pow(x * x, n/2);
    else
        return pow(x * x, n/2) * x;
}
The running time of the above recursive function is :

Select one answer

Question 7

Which of the following statement(s) are true ?
a. When a hash function is used to determine the placement of element in an array, the order in which the elements are added will not affect the resulting array.
b. When hashing is used, increasing the size of the array will always reduce the number of collisions.
c. If we use bucket in hashing scheme, we will not have to worry about collision resolution.
d. If we use chaining in a hashing scheme, colliding elements are stored in a linked list at the same hash table slot.

Select one answer

Question 8

The time complexity of Depth First Search (DFS) using an adjacency list is :

Select one answer

Question 9

What is the average-case time complexity of locating an item inside a sorted array via Binary search ?

Select one answer

Question 10

Which of the following is the correct post-order traversal sequence of the following binary search tree?Binary search tree with root 11, left child 9 and right child 22; 22 has left child 19 and right child 33; 33 has right child 44; 44 has right child 56.

Select one answer

Continue practising

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.