Question: 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

Click to view Correct Answer

Next

Data Structure Dice Throw Problem more questions

What is the maximum number of children that a binary....

What is the range of maximum permissible resistance in a....

What will be the chromatic number for a tree having....

What will be the chromatic number for an bipartite graph....

Which of the number is not allowed in Binary representation....

If chromatic number of a line graph is 4 then....

Entropy of a random variable is

The self information of random variable is

What will be the chromatic number for a complete graph....

The mean of the spatial partial derivative of a flow....

Data Structure Adjacency List more Online Exam Quiz

Data Structure Cartesian Tree

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

Data Structure Directed Graph

Data Structure Double Ended Queue

Data Structure Doubly Linked Lists