Benny New Computing Portfolio

5.03 Search Algorithms

5.3 Search Algorithms Curriculum Page

Questions for the Classroom Activity

(POGIL) Define a pseudocode algorithm that will efficiently play the guessing game.
1. Answer

Ask the range of numbers
Make your first guess the range of numbers divided by 2
Ask for low or high feedback
If the number is low, remove the bottom half of the list from he range
If the number is high, remove the top half of the list from he range
Establish the new range based on the high or low feedback
Repeat steps 2-6 until number is guessed

(POGIL) To guess a number between 1 and 100, what's the maximum number of guesses your algorithm would take?
1. Answer

7 guesses

(POGIL) To guess a number between 1 and 500, what's the maximum number of guesses your algorithm would take?
1. Answer

9 guesses

Suppose you have a deck of cards and you want to find the Ace of Spades. If the deck is shuffled, which is the best search algorithm to use and why?
1. Answer

Sequential because for binary it would be hard to track what cards you have checked and would get lost.

Give an example of a search problem you encounter in everyday life. Do it use sequential, binary, or some other search?
1. Answer

One search problem that

Page updated

Google Sites

Report abuse