M

Mr. Dubey • 102.44K 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. What type of compression allows you to reconstruct the original data?

Q. what is the run level for shut down and reboot respectively

Q. What is the best case and worst case complexity of ordered linear search?

Q. Which one of the following is a step of controlling?

Q. What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer

Q. specification defining the PHY and MAC layer of low power devices.

Q. The relation R defined on the set of natural numbers as {(a, b): a differs from b by 3} is given

Q. If 'a' is the integer which is not statically initialized then what is the value of 'a'?

Q. Security methods such as private encryption, VLANs and firewalls comes under __________ subject area.

Q. What is meant by the power set of a set?

Question analytics