Data Structure Dice Throw Problem Online Exam Quiz
Data Structure Dice Throw Problem GK Quiz. Question and Answers related to Data Structure Dice Throw Problem. MCQ (Multiple Choice Questions with answers about Data Structure Dice Throw Problem
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?
Options
A : 0
B : 1
C : 2
D : 3
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?
Options
A : 0
B : 2
C : 4
D : 8
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?
Options
A : 1
B : f
C : n
D : n*f
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?
Options
A : 1
B : f*f
C : n*n
D : n*f
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?
Options
A : 27
B : 36
C : 216
D : 81
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?
Options
A : Brute force
B : Recursion
C : Dynamic programming
D : Brute force, Recursion and Dynamic Programming
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?
Options
A : n*n*n…f times
B : f*f*f…n times
C : n*n*n…n times
D : f*f*f…f times
Data Structure Adjacency List more Online Exam Quiz
Data Structure Circular Linked Lists
Data Structure Coin Change Problem
Data Structure Counting Boolean Parenthesizations
Data Structure Depth First Search
Data Structure Direct Addressing Tables
Data Structure Directed Acyclic Graph