Ask Question
2 January, 09:15

There are generally two ways of implementing dynamic programming solutions to problems, which have equal asymptotic time complexities. (The details of the problem may determine which is better in a given situation). What are they?

Select two:

1) Bottom-up

2) Left-to-right

3) Right-to-left

4) Top-down

+4
Answers (1)
  1. 2 January, 10:18
    0
    1) Bottom-up

    2) Top-down

    Explanation:

    In general dynamic programming is a divide and conquer strategy which can be implemented using bottom up approach or top down approach.

    Bottom-up approach in dynamic programming will solve a relatively simple sub-problem first and then use the solution to build and arrive at solutions to a bigger sub-problem.

    Top down approach is reversed to bottom-up approach and is also known as Memoization Method. Instead of solving a problem started from the base state sub-problem, the top down approach break a problem into a smaller problems from the top most destination state until it reaches the bottom most base state.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “There are generally two ways of implementing dynamic programming solutions to problems, which have equal asymptotic time complexities. (The ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers