MCQ Buddy
Search here...
Home MCQ Feed Add Question Programming Portal English Portal Login
  1. Home
  2. Engineering
  3. Design and Analysis of Algorithms
  4. Question

M

Mr. Dubey • 82.50K Points
Coach

Q. Minimum time required to solve tower of hanoi puzzle with 4 disks assuming one move takes 2 seconds, will be                      

(A) 15 seconds
(B) 30 seconds
(C) 16 seconds
(D) 32 seconds
  • Correct Answer - Option(B)
  • Views: 719
  • Filed under category Design and Analysis of Algorithms
Share

Explanation by: Mr. Dubey
 number of moves = 24-1=16- 1=15

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The active data warehouse architecture includes _________.

Q. The algorithm terminates in _____ steps

Q. Which of the following is FALSE?

Q. In IBM’s S360/370 systems lines are used to select the I/O devices.

Q. What represent a correspondence between the various data elements?

Q. Who developed SEQUEL?

Q. Let A and B be two sets in the same universal set. Then A – B =

Q. what is the use of exec command

Q. A human resource manager attending a local Society for Human Resource Management meeting would be functioning in which of the following role?

Q. Which of the following is not the state that the transaction undergoes?


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Share in MCQ Buddy Groups

Share
Embed
Important Links
  • Browse All Categories
  • Subjects
  • Exams
  • Mock Test
  • Advance Search
  • Quiz
  • Duo Test
  • English Topics
Explore More Portals
  • Hindi
  • State wise Portals
  • MCQ Buddy Lab
  • Engineering
  • Programming Portal
  • MB Shorts
  • NCERT Portal
  • Faculties Portal
  • Groups
  • Q & A
  • Spaces
  • Satya Sanatan
  • Keycrypt
Who we are?

We are nothing if we are alone. But we have a huge community of students who are helping you getting good study stuff free.

More Links
  • Download App
  • Advertise with us
  • Contact us
  • Youtube
  • Terms & Conditions
  • Refund Policy
  • Privacy Policy

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger