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?

Mr. Dubey • 89.33K 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

(D) brute force, recursion and dynamic programming

Correct Answer - Option(D)
Views: 733
Filed under category Design and Analysis of Algorithms

 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

Loading Comments....

Q. In a multi-rotor system of torsional vibration maximum number of nodes that can occur is:

Q. VHSIC stands for

Q. The portion of physical layer that interfaces with the media access control sublayer is called

Q. Which command is used to link the files?

Q. he ________ method provides a one-time session key for two parties.

Q. Point out the correct statement.

Q. In a get-together party, every person present shakes the hand of every other person. If there were 90 handshakes in all, how many persons were present

Q. The intent of a __________ is to overkill the targeted server’s bandwidth and other resources of the target website.

Q. To enable a secure IS infrastructure in an organisation, the following features are important:

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?

Explanation by: Mr. Dubey

Discusssion

Related MCQs

Question analytics