PRINCIPLES OF COMPUTATION PROBLEM SOLVING. WHAT IS COMPUTATION & COMPUTING  Computation is a process of performing computations or calculations. Just.

Slides:



Advertisements
Similar presentations
1 ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
Advertisements

Training Meeting: ‘Handy Man 101’ October 21, :00pm CE 110.
JOB SAFETY ANALYSIS One-hour Presentation
Representor: Yoo D. Moon Date : November 25, 2008.
Everyday Algorithms David Davenport Computer Eng. Dept., Bilkent University Ankara - Turkey. lightning introduction to.
Chapter 15 Handling Emergency.
JOB SAFETY ANALYSIS Presentation. Job Safety Analysis Break down the task into steps Identify the hazards connected with each step State how you will.
Mr. Jody Hannan Automotive Technology.  Topic- This presentation will give students knowledge of emergency car repair. We will explore how to change.
Split steering gaiter (nearside) this is an MoT failure.
Presented by: Ginnette Clark Terri Hall Robert Ishmael Michael Petry.
Head jig usage procedure RKC London Office. Set the head jig 2) Put two screws with loose condition 3) Lock the plate 4) Tighten two head jig screws 5)
Algorithms Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg.
Program Design ENGR 1181 MATLAB 11. MATLAB Program Design in Real Life Complex manufacturing processes require careful logic mapping to determine what.
Computability Start complexity. Motivation by thinking about sorting. Homework: Finish examples.
INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.
Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:
Programming Fundamentals (750113) Ch1. Problem Solving
New Mexico Computer Science For All Introduction to Algorithms Maureen Psaila-Dombrowski.
CHANGING A FLAT TIRE WHY ME! I’M GOING TO BE LATE TO SCHOOL.
1 Algorithm…. 2 Algorithm: Is a planned set of steps to solve certain problem Ex.: Assume for instance that the gross pay of an employee is to be calculated.
Chapter 2.1 Program Design and Documentation. Summary System/Program specifications System/Program design –Top-down & Bottom-up design –Object Oriented.
Job Hazard Analysis Development
CREATING GOALS AND OBJECTIVES. Goals Goals are broad statements of what the students will be able to do when they have completed the lesson Goals can.
Data Structures & AlgorithmsIT 0501 Algorithm Analysis I.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
School of Computer Science & Information Technology G6DICP - Lecture 9 Software Development Techniques.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Flowcharts.
Period 8Gary Clements1 How to do an oil change Gary Clements Period 8.
CPS120 Introduction to Computer Programming The Programming Process.
Introduction to Loops For Loops. Motivation for Using Loops So far, everything we’ve done in MATLAB, you could probably do by hand: Mathematical operations.
INTRO TO COMPUTING. Looking Inside Computer 2Computing 2 | Lecture-1 Capabilities Can Read Can Write Can Store A/L Operations Automation.
JOB SAFETY ANALYSIS Bureau of Workers’ Comp PA Training for Health & Safety (PATHS) 1PPT
BY: JORDON BIORGE Quite the Squeak and Change your Pads.
Six Simple Steps to Fix a Flat
8.1 8 Algorithms Foundations of Computer Science  Cengage Learning.
Flowchart. a diagram of the sequence of movements or actions of people or things involved in a complex system or activity. a graphical representation.
CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Tevfik Bultan Lecture 4: Introduction to C: Control Flow.
Presented by: Timothy Wheeler December 4 th, 2008 ENGL393, Mrs. Harris.
By Victor Moctezuma. Have you Ever?  Have you ever been driving comfortably in your car listening to your favorite jams, when all of a sudden one of.
HOW TO CHANGE A TIRE. Take out the following items for you vehicle: - Spare Tire - Jack - Tire Iron - Lug Nut Key(if applicable) Spare Tire Jack Tire.
JOB SAFETY ANALYSIS Presentation. ANY New Job/ Activity Recognize the Hazards Plan the work Protect the people Before starting ANY new job/ activity,
4 Square Diagram with Transitional Words Review (AGAIN)
Tire Rotation Tire rotation extends the life of your tires.extends the life of your tires In most cases tires should be rotated every 6000 miles (10,000.
Alyssa,Ben,Mike &Tyler.  These instructions are intended for anyone whose vehicle has a flat tire and wishes to change it themselves, but is unfamiliar.
Algorithms and Flowcharts
SOF Tactical Tourniquet
Getting Back On the Road Again After a Flat Tire October 2011.
 A car Jack  A wrench  A flat surface Put the car into park and apply the parking brake.
6 Things Every Driver Should Know. 1) How to Change a Tire 1 st : Once you have a flat, stop at a SAFE place to change your tire. 2 ND : Grab the spare,
The Need for Algorithms
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
Bin Packing First fit algorithm
Copyright © 2008 by Helene G. Kershner
ALGORITHMS & FLOWCHARTING II
How to Change a Flat Tire
Bubble, Selection & Insertion sort
An Introduction to Control Structures
Computational Thinking
Programming Fundamentals (750113) Ch1. Problem Solving
SOF Tactical Tourniquet
SOF Tactical Tourniquet
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Creating Goals and Objectives
Creating Goals and Objectives
An Introduction to Control Structures
Introduction to Computer Science
Continue with conditional
Software Development Techniques
How to Change Tires on a Rim?
Presentation transcript:

PRINCIPLES OF COMPUTATION PROBLEM SOLVING

WHAT IS COMPUTATION & COMPUTING  Computation is a process of performing computations or calculations. Just think of Gringotts bank in Harry Potter and the calculations that the Goblins were performing at the desks.  Back in the day these calculations were done by humans, but as computers became more main stream they took over the work  Computing is the study of natural science.  It’s important to understand that computing isn’t just fixed to man-made items such as Xboxs, iPods etc  There are strands of computing such as  Nanocomputing – molecular-scale computing  DNA Computing

ALGORITHMS Define: a description, independent of any programming language, of a process that achieves some task. It is a step-by-step procedure for solving a problem  In a small way an algorithm is a way of stripping down a complex task into it’s easiest form.  The main objective to creating an algorithm is to find the fastest and shortest algorithm possible Just remember, you create algorithms every time you code.

ALGORITHM EXAMPLE The best example of an algorithm is the London underground map

CHALLENGE TIME  Is there a route that a sales person can take through every city starting at city A with a cost of £480 as a maximum. B C D A E G F

PLANNING AN ALGORITHM  Algorithms don’t need to relate to computers take changing a wheel for example First Draft 1. Loosen the wheel nuts from the flat tyre 2. Get the spare tyre from the boot of the car 3. Jack up the car 4. Remove the wheel with the flat tyre 5. Fit spare tyre and tighten the wheel nuts 6. Lower the car 7. Secure the jack and flat tyre in the boot After refinements 1. Loosen the wheel nuts from the flat tyre 2. Get the spare tyre from the boot of the car 3. Jack up the car 1. Place the jack under the car near the wheel with the flat tyre 2. Insert the jack handle in the jack 3. Place a brick or wooden block under a wheel to stop the car from rolling off the jack 4. Jack up the car until there’s enough room to fit the spare tyre 1. Move the jack handle repeatedly until the car is high enough off the ground for the spare tyre to be put on the wheel 4. Remove the wheel with the flat tyre 5. Fit spare tyre and tighten the wheel nuts 6. Lower the car 7. Secure the jack and flat tyre in the boot

QUESTION TIME Hand trace the following algorithm using as input numbers 2, 6, 34, 12, 0 nResult 0 2 Code Result  0 Repeat Input n Result  Result + n Until n = 0