Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 146: 35c

Answer

$0.4096$ seconds

Work Step by Step

There are 4096 paths so the time required to check them all will be $time = number\space of\space paths \times time\space for\space each\space path$ $time = 4096 \times 0.0001 = 0.4096$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.