ADA Algorithm MCQ Quiz (Multiple Choice Questions And Answers)
Are you preparing for the next job interviews? If yes, trust me this post will help you also we'll suggest you check out a big collection for Programming Full Forms that may help you in your interview:
List of Programming Full Forms
Let T(n) be a function defined by the recurrence T(n) = 2T(n/2) + √n for n ≥ 2 and T(1) = 1
- T(n) = ?(log n)
- T(n) = ?(vn)
- T(n) = ?(n)
- T(n) = ?(n log n)
- T(n log n), T(n log n) and T(n2)
- T(n2), T(n2) and T(n Log n)
- T(n2), T(n log n) and T(n log n)
- T(n2), T(n log n) and T(n2)
- If, It can be reduced to the 3-SAT problem in polynomial time
- The 3-SAT problem can be reduced to it in polynomial time
- It can be reduced to any other problem in NP in polynomial time
- some problem in NP can be reduced to it in polynomial time
19. Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?
- Dynamic programming
- Backtracking
- Greedy
- Divide and Conquer
- Divide and conquer paradigm
- Backtracking paradigm
- Greedy Approach
- Divide and Conquer paradigm
