Copy of 126 POGIL 1

.docx

School

University of Miami *

*We aren’t endorsed by this school

Course

A252

Subject

Computer Science

Date

Feb 20, 2024

Type

docx

Pages

7

Uploaded by MinisterBoulderPuppy35

Report
Team Roles Team Member Manager: reads the questions aloud, makes sure everyone contributes appropriately, and keeps track of time. Jeremiah Howard Consultant: observes team dynamics, talks with instructor and other teams, and presents conclusions to the class. Marko Tojagić Quality Assurance: guides consensus-building process, records team answers, and provides team reflection to instructor. Danny Trujillo Activity 1: Algorithms Each week, you will work in teams of 3–4 students to learn new concepts. This activity will introduce you to the process. We’ll use a simple game to explore basic searching algorithms. Model 1 Hi-Lo Game Hi-Lo is a number guessing game with simple rules, played by school children. a)  There are two players – A and B . b)  Player A thinks of a number from 1 to 100. c)  Player B guesses a number. d)  Player A responds with “too high”, “too low”, or “you win”. e)  Players B and A continue to guess and respond until B wins (or gives up).
Questions (20 min) 1. How many different answers can player A give? 1-100 2. When does the game end? When player B gives up or guesses the number 3. Play the game a few times to ensure that everyone understands the rules. 4. Create 4 or 5 different guessing strategies that Player B could use. Each strategy should describe a different approach to the game. For example: Start at 1, and count up until the correct answer is found. In computer science, we call such strategies algorithms . You can use the example for strategy (a). Come up with 3 or 4 more. Try to have a mixture of simple and clever algorithms, including ones that young children could use. a) Keep guessing from number 1 to 100 b) Start at 50 and change based on the too high or too low response c) Count From 100 to 1 d) Randomly guess around the range e) Count up from 1 in increments of 5 5. Rank order the algorithms by how fast they will find the right answer. Write 1 for the fastest algorithm (fewest guesses) and 5 for the slowest one (most guesses). 5. A 4.C 3.E 2.D. 1.B 6. Rank order the algorithms by how easy they are to describe. (Suppose you had to explain them to a first grader so that they could play the game.) Write 1 for the algorithm that is easiest to describe and 5 for the one that is hardest. 1. A 2. C 3. B 4. D
5. E 7. For each algorithm (a to e), plot its fast and easy values on the graph: A. 1 difficulty / 3 speed B. 3 difficult/ 1 speed C. 1 difficulty/ 3 speed D. 2.5 difficulty/ 2.5 speed E. 5 difficulty / 4 speed 8. In complete sentences, describe the relationship between the fast and easy rankings, including what you see from the graph. Whatever would allow player B to guess less decided how fast we rated it, And difficulty is how easy it is to describe the method and perform it. Hi-Lo is not just a game. In computing, we often must search for a particular item in a set. For example, the Harvard University Library has roughly 16,000,000 volumes, and the US Library of Congress has roughly 22 million cataloged books and over 100,000,000 total items. Data scientists are particularly interested in searching very large sets, with millions or billions of values.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help