Question
Divide and conquer partition a problem into independent
smaller sub problems, whereas dynamic programming partition a problem into overlapping sub-problem.Solution
Divide & Conqure Dynamic Programming Partition a problem into independent smaller sub problems Partition a problem into overlapping smaller sub problems Doesnt store solution of sub-problems.(identical sub-problems may arisse-results in the same computations are performed repeatedly.) stores solution of sub-problems : thus avoids calculations of same quantity twice Top down alogithms : which logically progresses from the initial instance down to the smallest sub- instances. Bottom up algorithms : in which the smallest sub-problems are explicity solved first and the results of the used to construct solutions to progressively larger sub-instances.
Find the greatest number 23a68b, which is divisible by 3 but NOT divisible by 9.
The least perfect square number which is divisible by 9, 12, 15, 24:
If the number 1005x4 is completely divisible by 8, then the smallest integer in place of x will be:
Find the remainder when 413 is divided by 5.
Find the remainder obtained by dividing 961125 by 37.
If 65x is a three-digit number and it is divisible by 6, what can be the value of the digit x?
When a number is divided by 16, the quotient is 175, and the difference between the quotient and the remainder is 161. Find the number.
When a number is divided by 119, the remainder remains 15. When the same number is divided by 17, what will be the remainder?
Find the greatest number that will divide 49, 147 and 322 to leave the same remainder in each case.
If '5731x7' is a six-digit number which is divisible by 33, then calculate the value of 'x'.
