McqMate

Q. |
## 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 |

Answer» B. f*f*f…n times | |

Explanation: each die can take f values and there are n dice. so, the total number of permutations is f*f*f…n times. |

3.6k

0

Do you find this helpful?

44

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- 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?
- 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?
- 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?
- 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?
- 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 complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?