1.
Which of the following lines should be added to complete the above code?
A
arr[num_of_dice][S]
B
arr[dice][sm]
C
arr[dice][S]
D
arr[S][dice]
Loading practice questions
8 practice sets · Page 1 of 1
Which of the following lines should be added to complete the above code?
arr[num_of_dice][S]
arr[dice][sm]
arr[dice][S]
arr[S][dice]
There are 10 dice having 5 faces. The faces are numbered from 1 to 5. What is the number of ways in which a sum of 4 can be achieved?
0
2
4
8
There are n dice with f faces. The faces are numbered from 1 to f. What is the maximum possible sum that can be obtained when the n dice are rolled together?
1
f*f
n*n
n*f
There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?
1
f
n
n*f
You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?
0
1
2
3
You have 3 dice each having 6 faces. What is the number of permutations that can be obtained when you roll the 3 dice together?
27
36
216
81
You have n dice each having f faces. What is the number of permutations that can be obtained when you roll the n dice together?
nnn...f times
fff...n times
nnn...n times
fff...f times
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?
Brute force
Recursion
Dynamic programming
Brute force, Recursion and Dynamic Programming