1. Suppose that you want to search for a friend, ‘S’, telephone number in a phone book. List the steps taken if you use binary search. Illustrate with the list of alphabets ignored during the search by crossing them. (Example – Step 3 – Ignore letter A to C [ABCDEFGHIJKLMNOPQRSTUVWXYZ])

Question

2. In sequential search, you will have to search every page in the phone book until you find your friends’ name and phone number. What are the steps that can be taken to shorten the searching time if the name you are looking for is ‘Joe’?

Answer 1

You're getting close to spamming the board, too. Stop now!!

Go back and add YOUR OWN THOUGHTS to each of your umpteen assignments. Then a tutor might be able to help you.