Data Structure Questions and Answers-Dice Throw Problem

DOWNLOAD FREE PDF <<CLICK HERE>>

Data Structure Questions and Answers-Dice Throw Problem

Congratulations - you have completed Data Structure Questions and Answers-Dice Throw Problem.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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
All of the mentioned
Question 1 Explanation: 
All of the mentioned methods can be used to solve the dice throw problem.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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?
A
n*n*n...f times
B
f*f*f...n times
C
n*n*n...n times
D
f*f*f...f times
Question 2 Explanation: 
Each die can take f values and there are n dice. So, the total number of permutations is f*f*f...n times.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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?
A
27
B
36
C
216
D
81
Question 3 Explanation: 
The total number of permutations that can be obtained is 6 * 6 * 6 = 216.

Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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?
A
0
B
1
C
2
D
3
Question 4 Explanation: 
The sum of 11 can be achieved when the dice show {6, 5} or {5, 6}.

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
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?
A
1
B
f
C
n
D
none of the mentioned
Question 5 Explanation: 
The sum will be minimum when all the faces show a value 1. The sum in this case will be n.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>