1 / 37

# Problem Solving

Problem Solving. Topic 7 - Chapter 3 – Part 1. Announcements. Exam #1 after this section Lab #4 – Problem Solving. Why do we need Problem Solving Skills?. Programming Computers effectively is largely dependent upon our ability to solve problems

Download Presentation

## Problem Solving

An Image/Link below is provided (as is) to download presentation Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

### Presentation Transcript

1. Problem Solving Topic 7 - Chapter 3 – Part 1

2. Announcements • Exam #1 after this section • Lab #4 – Problem Solving of 40

3. Why do we need Problem Solving Skills? • Programming Computers effectively is largely dependent upon our ability to solve problems • Programs essentially set out to resolve some problem • Essentially we want to come up with a specific & efficient set of steps that can be repeated to solve our problem • This set of steps is called an algorithm • For example, if we want to find out the largest of 3 numbers  what is the process we employ to achieve this result • Once we come up with our algorithms then we convert it to code so it can solve that problem repeatedly • Programs are usually consist of many algorithms NOTE: We often have to solve problems that have not been solved before. of 40

4. Problem Solving Process 1 – Analyze the problem 2– Solve & Define the algorithm 3– Test the algorithm 4– Refine the algorithm of 40

5. Problem Solving Process Explained 1- Analyze the problem • Try to gain a greater understanding of it • Break the problem down into smaller parts • AKA Divide and Conquer  big problems can be overwhelming! • use one of the methods we’ll discuss later 2 – Solve & Define the algorithm • If can solve it once, then we can start to figure out what steps we employed. • Define these so we can solve it again. of 40

6. Problem Solving Process Explained (2) 3 – Test the algorithm • Verify that it works • Follow your steps and make sure they solve the problem 4- Refine the steps • Try to find a more efficient/effective way of solving the problem • Make sure you verify again This all takes practice  and some trial and error The key to innovation is not giving up If one approach doesn’t work then you’ve still made progress  you can eliminate that approach of 40

7. Analyzing and Initial Solution • Determine what the problem is • Try to come up with one possible solution • This is where we will start in this class • We will use a variety of techniques to analyze and solve problems: • Build upon what you know • Analyzing the problem state • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer • Build upon what you know of 36

8. Build upon what you know • Often in software development you will have a seemingly disjoint set of requirements • One approach is to Build upon your current knowledge • Analyze each fact and determine if you can deduce anything based on those facts that will lead towards a solution • Try to solve in some systematic order • Take one requirement at a time of 36

9. Favorite Television Show • Six friends are seated around a table discussing their favorite TV show • The shows they are discussing are • Friends • Golf tournaments • My Wife & Kids • 20/20 • Everybody Loves Raymond • Will and Grace • Based on the following information • Determine each person’s favorite TV Show and where they are sitting of 36

10. A) The boy who likes golf tournaments sits directly to the right of Doug B) Scott sits between the two people, one watches “Will and Grace” and the other one watches “Golf” C) No one sits between Trish and Debbie D) Debbie sits directly to the left of the boy who likes “Friends” E) The boy who likes “My Wife and Kids” does not sit next to a girl F) Debbie does not care for “Everybody Loves Raymond” G) Carlos does not sit next to a girl H) Erik does not sit next to the girl who likes “Will and Grace” Scott Think about what we know  Which of the clues build upon our current knowledge? Name Fav Show Lots of clues about boys & girls. So who are the girls & who are the boys? – Let’s make a list of 36

11. Summary  build upon what you know • The purpose of this drill is to start with one clue • systematically address each requirement • Most problems in CS consist of many requirements • It is important to address each requirement without violating another requirment of 36

12. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem state • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

13. Analyzing the Problem State • Sometimes we can list each possible state. • analyze each possibility individually. • The problem can be solved through the process of elimination • In other words --- which possibilities can be eliminated and which ones can’t … or through a series of deductions of 36

14. The Five Hats Problem • The men have no idea which hats have been destroyed. • The king instructs them, “The first one of you who can tell methe color of his hat will be set free.” • A period of time passes in silence and then finally the blind man tells the king the color of his hat and is set free. • What color hat was the blind man wearing and how did he know? • This does not have a “trick” answer – your answer should be very logical and well thought out. Be able to explain your answer from the viewpoint of each of the three prisoners. • Hint: Each sighted man can see the blind man’s hat as well as that of the other sighted man. What does the pause in time infer? • Three men are condemned to die, one of whom is blind. The king decides he will offer them an opportunity to be set free. • The three men are arranged in a circle facing one another. • The king produces 5 hats: 3 white and 2 black. • The men can’t see the hats • The king places a hat on the head of each person and then destroys the two remaining hats. of 36

15. Five Hats Problem • For problems like this we know each of the possible outcomes • Write them down • Then try to analyze each possibility • Eliminate possibilities if you can of 36

16. Think about all the possibilities. What are the potential arrangements of hats? See1 See2 Bl of 36

17. Problem Solving Chapter 3 – Part 2

18. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem state (continued) • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

19. Analyzing the Problem State • The 5 hats / 3 prisoners problem is an example of analyzing the possible states • Using this method • Identify that there is a limited number of choices • List out the choices and analyze them • Sometimes it is trial and error  this is okay for limited choices • For the 5 hats  ____________________________ ___________________________________________ • We examined all the possible states for all three prisoners (there were only 7) • From these we deduced ______________________ ___________________________________________ • otherwise the seeing prisoners would have spoken up • Let’s expand upon this technique to solve the next problem of 36

20. Missionary-Cannibal Problem • There are 3 missionaries, 3 cannibals, and a boat. • They want to cross the river. • If there are more cannibals than missionaries on any side of the river the cannibals will eat the missionaries. • Only 2 people fit in the boat at one time. • How do the missionaries get the cannibals across the river without getting eaten. (both Missionaries and cannibals need to get to the other side) Looking at the possibilities  just like the 5 hats Make deductions at each step of 36

21. Left River Right 1 2 3 4 5 of 36

22. of 36

23. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem states • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

24. Thinking Outside the Box • How many boxes are there? Sometimes we put constraints on problems • We need to look at the constraints and determine if the • problem dictates those constraints or if we do •  If it is us then we need to think beyond our preconceptions of 36

25. Thinking Out of the Box (2) Draw four line segments through the 9 points without lifting your pencil or retracing a line. of 36

26. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem states • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

27. Try to look for similarities Look for similarities in other problems you have solved For Example Finding the heaviest & lightest weight is really the same problem as Finding the highest and lowest grades on a test is really the same problem as Finding the daily high and low temperatures all 3 problems can be abstracted as being Find largest and smallest values in a set of numbers of 36

28. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem states • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

29. Means-Ends Analysis • Beginning state and End state are often given • You need to define a set of actions that can be used to get from one to the other • Once you have a set of actions, you need to work out the details Translated to computer programming • Begin by writing down the inputs. • (Beginning state) • What should the output be for those inputs? • (End state) • What processing need to be performed to obtain the desired results? of 36

30. Analyzing & Solving Techniques • Build upon what you know • Analyzing the problem states • Thinking outside the box • Look for similarities in previously solved problems • Means-Ends Analysis • Divide and Conquer of 36

31. Divide & Conquer • Break up large problems into smaller manageable problems Hard problem Easy subproblem Hard subproblem Easy subproblem Easy subproblem Easy subproblem of 36 31

32. Divide & Conquer Example Compute the area of a circle Problem statement • We need an interactive program (user will input data) that computes the area of a circle. Given the circle radius, the circle area should be displayed on the screen Input/Output description • Input  Circle radius • Output  Circle area Algorithm development (set of steps, decomposition outline) • Read value of circle radius (r) • Compute circle area as 𝛑* r2 • Print the value of circle area How do we represent more complex algorithms • Pseudocode, flowcharts of 36

33. Divide & Conquer Example (2) A divide and conquer block diagram of our problem Pseudocode BEGIN PROMPT the user for the circle radius READ radius CALCULATE Circle area (𝛑* radius2 ) OUTPUT Circle area END Circle area Read radius Compute area Print circle area of 36

34. 5 Basic Software Development Phases 1. Requirements Phase • Analyze and specify the problem • Define the problem  inputs and outputs 2. Design Phase • Determine how the problem will be approached and solved (Problem Solving) • Verify your solution solves the problem specified In this class we will mostly focus on small scale Design and Implementation Phases of 36

35. Software Development Phases (2) 3. Implementation Phase • Code & document the program (Concrete solution) • Basic testing 4. Testing • More formalize testing  make sure it meets the specifications 5. Maintenance • Use the Program • Modify (meet changing requirements) • Fix bugs missed in implementation of 36

36. Going from Problem Solving to Programming - Vocabulary • Algorithm • a step by step process for solving a problem. • Top-Down Design (design methodology) • break a larger problem into small parts progressing from the general to the specific • The smaller parts are more manageable and easier to understand • AKA “divide & conquer” • Hierarchical Input/Output “HIPO” Chart • A diagram of the top down design • Provides a hierarchical perspective of the systems input, output, and processing modules • Module • One small part of the solution of 36

37. Vocabulary (2) • Flowchart • A diagram of an algorithm using specific symbols that represent programming constructs • Pseudocode • A terse, English-like description of an algorithm • Used to understand the basic program flow without worrying about the correct syntax • Desk Check • Walking through the algorithm manually – step by step • Draw each memory location and check the algorithm as though you were the computer • Documentation • Anything that provides information about a program • Comments in the code, data tables that describe the data used in the code & external documents (flow charts, user’s manual, the design, &etc) of 40

More Related
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.slideserve.com/nero/problem-solving", "fetch_time": 1709338962000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-10/segments/1707947475711.57/warc/CC-MAIN-20240301225031-20240302015031-00026.warc.gz", "warc_record_offset": 1004697834, "warc_record_length": 23724, "token_count": 2873, "char_count": 13029, "score": 3.890625, "int_score": 4, "crawl": "CC-MAIN-2024-10", "snapshot_type": "latest", "language": "en", "language_score": 0.9048112630844116, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}