Quiz Round For Group 2

Which algorithmic technique does Fibonacci search use? 

• Brute force 

• Divide and Conquer 

• Greedy Technique 

• Backtracking  

What is the auxiliary space complexity of standard merge sort? 

• O(1)

• O(log n) 

• O(n) 

• O(n log n)  

What is the time complexity of DFS for a graph with (V) vertices and (E) edges? 

• O(V + E) 

• O(V) 

• O(E) 

• O(V*E) 

What is the output of the following C code?  

• 0

• Compile-time error 

• 1

• 8

What is the problem in these declarations?  

int func(int);   
double func(int);   
int func(float);   
  

• Functions with the same name cannot have different signatures 

• Functions with the same name cannot have different return types 

• Functions with the same name cannot have different parameters 

• All of the above  

A two-digit number has digits summing to 12. When reversed, it becomes 18 less than the original. What is the number? 

• 57

• 75

• 84

• 93

What is the output for the linked list 1->2->3->4->5->6 with the given function? 

• 1 4 6 6 4 1 

• 1 3 5 5 3 1 

• 1 2 3 5 4 

• 1 3 5 1 3 5  

The optimal data structure to solve Tower of Hanoi iteratively is: 

• Tree

• Heap 

• Priority queue 

• Stack  

What is the maximum number of edges in a bipartite graph with 10 vertices? 

• 24

• 21

• 25

• 16

Which approach efficiently solves the Longest Valid Parentheses problem? 

• Stack tracking indices 

• Two-pointer scans 

• Dynamic programming 

• All of the above