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

Question

Computers & Technology

Tobias Kidd

29 October, 10: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

+1

Answers (1)

Know the Answer?

Paxton Butler · Answer 1

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.

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-up2) Left-to-right3) Right-to-left4) Top-down