![COMPUTER SCIENCE ILLUMIN.-TEXT](https://www.bartleby.com/isbn_cover_images/9781284156010/9781284156010_largeCoverImage.gif)
COMPUTER SCIENCE ILLUMIN.-TEXT
7th Edition
ISBN: 9781284156010
Author: Dale
Publisher: Jones & Barlett
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 7, Problem 1E
Program Description Answer
“Ask questions” is the first strategy to be used when a problem was given.
Hence, the correct option is “A”.
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Explanation of Solution
Problem-solving strategy:
- It is an idea for solving a problem.
- Different type of strategies is used to solve the different type of problems.
- User can use a one or more strategy to solve a single problem.
- If the user uses many ways to solving problems, then user will determine which strategies they choose and which work good in many conditions.
Types of strategies in problem-solving:
There are three strategies are present in the problem solving:
- Ask questions:
- This strategy usually asks questions about the problem or task, and identify the clear information and facts about the problem.
- This strategy asks the questions such as “when”, “why”, and “where” until the problem or task is clearly and entirely understood.
- Specify the parts of the task, which are unable to understanding the problems.
- Looks for familiar things:
- Some problems have repeatedly happened in computing so it is useful for user identifying the familiar steps that will useful to solve the problem.
- If the solutions are already existing for the given or same problem, then just repeat the given steps to solve the problem.
- User needs not to determine the new steps to solve the given problem.
- Divide and conquer:
- User can easily handle the problem by dividing the larger problems into smaller ones.
- It means tasks are split into subtasks. Each subtask is split into sub-subtask if needed.
- This strategy can be applied repeatedly until each subtask is determined.
- Example for this strategy is quick sort and binary search
algorithm .
- Example for this strategy is quick sort and binary search
- User can easily handle the problem by dividing the larger problems into smaller ones.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
After our initial deployment for our ML home based security system, the first steps we took to contribute further to the project, we conducted load testing, tested and optimize for low latency, and automated user onboarding. What should be next?
Why investing in skills and technology is a critical factor in the financial management aspect of system projects.
why investing in skills and technology is a critical factor in the financial management aspect of systems projects.
Chapter 7 Solutions
COMPUTER SCIENCE ILLUMIN.-TEXT
Ch. 7 - Prob. 1ECh. 7 - Prob. 2ECh. 7 - Prob. 3ECh. 7 - Prob. 4ECh. 7 - Prob. 5ECh. 7 - Prob. 6ECh. 7 - Prob. 7ECh. 7 - Prob. 8ECh. 7 - Prob. 9ECh. 7 - Prob. 10E
Ch. 7 - Prob. 11ECh. 7 - Prob. 12ECh. 7 - Prob. 13ECh. 7 - Prob. 14ECh. 7 - Prob. 15ECh. 7 - Prob. 16ECh. 7 - Prob. 17ECh. 7 - Prob. 18ECh. 7 - Prob. 19ECh. 7 - Prob. 20ECh. 7 - Prob. 21ECh. 7 - Prob. 22ECh. 7 - Prob. 23ECh. 7 - Prob. 24ECh. 7 - Prob. 25ECh. 7 - Prob. 26ECh. 7 - Prob. 27ECh. 7 - Prob. 28ECh. 7 - Prob. 29ECh. 7 - Prob. 30ECh. 7 - Prob. 31ECh. 7 - Prob. 32ECh. 7 - Prob. 33ECh. 7 - Prob. 34ECh. 7 - Prob. 35ECh. 7 - Prob. 36ECh. 7 - Prob. 37ECh. 7 - Prob. 38ECh. 7 - Prob. 39ECh. 7 - Prob. 40ECh. 7 - Prob. 41ECh. 7 - Prob. 42ECh. 7 - Prob. 43ECh. 7 - Prob. 44ECh. 7 - Prob. 45ECh. 7 - Prob. 46ECh. 7 - Prob. 47ECh. 7 - Prob. 48ECh. 7 - Prob. 49ECh. 7 - Prob. 50ECh. 7 - Prob. 51ECh. 7 - Prob. 52ECh. 7 - Prob. 53ECh. 7 - Prob. 54ECh. 7 - Prob. 55ECh. 7 - Prob. 56ECh. 7 - Prob. 57ECh. 7 - Prob. 58ECh. 7 - Prob. 59ECh. 7 - Prob. 60ECh. 7 - Prob. 61ECh. 7 - Prob. 62ECh. 7 - Prob. 63ECh. 7 - Prob. 65ECh. 7 - Prob. 1TQCh. 7 - Prob. 2TQCh. 7 - Prob. 3TQCh. 7 - Prob. 4TQCh. 7 - Prob. 5TQCh. 7 - Prob. 6TQCh. 7 - Prob. 7TQ
Knowledge Booster
Similar questions
- EX:[AE00]=fa50h number of ones =1111 1010 0101 0000 Physical address=4AE00h=4000h*10h+AE00h Mov ax,4000 Mov ds,ax; DS=4000h mov ds,4000 X Mov ax,[AE00] ; ax=[ae00]=FA50h Mov cx,10; 16 bit in decimal Mov bl,0 *: Ror ax,1 Jnc ** Inc bl **:Dec cx Jnz * ;LSB⇒CF Cf=1 ; it jump when CF=0, will not jump when CF=1 HW1: rewrite the above example use another wayarrow_forwardEX2: Write a piece of assembly code that can count the number of ones in word stored at 4AE00harrow_forwardWrite a program that simulates a Magic 8 Ball, which is a fortune-telling toy that displays a random response to a yes or no question. In the student sample programs for this book, you will find a text file named 8_ball_responses.txt. The file contains 12 responses, such as “I don’t think so”, “Yes, of course!”, “I’m not sure”, and so forth. The program should read the responses from the file into a list. It should prompt the user to ask a question, then display one of the responses, randomly selected from the list. The program should repeat until the user is ready to quit. Contents of 8_ball_responses.txt: Yes, of course! Without a doubt, yes. You can count on it. For sure! Ask me later. I'm not sure. I can't tell you right now. I'll tell you after my nap. No way! I don't think so. Without a doubt, no. The answer is clearly NO. (You can access the Computer Science Portal at www.pearsonhighered.com/gaddis.)arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education