Open In App
Related Articles

GATE | GATE CS Mock 2018 | Set 2 | Question 25

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

Match the pairs in the following questions: 

List 1List 2
A. Recursion1. Sorted Array
B. Binary Seach2. Recursion
C. Sorting3 Base case
D. Dynamic Programming4.O(NlogN)
(A)

A – 2, B – 1, C – 4, D – 3

(B)

A – 3, B – 4, C – 1, D – 2

(C)

A – 3, B – 1, C – 4, D – 2

(D)

A – 2, B – 4, C – 1, D – 3



Answer: (C)

Explanation:
  • In Recursion, the Base case is the most important condition.
  • To apply Binary Search, The array must be sorted.
  • The best time complexity of any sorting algorithm is O(NLogN).
  • Every Dynamic Programming problem starts with Recursion.

Hence Option (C) is the correct answer.



Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 08 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads