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

Exams

SSC CGL
UPSC CSE
IBPS PO
RRB NTPC
CDS

Subjects

Mathematics
Physics
General Knowledge
English
Reasoning

Resources

Current Affairs
Search MCQs
Practice Sets

Company

About Us
Contact
Privacy Policy
Terms of Use
Disclaimer
Copyright

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

ObjectiveMcq

Print Protected

Printing this content is disabled

This page is protected for print. Use the website to view the content.

There are n dice with f faces. The faces are numbered from 1 - Practice - ObjectiveMcq

HomePracticeData Structure And AlgorithmDynamic ProgrammingThere are n dice with f faces. The ...

Dynamic Programming Data Structure And AlgorithmMedium

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: D — n*f

The sum will be maximum when all the faces show a value f. The sum in this case will be n*f.

Related Practice

Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Which of the following is a sub string of "SANFOUNDRY"?
The naive pattern searching algorithm is an in place algorithm.
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the recurrence relation for the linear search recursive algorithm?
Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?