Problem Solving CSC 1750 Spring 2009. References Sprankle, Maureen and Jim Hubbard, Problem Solving and Programming Concepts, Eighth Edition, Prentice.

Slides:



Advertisements
Similar presentations
Generating Ideas #1: Research Patterns
Advertisements

Math in Our Environment Created by:. List your location here Discuss the location and what math concepts are going to be in the problem.
Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Heuristic Search techniques
HOW TO SOLVE IT Alain Fournier (stolen from George Polya) Computer Science Department University of British Columbia.
6-1 Chapter Goals Determine whether a problem is suitable for a computer solution Describe the computer problem-solving process and relate it to Polya’s.
Chapter 6 Problem Solving and Algorithm Design. 6-2 Chapter Goals Determine whether a problem is suitable for a computer solution Describe the computer.
Divide and Conquer. Divide and Conquer is a technique for designing the algorithms that consists of decomposing the instance to be solved into a number.
Review for Chapter 8 Test. What is an object or an act that stands for something else? Symbol.
Module 1- Getting Started Tell me what to do Using sets of instructions…
Algorithms and Problem Solving
Cognitive - problem_solving.ppt © 2001 Laura Snodgrass, Ph.D.1 Problem Solving Well-defined versus ill-defined problems Creativity Polya’s stages of problem.
Chapter 1 General Problem Solving Concepts
Chapter 3 Planning Your Solution
Chapter 5 Problem Solving with the Sequential Logic Structure
Copyright © 2012 Pearson Education, Inc. Chapter 6 Problem Solving with Decisions Problem Solving and Programming Concepts 9 th Edition By Maureen Sprankle.
Problem Solving & Creativity Dr. Claudia J. Stanny EXP 4507 Memory & Cognition Spring 2009.
Equations & Brackets.. You are now going to solve more complex equations by combining together two ideas that you have seen already. Try the following.
Bloom’s Critical Thinking Level 1 Knowledge Exhibits previously learned material by recalling facts, terms, basic concepts, and answers.
Operations Research Models
Artificial Intelligence: Its Roots and Scope
Introduction to Programming Concepts & Logic
Chapter 1 General Problem Solving Concepts
Top-Down Design and Modular Development
Random Sampling, Point Estimation and Maximum Likelihood.
Psychology: An Introduction Charles A. Morris & Albert A. Maisto © 2005 Prentice Hall Cognition and Language Chapter 7B.
Cognition and Language Chapter 7. Building Blocks of Thought Language –A flexible system of symbols that enables us to communicate our ideas, thoughts,
Dynamic Programming. Well known algorithm design techniques:. –Divide-and-conquer algorithms Another strategy for designing algorithms is dynamic programming.
Fundamentals of Information Systems, Third Edition2 Principles and Learning Objectives Artificial intelligence systems form a broad and diverse set of.
What is “Thinking”? Forming ideas Drawing conclusions Expressing thoughts Comprehending the thoughts of others Where does it occur? Distributed throughout.
WHS AP Psychology Unit 6: Cognition Essential Task 6-2: Identify problem-solving techniques (algorithms and heuristics) as well as factors that influence.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
Principles of Information Systems, Sixth Edition Specialized Business Information Systems Chapter 11.
Principles of Information Systems, Sixth Edition Specialized Business Information Systems Chapter 11.
Introduction to Programming Concepts & Logic COP1006 with Dr. Meg McManus McManusCOP10061.
© 2008 The McGraw-Hill Companies, Inc. Chapter 8: Cognition and Language.
 Dr. Syed Noman Hasany 1.  Review of known methodologies  Analysis of software requirements  Real-time software  Software cost, quality, testing.
Division of a two digit-number by a one digit number Make four equal groups from 32: 32 = Decompose 10 Can not group it into 4 parts. 32  4.
Unit 4:Learning and Cognition
Lecture 13: 10/10/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
Chapter 8: Thinking and Language
Use the substitution method
Complex Cognitive Processes EDP 3004-Chapter 8. Metacognition –Awareness of your own cognitive machinery and how it works –Involves three kinds of knowledge:
Sorting. Sorting Sorting is important! Things that would be much more difficult without sorting: –finding a telephone number –looking up a word in the.
Psychology - Warm Up April 10, 2012 Senior Exit Projects - Metacognition If you have not chosen your senior exit topic, please choose chose one for this.
PROBLEM SOLVING. ALGORITHM Specific procedure that when used properly will always lead to the solution Ex: recipes, math formulas S P L O Y O C H Y G.
Problem Solving.  Similar to Solving Math Word Problem  Read the Problem  Decide how to go about Solving the Problem  Solve the Problem  Test the.
1 Solving Problems with Methods Questions. 2 Problem solving is a process similar to working your way through a maze. But what are these “steps” and what.
HEURISTIC Good enough is perfect
COP1006 with Dr. Meg McManus McManus COP  Course Outline  Asthma & Allergies  Course Website  Tests  Assignments McManusCOP10062.
Divide and Conquer.
Artificial Intelligence
Concepts of Engineering and Technology Introduction to Problem Solving
Unit 6: Cognition WHS AP Psychology
Cognitive Processes: Thinking and Problem Solving
DESIGN CONCEPTS AND PROCESSES
CAPE INFORMATION TECHNOLOGY
Introduction to Problem Solving
Problem Solving General Problem Solving Concepts
Problem Solving 8.2.
Unit 7: Cognition AP Psychology
The Friendship Algorithm
Algorithms.
Unit 7: Cognition AP Psychology
CAPE INFORMATION TECHNOLOGY
CAPE INFORMATION TECHNOLOGY
Top-Down Design & JSP Skill Area Part D
Good Morning!!! Which would you rather fight?? Ten duck-sized Horses!?
Modeling and Analysis Tutorial
Presentation transcript:

Problem Solving CSC 1750 Spring 2009

References Sprankle, Maureen and Jim Hubbard, Problem Solving and Programming Concepts, Eighth Edition, Prentice Hall, Polya, George, How to Solve It, Second Edition, Doubleday Anchor Books, 1957

Types of Problems Algorithmic solutions Problems that can be solved with a series of actions Balancing checkbook, baking a cake Alphabetizing 10,000 names Heuristic solutions Problem solution requiring reasoning based on knowledge and experience, and a process of trial and error Solutions cannot be reached through a direct set of steps How to buy the best stock or expand the company Difficult to evaluate the solution

Types of Problems People are better at solving heuristic problems Artificial intelligence is the field of computer science that deals with heuristic problems Computers are better at solving complicated calculus problems or alphabetizing 10,000 names This class deals with algorithmic solutions

Problem Solving Steps Identify the problem Understand the problem Identify alternative ways to solve the problem Select the best way to solve the problem from the list of alternative solutions List instructions that enable you to solve the problem using selected solution Evaluate the solution

George Pólya's 1945, How to Solve It NameInformal Description Analogy Can you find a problem analogous to your problem and solve that? Generalization Can you find a problem more general than your problem? Induction Can you solve your problem by deriving a generalization from some examples? Variation of the Problem Can you vary or change your problem to create a new problem (or set of problems) whose solution(s) will help you solve your original problem? Auxiliary Problem Can you find a sub-problem or side problem whose solution will help you solve your problem? Here is a problem related to yours and solved before Can you find a problem related to yours that has already been solved and use that to solve your problem?

George Pólya's 1945, How to Solve It NameInformal Description SpecializationCan you find a problem more specialized? Decomposing and Recombining Can you decompose the problem and "recombine its elements in some new manner"? Working backward Can you start with the goal and work backwards to something you already know? Draw a FigureCan you draw a picture of the problem? Auxiliary Elements Can you add some new element to your problem to get closer to a solution?

Problem Solving Techniques Divide and conquer: break down a large, complex problem into smaller, solvable problems. Hill-climbing: attempting at every step to move closer to the goal situation. Means-end analysis: requires the setting of sub-goals based on the process of getting from the initial state to the goal state when solving the problem.

Problem Solving Techniques Trial-and-error: select a possible answer, apply it to the problem and, if it is not successful, select another possibility. Ends when a possibility yields a solution. Brainstorming: a group technique designed to generate a large number of ideas for the solution of a problem.