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?

Mr. Dubey • 52.26K Points
Coach

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

(A) 1

(B) f

(D) n*f

Correct : Option (C)

Explanation:

 the sum will be minimum when all the faces show a value 1. the sum in this case will be n.

Discusssion

Q. In distributed system, each processor has its own

Q. Bluetooth supports

Q. Select distinct Dept_name from instructor ; How many row(s) are displayed ?

Q. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.

Q. A_________model identifies patterns or relationships.

Q. ASP.NET separates the HTML output from program logic using a feature named as

Q. adopts a dictionary-oriented approach, associating to each category label a progressive integer number.

Q. _______ clustering technique start with as many clusters as there are records, with each cluster having only one record.

Q. Prisonner’s dilemma can be related to the following:

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

Discusssion

Related MCQs