Q130
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board