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 • 100.69K 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: 736
  • 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.

Related MCQs

Q. In IPv4, value of Maximum Transfer Unit (MTU) depends on the

Q. In ordered indices the file containing the records is sequentially ordered, a is an index whose search key also defines the se

Q. In which direction does the accelerating force acts?

Q. which command is used for copying a file

Q. HTTP client requests by establishing a __________ connection to a particular port on the server.

Q. What can be the value of m in the division method?

Q. Which of the following determine the least- squares regression line?

Q. The information on read-only chips be changed.

Q. Which is the core wrapper of GSN?

Q. Which of the following attribute of implicit cursor always evaluates to false?


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Download

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
  • UC Quiz
  • 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
  • Get the source code

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger