DSA quiz

Vasu can cover a certain distance in 1 hr. 24 min. by covering two-third of the distance at 4 kmph and the rest at 5 kmph. Find the total distance.

• 3 km

• 4 km

• 5 km

• 6 km

What is the time complexity of this code

int a = 0, i = N;

while (i > 0)

{

a += i;

i /= 2;

}

• O(N)

• O(Sqrt(N))

• O(N / 2)

• O(log N)

A monkey🐒 climbing up a pole ascends 6 meters and slips 3 meters in alternate minutes.

If the pole💈 is 60 meters high,

how long will it take the monkey to reach the top?

• 31 min

• 33 min

• 35 min

• 37 min

3. An array with 32 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?​

• 32

• 8

• 16

• 5

What is the result of the following postfix expression?

ab*cd*+ where a=2,b=2,c=3,d=4.

• a) 16

• b) 12

• c) 14

• d) 10

In a recursive solution to the Towers of Hanoi problem, what is the minimum number of moves required to solve the puzzle for n disks?

• N²

• N!

• 4 km/hr

• 5 km/hr

• 6 km/hr

Which of the following is a self-balancing binary search tree?

• 
  Binary Search Tree (BST)

• AVL Tree

• Binary Heap

• Ternary Search Tree

If you have a circular linked list, how can you detect a cycle in O(n) time and O(1) space?

• Use a hash table to store visited nodes

• Use two pointers, moving one at normal speed and one at double speed

• Use depth-first search
  

• Count the number of nodes

A 160 meter long train🚂 crosses a 160 meter long platform in 16 seconds.

Find the speed of the train.

• 62 km/hr

• 72 km/hr

• 82 km/hr

• 92 km/hr