(Guess the Number) Write a C program that plays the game of “guess the number" as fol- lows: Your program chooses the number to be guessed by selecting an integer at random in the range 1 to 1000. The 5.32 program then types: I have a number between 1 and 1000. Can you guess my number? Please type your first guess. The player then types a first guess. The program responds with one of the following: 1. Excellent! You guessed the number! Would you like to play again (y or n)? 2. Too low. Try again. 3. Too high. Try again. If the player's guess is incorrect, your program should loop until the player finally gets the number right. Your program should keep telling the player Too high or Too low to help the player “zero in" on the correct answer. [Note: The searching technique employed in this problem is called binary search. We'll say more about this in the next problem.]

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

I need help with these  two C programming questions ( not c++) thank you

---

### Exercise 5.32: Guess the Number

**Objective:** Develop a C program that plays the "guess the number" game. The program randomly selects an integer between 1 and 1000. It then prompts the player with:

```
I have a number between 1 and 1000.
Can you guess my number?
Please type your first guess.
```

**Gameplay:**

- The player inputs their first guess.
- The program responds with one of the following:
  1. "Excellent! You guessed the number! Would you like to play again (y or n)?"
  2. "Too low. Try again."
  3. "Too high. Try again."

If the player's guess is incorrect, the program continues to prompt for guesses until the correct number is guessed. Feedback on whether the guess was too high or too low aids the player in "zeroing in" on the correct answer. This technique is known as **binary search**, which will be discussed further in subsequent problems.

---

### Exercise 5.33: Guess the Number Modification

**Objective:** Enhance the program from Exercise 5.32 to count the number of guesses a player makes.

- If the player guesses the number in 10 or fewer attempts, print:
  - "Either you know the secret or you got lucky!"
- If the player guesses the number exactly on the 10th attempt, print:
  - "Ahah! You know the secret!"
- If the player takes more than 10 attempts, print:
  - "You should be able to do better!"

**Rationale:**

The goal is to refine guessing strategies such that no number between 1 and 1000 requires more than 10 guesses. With each optimal guess, approximately half of the possible numbers can be eliminated, enabling the player to efficiently narrow down the correct number using a binary search method.

---
Transcribed Image Text:--- ### Exercise 5.32: Guess the Number **Objective:** Develop a C program that plays the "guess the number" game. The program randomly selects an integer between 1 and 1000. It then prompts the player with: ``` I have a number between 1 and 1000. Can you guess my number? Please type your first guess. ``` **Gameplay:** - The player inputs their first guess. - The program responds with one of the following: 1. "Excellent! You guessed the number! Would you like to play again (y or n)?" 2. "Too low. Try again." 3. "Too high. Try again." If the player's guess is incorrect, the program continues to prompt for guesses until the correct number is guessed. Feedback on whether the guess was too high or too low aids the player in "zeroing in" on the correct answer. This technique is known as **binary search**, which will be discussed further in subsequent problems. --- ### Exercise 5.33: Guess the Number Modification **Objective:** Enhance the program from Exercise 5.32 to count the number of guesses a player makes. - If the player guesses the number in 10 or fewer attempts, print: - "Either you know the secret or you got lucky!" - If the player guesses the number exactly on the 10th attempt, print: - "Ahah! You know the secret!" - If the player takes more than 10 attempts, print: - "You should be able to do better!" **Rationale:** The goal is to refine guessing strategies such that no number between 1 and 1000 requires more than 10 guesses. With each optimal guess, approximately half of the possible numbers can be eliminated, enabling the player to efficiently narrow down the correct number using a binary search method. ---
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Structure chart
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education