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

Options

A : 1

B : f*f

C : n*n

D : n*f

Click to view Correct Answer

Previous || Next

Data Structure Dice Throw Problem more questions

What is the basicity of oleum?

Find the magnetic field when a circular conductor of very....

According to boolean law: A + 1 = ?

The Laplace transform of a parabolic signal is _______

There are n dice with f faces. The faces are....

Dielectric constant of water is ____________

The negative feedback causes the input voltage difference to ____________

What is the multiplicity for the laplacian matrix of the....

If a reaction obeys Einstein law, quantum yield is _______

What is the multiplicity for the adjacency matrix of complete....

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