Vidyalelo
Data Structure · Q115

Dynamic Programming in Data Structures

Programming · Data Structure · question 115

Q115

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
Answer
D.
3

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board