Design and Analysis of Algorithms MCQ: 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?

← All Design and Analysis of Algorithms questions

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?

Correct Answer: n*f

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Design and Analysis of Algorithms MCQs All Engineering topics Mock test hub