Faculty of Sciences and Social Sciences HOPE Structured Problem Solving An Introduction Stewart Blakeway 0151 291 3113.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advanced Piloting Cruise Plot.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 5: Repetition and Loop Statements Problem Solving & Program.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Summary of Convergence Tests for Series and Solved Problems
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Exit a Customer Chapter 8. Exit a Customer 8-2 Objectives Perform exit summary process consisting of the following steps: Review service records Close.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
1 University of Utah – School of Computing Computer Science 1021 "Thinking Like a Computer"
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
2 |SharePoint Saturday New York City
Green Eggs and Ham.
VOORBLAD.
15. Oktober Oktober Oktober 2012.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Quadratic Inequalities
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
1 public class Newton { public static double sqrt(double c) { double epsilon = 1E-15; if (c < 0) return Double.NaN; double t = c; while (Math.abs(t - c/t)
Copyright © 2013, 2009, 2006 Pearson Education, Inc.
BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
© 2012 National Heart Foundation of Australia. Slide 2.
LO: Count up to 100 objects by grouping them and counting in 5s 10s and 2s. Mrs Criddle: Westfield Middle School.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Chapter 5 Loops Liang, Introduction to Java Programming, Tenth Edition, (c) 2015 Pearson Education, Inc. All rights reserved.
Addition 1’s to 20.
25 seconds left…...
H to shape fully developed personality to shape fully developed personality for successful application in life for successful.
Januar MDMDFSSMDMDFSSS
Week 1.
Chapter 10: The Traditional Approach to Design
Analyzing Genes and Genomes
Systems Analysis and Design in a Changing World, Fifth Edition
Chapter 9 Interactive Multimedia Authoring with Flash Introduction to Programming 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Intracellular Compartments and Transport
PSSA Preparation.
Immunobiology: The Immune System in Health & Disease Sixth Edition
Essential Cell Biology
1 Chapter 13 Nuclear Magnetic Resonance Spectroscopy.
Immunobiology: The Immune System in Health & Disease Sixth Edition
Energy Generation in Mitochondria and Chlorplasts
Faculty of Sciences and Social Sciences HOPE Structured Problem Solving Week 3: Algorithms Stewart Blakeway FML 213
Presentation transcript:

Faculty of Sciences and Social Sciences HOPE Structured Problem Solving An Introduction Stewart Blakeway

Faculty of Sciences and Social Sciences HOPE Aims of the presentation to quickly list the skills to be developed on the SPS strand of the course to officially start the course

Faculty of Sciences and Social Sciences HOPE 3 Skills to be developed in the SPS strand of the course Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills The most important bit

Faculty of Sciences and Social Sciences HOPE 4 Skills to be developed in the SPS strand of the module Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills

Faculty of Sciences and Social Sciences HOPE 5 Problem Solving Skills Analysis of Problems – Crossing a busy road – Eating a Pie – Cooking a Pie – Climbing Mount Everest ?????? – Getting PieEater to do something complicated – Writing other software to do something complicated

Faculty of Sciences and Social Sciences HOPE 6 Problem Solving Skills Analysis of the Structure of Solutions – Sequence – Selection – Repetition

Faculty of Sciences and Social Sciences HOPE 7 Problem Solving Skills Structured English – Sequence – Selection – Repetition

Faculty of Sciences and Social Sciences HOPE 8 Skills to be developed in the SPS strand of the module Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills

Faculty of Sciences and Social Sciences HOPE 9 Programming Skills Introduction to Java – Java Programming Constructs – Java Trainer – The PieEater Java revisited – Object Oriented Concepts – BlueJ Integrated Development Environment ( – The PieEater again plus Close Friends – Graphics and Animation

Faculty of Sciences and Social Sciences HOPE 10 Programming Skills Data Structures – Selection of Appropriate Data Structures – Sorting – Searching

Faculty of Sciences and Social Sciences HOPE 11 Skills to be developed in the SPS strand of the module Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills

Faculty of Sciences and Social Sciences HOPE 12 Team Interaction Skills Animation Problems – Solved in Groups – Coded in Groups – Tested in Groups

Faculty of Sciences and Social Sciences HOPE 13 Skills to be developed in the SPS strand of the module Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills

Faculty of Sciences and Social Sciences HOPE 14 Presentation Skills Presentation of Working Animations – Demonstration of the Running Animation – Explanation of the Choice of Variables – Explanation of the Algorithmic Design – Explanation of the Data Structures Selected – Discussion of Possible Enhancements

Faculty of Sciences and Social Sciences HOPE 15 Skills to be developed in the SPS strand of the module Problem Solving Skills Programming Skills Team Interaction Skills Presentation Skills Reflective Skills

Faculty of Sciences and Social Sciences HOPE 16 Reflective Skills Reflect on Team Work Activities Reflect on the Scope of the Task Highlight Possible Failings in the Mechanics of the Team Work Activity Suggest Possible Improvements to Team Work Interaction

Faculty of Sciences and Social Sciences HOPE 17 Let the course begin …..

Faculty of Sciences and Social Sciences HOPE 18 Your First Seminar createpieeater(); pendown(); walk(); penup(); walk(); pendown(); turnright(); walk();

Faculty of Sciences and Social Sciences HOPE 19 Let’s Loop-the-Loop createpieeater(); while (test) { actions; } other actions; Sequences of Actions each Ending with a Semi Colon No Semi Colons

Faculty of Sciences and Social Sciences HOPE 20 Semi-colons: a working rule Do not put them at the end of while() if () { } Do put them at the end of other lines int a; a = 7; turnleft();

Faculty of Sciences and Social Sciences HOPE 21 while (test) { } test – clearahead – direction != “SW” – pieinsight clearahead and pieinsight are either true or false direction != “SE” can be evaluated to either true or false

Faculty of Sciences and Social Sciences HOPE 22 Loop Operation while (test) { actions; } other actions; Evaluate test truefalse

Faculty of Sciences and Social Sciences HOPE 23 Test is True while (test) { » actions; } other actions; Enter Body of Loop Execute [actions;] Evaluate test Again Body of Loop

Faculty of Sciences and Social Sciences HOPE 24 Test is True while (test) { » actions; } other actions; Enter Body of Loop Execute [actions;] Evaluate test Again

Faculty of Sciences and Social Sciences HOPE 25 Test is True while (test) { » actions; } other actions; Enter Body of Loop Execute [ actions; ] Evaluate test Again

Faculty of Sciences and Social Sciences HOPE 26 You Get the Idea

Faculty of Sciences and Social Sciences HOPE 27 Test is False while (test) { » actions; } other actions; Jump to other actions ; and Continue with the Rest of the Program

Faculty of Sciences and Social Sciences HOPE 28 {actions;} walk(); pendown(); penup(); turnleft(); turnright(); You add the rest

Faculty of Sciences and Social Sciences HOPE 29 Selection The if statement allows us to specify alternative actions depending upon a test

Faculty of Sciences and Social Sciences HOPE 30 if (test) { } else { } if (pieinsight) { eatpie(); } else { walk(); } Selection

Faculty of Sciences and Social Sciences HOPE 31 if inside a loop createpieeater(); randompies(20); while (clearahead) { if (pieinsight) { eatpie(); } else { walk(); }

Faculty of Sciences and Social Sciences HOPE 32 Counting loops - for int i; createpieeater(); for (i=0; i<5; i++) { walk(); }

Faculty of Sciences and Social Sciences HOPE 33 In Conclusion Problem Solving is a Skill – Riding a Bicycle – Swimming – Keeping Awake in Lectures It Cannot be Learned Quickly It Cannot be Learned without Practice Every Failure is Part of the Learning Process

Faculty of Sciences and Social Sciences HOPE Lecture Exercise 1 Draw the following grid

Faculty of Sciences and Social Sciences HOPE Trace out the following program createpieeater(); turnright(); pendown(); while (clearahead) { walk(); }

Faculty of Sciences and Social Sciences HOPE Lecture Exercise 1 Answer

Faculty of Sciences and Social Sciences HOPE Lecture Exercise 2 Write the program for

Faculty of Sciences and Social Sciences HOPE Lecture Exercise 2 Answer createpieeater(); int i; for (i=1 ; i<=4 ; i++) { while (clearahead) { walk(); } turnright(); }

Faculty of Sciences and Social Sciences HOPE Lecture Exercise 3 – spot the syntax error createpieeater(); int i; for (i=1, i<=4, i++) { while (clearahead) { walk() } turnright();

Faculty of Sciences and Social Sciences HOPE 40 In Conclusion Programming Languages are Merciless – Syntax Matters – Semi Colons can be Dangerous – In Conclusion: }

Faculty of Sciences and Social Sciences HOPE 41 Questions? Next… – Problem Solving in your seminars More loops If statements – Next lecture on Algorithms – Setting of assessment next week