UGC NET PAPER 2 June 2019 Question 68 (Shift-I)

68. Consider the following steps:
S​1​ : Characterize the structure of an optimal solution
S2​ : Computer the value of an optimal solution in bottom-up fashion
Which of the step(s) is/are common to both dynamic programming and greedy algorithms?

A Only S​1

B Only S​2

C both S​1​ and S​2

D neither S​1​ nor S​2

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 67	UGC NET CS 2018 July - II Question 69