0 0 votes Consider the following statements, which of the statement(s) is/are FALSE? The running time of dynamic programming algorithm is always θ (p) where p is number of subproblems When a recurrence relation has cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program For a dynamic programming algorithm computing all values in a bottom up fashion is asymptotically faster than using recursion and memorization If a problem X can be reduced to a known NP hard problem, then X must be NP-hard Algorithms algorithms dynamic-programming testbook-test-series + – Sahil_Lather 779 views answer comment Share Follow Print See 1 comment 1 1 comment reply Sahil_Lather commented Jan 28, 2023 reply Follow flag I didn’t get option 2. 0 0 replyShare Please log in or register to add a comment.
