M

Mr. Dubey • 100.69K Points
Coach

Q. You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?

  • (A) brute force
  • (B) recursion
  • (C) dynamic programming
  • (D) brute force, recursion and dynamic programming
Share
Explanation by: Mr. Dubey
brute force, recursion and dynamic programming can be used to solve the dice throw problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. In a binary search tree, which of the following traversals would print the numbers in the ascending order?

Q. Tuples are generated in producer-driven pipelining, they are generated on demand, in demand- driven pipelining

Q. A is a special kind of a store procedure that executes in response to certain action on the table like insertion, deletion or upd

Q. If the initial pulse of 1000 is fed to shift register, after how many clock pulses does the sequence repeat?

Q. What is the output when we execute list(“hello”)?

Q. Which one of the following can not be scheduled by the kernel?

Q. What is the worst case time complexity of a quick sort algorithm?

Q. A group of magnetic tapes, videos or terminals usually under the control of one master is

Q. The process of saving information onto secondary storage devices is referred to as

Q. __________describes the data contained in the data warehouse.

Question analytics