COMPUTER SCIENCE ILLUMIN.-TEXT
COMPUTER SCIENCE ILLUMIN.-TEXT
7th Edition
ISBN: 9781284156010
Author: Dale
Publisher: Jones & Barlett
Question
Book Icon
Chapter 7, Problem 40E
Program Plan Intro

a.

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.
  • The problem can be solved by many ways but the user should have to find which way provides better solution with proper steps.

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 identifies 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.
  • 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 already exist for the given or same problem, then just repeat the given steps to solve the problem.
      • User need 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.

Explanation of Solution

b.

Problem-solving strategy for organizing an awards banquet for the soccer team:

  • Ask questions:
    • Where will the event be set?
    • When will the event be set?
    • How many participants will be there in the event?
    • How many prizes will be awarded in the event?
  • Look for things that are familiar:
    • I already prepared this event two times...

Explanation of Solution

c.

Problem-solving strategy for buying a dress for an awarding event at which you are being honored:

  • Ask questions:
    • What time of the day is the event?
    • Where is the event held?
    • What type of dress would other wear?
    • Which one is the best for me?
  • Look for things that are familiar:
    • Last year, the person wore a blue suit...

Blurred answer
Students have asked these similar questions
The Horse table has the following columns: ID - integer, auto increment, primary key RegisteredName - variable-length string Breed - variable-length string Height - decimal number BirthDate - date Delete the following rows: Horse with ID 5 All horses with breed Holsteiner or Paint All horses born before March 13, 2013 To confirm that the deletes are correct, add the SELECT * FROM HORSE; statement.
Why is Linux popular? What would make someone choose a Linux OS over others? What makes a server? How is a server different from a workstation? What considerations do you have to keep in mind when choosing between physical, hybrid, or virtual server and what are the reasons to choose a virtual installation over the other options?
Objective  you will: 1. Implement a Binary Search Tree (BST) from scratch, including the Big Five (Rule of Five)  2. Implement the TreeSort algorithm using a in-order traversal to store sorted elements in a vector. 3. Compare the performance of TreeSort with C++'s std::sort on large datasets. Part 1: Understanding TreeSort How TreeSort Works TreeSort is a comparison-based sorting algorithm that leverages a Binary Search Tree (BST): 1. Insert all elements into a BST (logically sorting them). 2. Traverse the BST in-order to extract elements in sorted order. 3. Store the sorted elements in a vector.  Time Complexity Operation                                Average Case     Worst Case (Unbalanced Tree)Insertion                                     0(1log n)                0 (n)Traversal (Pre-order)                  0(n)                       0 (n)Overall Complexity                  0(n log n)                 0(n^2) (degenerated tree) Note: To improve performance, you could use a…
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education