Time Left - 10:00 mins

Campus Recruitment Tech Quiz- 27

Attempt now to get your rank among 212 students!

Question 1

What are the appropriate data structures for graph traversal using Breadth First Search (BFS) and Depth First Search (DFS) algorithms?

Question 2

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are

Question 3

What will be the output of the following C program?

Question 4

What value must a C++ destructor return?

Question 5

The output of following C-Code is-

int main()

{

int num = 2;

switch (num + 2)

{

case 1: printf("Case 1: ");

case 2: printf("Case 2: ");

case 3: printf("Case 3: ");

default: printf("Default: ");

}

return 0;

}

  • 212 attempts
  • 3 upvotes
  • 10 comments
Jun 18GATE & PSU CS