Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following steps:
S1: 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?
1
Only S1
2
Only S2
3
both S1 and S2
4
neither S1 nor S2