LawMint Sign in

Jammu & Kashmir and Ladakh SET (JKSET/LASET) Data Structures and Algorithms Previous Year Questions

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

Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.

Question 1

The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post order traversal of this tree is:

Select one answer

Question 2

A single array A[1…MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (top1 < top2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is :

Select one answer

Question 3

In a B tree of order four each node has at most __________ keys.

Select one answer

Question 4

Consider the following statements:
(I) First-in-first-out types of computations are efficiently supported by STACKS.
(II) Implementing LISTS on linked list is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
(III) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
(IV) Last-in-first-out type of computations are efficiently supported by QUEUES.
Which of the following is correct?

Select one answer

Question 5

Which one of the following data structures is useful in traversing a graph using breadth first technique?

Select one answer

Question 6

What is the value of following recurrence?
T(n) = T(n/4) + T(n/2) + cn2
T(1) = c
T(0) = 0
Where c is a positive constant

Select one answer

Question 7

The following sequence of operations is performed on stack:
PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP
The sequence of values popped out is:

Select one answer

Question 8

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 and 56 into a table indexed from 0 to 6. 11 will be stored in the location :

Select one answer

Question 9

The worst case complexity of quick sort to sort any n numbers is :

Select one answer

Question 10

After partitioning an array with n elements in quick sort, how many elements will be in the correct position?

Select one answer

Continue practising

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.

Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.