Answer:
a=4 , b=1
Explanation:
I'm not a computer science major at all but I think I can help you with this code.
Our program wants us to add 2 to a get new a value while also subtracting 1 from b value to obtain new b value. We we want to for for as long b is not 0 and a/b is nonnegative.
One round we get:
New a=0+2=2
New b=3-1=2
Let's see if we can go another round:
New a=2+2=4
New b=2-1=1
We can't go another round because b would be negative while a is positive which would make a/b negative. So our loop stops at this 2nd round.
a=4 , b=1
Other notes:
2nd choice makes no sense because a is always going to increase because of the addition on a and b was going to decrease because of the subtraction on it.
Third choice makes no sense because a/b doesn't even exist.
Fourth choice a/b is negative not nonnegative.
Icon need to use 20 characters <span />
Answer:
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.
