UTpaper

Free mock tests & test series

Question 71Asked in DSSSB TGT Computer Science (Technical), 7 Aug 2021, Shift 2

Match the following. A. Longest common subsequence — i. Divide and conquer

Match the following. A. Longest common subsequence — i. Divide and conquer B. Huffman code — ii. Linear programming C. Quick sort — iii. Greedy algorithm D. Simplex algorithm — iv. Dynamic programming
  1. AA-iv, B-i, C-ii, D-iii
  2. BA-iii, B-ii, C-iv, D-i
  3. CA-iv, B-iii, C-i, D-ii
  4. DA-iii, B-iv, C-ii, D-i
Show answerHide answer

Correct answer: (C) A-iv, B-iii, C-i, D-ii

Explanation

LCS is solved by dynamic programming, Huffman coding by a greedy algorithm, quick sort by divide and conquer, and the simplex method is for linear programming.

From DSSSB TGT Computer Science PYQ (Technical), 7 Aug 2021, Shift 2

This is question 71 of DSSSB TGT Computer Science PYQ (Technical), 7 Aug 2021, Shift 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.