Problem Solving WEEK 3.

Slides:



Advertisements
Similar presentations
Maureen Curran and Mary Lou Aalbers Hazelwood School District Teacher tips ACTIVITY 1.
Advertisements

Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
The Towers of Hanoi or Apocalypse When?.
CS1010: Programming Methodology
By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp.
The Tower Of Hanoi Edouard Lucas
Chapter Recurrence Relations
More Recursion: Permutations and Towers of Hanoi COP 3502.
Comparing Data presented in Frequency Tables
Analyzing Algorithms and Problems Prof. Sin-Min Lee Department of Computer Science.
The Tower of Hanoi Ben Epstein Special Topics 2003.
Recursion!. Question Stephen King’s books J. R. R. Tolkien’s books Recursion Do they have something in common?
Exploration 1.1 With 24 people in class, including yourself, if each person shakes hands with every person, how many handshakes will there be?
C++ Programming: Program Design Including Data Structures, Fourth Edition Chapter 16: Recursion.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Introduction to Programming (in C++) Recursion Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC.
Copyright © Cengage Learning. All rights reserved.
Advanced Counting Techniques
Data Structures: A Pseudocode Approach with C1 Chapter 2 Objectives Upon completion you will be able to: Explain the difference between iteration and recursion.
Recursion Jordi Cortadella Department of Computer Science.
Unit 2 – Week 4 Reasoning with Linear Equations and Inequalities Lesson 3 Students are introduced to the formal process of solving an equation: starting.
# 1# 1 VBA Recursion What is the “base case”? What is the programming stack? CS 105 Spring 2010.
Chapter 7.  d4 d4  Mathematics is concerned with finding answers.
For each rule make a table, graph, and draw figure 0, 1, and 2.
Upon completion, the world will end…
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Analyzing Puzzles and Games. What is the minimum number of moves required to complete this puzzle?
Recursion Colin Capham Recursion – an introduction to the concept.
The Five Step Plan!!! ~ Jack Matasker. 1. Read and Think 2. Select a Strategy 3. Solve 4. Write or Explain 5. Reflect.
Working together to be the best we can Maths Workshop.
UNIT 17 Recursion: Towers of Hanoi.
Module 7- Solving Complex Problems Solving Complex Problems The Towers Of Hanoi.
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
Addition and Subtraction = = = 120.
1 Simultaneous Equations MENU Algebra Menu Ducks & Sheep Linear Type : 4x + 2y = 20 Teacher examples 4x – y = 8 Linear Type : 4x + 2y = 20 Questions 4x.
UOP COM 200 Week 4 DQ 3 NEW Check this A+ tutorial guideline at Which relationship management.
Recursion.
Pramada Ramachandran, Assistant Professor, Department of Mathematics,
Paper Airplanes & Scientific Methods
6th Grade Social Studies Unit 1, Lesson 2: Geographic Inquiry
A Science Fair Project Guide
Campo Elementary School
Recursion in Java December 12, 2005
School of EECS, Peking University
Jordi Cortadella Department of Computer Science
Copyright © Cengage Learning. All rights reserved.
A Science Fair Project Guide
SCIENCE IS PUZZLE A.
ECE 103 Engineering Programming
When Will The World End “Temple of Brahma” legend from the Indian city of Benares Priests must move 64 gold disks from one end of the temple to the other.
Newton’s Third Law.
Text Features.
Mathematical Practice #1- Make Sense of the Problem
Copyright © Cengage Learning. All rights reserved.
Warm Up Answer the following in complete sentences:
Designing an Experiment
What is Science? Review This slide show will present a question, followed by a slide with an acceptable answer. For some questions, there is a definite.
8th Grade Science Content Standard
6th Grade Social Studies Unit 1, Lesson 2: Geographic Inquiry
Geographic Inquiry -Geography skills and practice
The Scientific Method.
Designing an Experiment
What is the question? The answer is -2
Sudoku Puzzles.
Ms. Moreno’s Science Class
Monitoring for Meaning
7 Scientific Method 1. Choose a problem. (What do you want solve? Ask a question about it.) List the materials you will need, how much of each material.
The Scientific Method Give one get one – students move around the room to fill in scientific method sheet from last night In their groups of four, the.
K.OA.4 For any number 1 to 9, find the number that makes 10 when added to the given number. Students may use objects or drawings and should record answers.
8th Grade Science Content Standard
Presentation transcript:

Problem Solving WEEK 3

Activity 1.2: Ducks & Cows Farmer McDonald raises ducks and cows. The animals have a total of 9 heads and 26 feet. How many ducks and cows does Farmer McDonald have?

How do you solve the problem ? What are the heuristics you use in solving the problem? What are the steps? What are the PS strategies you use? Did it work/didn’t work ? Why? How can you improve your PS heuristics?

EXTENSIONS…What if…. What if … there were: 9 heads and 20 feet; 10 heads and 24 feet; 8 heads and 24 feet; 9 heads and 50 feet; 6 heads and 17 feet; or 10 heads and 18 feet What if Farmer McDonald sees some of each kind of animal and altogether sees 24 feet (not including his own), how many ducks and cows does he see? Show all possible answers.

Towers of Brahma Towers of Brahma is more commonly called 'Towers of Hanoi' and rarely 'The End of the World Puzzle' (the legend explains the second name).  It was invented in 1883 by a French mathematician named Edouard Lucas, based on an ancient Hindu legend.  

Towers of Brahma 1. Only one disk can be moved at a time The legend tells that Brahma placed 64 gold disks on a pillar of Benares Temple stacked in order of size (as shown). The monks there are asked to move the disks from the first pillar to the third pillar with these conditions:- 1. Only one disk can be moved at a time 2. No disk may be placed on a smaller disk at any time. How long does it take to move the disks if the time taken to move one disk is one second?

Strategies used Use objects Identify sub goal/Simplify the problem Experimentation/Simulation Collect data Use a table to record data Identify pattern Look for a relationship Use induction

Experimentation and Simulation Acting out the problem forces an understanding of the nature of the problem. Some manipulative objects can be used to represent things or people Can simulate the action by making drawing or a table

Identify pattern and making table No. of disk No. of steps 1 1 2 3 3 7 4 15 5 31 n Identify pattern 2-1 = 21 - 1 4-1 = 22 - 1 8-1 = 23 -1 16-1 = 24 - 1 32-1= 25 - 1 2n - 1

Discuss… Examples of real-life problems, Application of problem-solving skills in real life, and Creative problem solving in real life.

Tutorial Do Tutorial 1.2