GATE CS 2017 (Forenoon) — Question 5

AlgorithmsGreedy Approach & Divide-and-Conquer DesignsMCQ1 mark · −1/3 if wrongEasy

Consider the following table:
Question image
Match the algorithms to the design paradigms they are based on.
  1. A
    (P) \(\leftrightarrow\) (ii), (Q) \(\leftrightarrow\) (iii), (R) \(\leftrightarrow\) (i)
  2. B
    (P) \(\leftrightarrow\) (iii), (Q) \(\leftrightarrow\) (i), (R) \(\leftrightarrow\) (ii)
  3. C
    (P) \(\leftrightarrow\) (ii), (Q) \(\leftrightarrow\) (i), (R) \(\leftrightarrow\) (iii)
  4. D
    (P) \(\leftrightarrow\) (i), (Q) \(\leftrightarrow\) (ii), (R) \(\leftrightarrow\) (iii)
Practise the full 2017-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Greedy Approach & Divide-and-Conquer DesignsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group