There are 10 dice having 5 faces. The faces are numbere - Practice (English)

Loading practice questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Practice library for exams, subjects, and daily revision. For learning purposes only.

There are 10 dice having 5 faces. The faces are numbere - Practice (English) | ObjectiveMcq

935 views

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?

Correct Answer: A — 0

Explanation:

Since there are 10 dice and the minimum value each die can take is 1, the minimum possible sum is 10. Hence, a sum of 4 cannot be achieved.

How many constraints does flow have?
What is the running time of Dinic's blocking flow algorithm?
Who formulated the Maximum flow problem?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
In what time can an augmenting path be found?
A simple acyclic path between source and sink which passes through only positive weighted edges is called?
Under what condition can a vertex combine and distribute flow in any manner?