“The study of algorithms is the cornerstone of computer science.” Algorithms Winter 2012.

Slides:



Advertisements
Similar presentations
CS4026 Formal Models of Computation Running Haskell Programs – power.
Advertisements

CHAPTER 2 ALGORITHM ANALYSIS 【 Definition 】 An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition,
CS107: Introduction to Computer Science Lecture 2 Jan 29th.
Barefoot Computing Resources Workshop Nick Cook, Newcastle University barefootcas.org.uk.
ME 142 Engineering Computation I Fundamentals of Procedural Computer Programming.
Computer Science: A Structured Programming Approach Using C Converting File Type A rather common but somewhat trivial problem is to convert a text.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Early Term Test Some Study Reminders. General Topics Sources for information to be tested are –My slides and classroom presentations of slides –Chapter.
School of Computing Science CMT1000 © Ed Currie Middlesex University 1 CMT1000: Introduction to Programming Ed Currie Lecture 1B: Problem Solving.
1 CS150 Introduction to Computer Science 1 Professor: Chadd Williams
Basic Building Blocks of Programming. Variables and Assignment Think of a variable as an empty container Assignment symbol (=) means putting a value into.
Why teach coding?.
The New Computing Curriculum Typing skills and keyboard confidence Word processing Simple graphics.
Tell the robot exactly how to draw a square on the board.
Computer Science Lego Robotics Lab 07 Page 51. CS Lego Robotics Lab 07 (Updated ) Objectives: 1.Extend the Lego robot with three sensors. 2.Program.
If you are using an Apple device, such as an iPad or iPhone, and you want to follow the instructions you will need a ‘Flash’ compatible browser. If you.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Flowcharts.
“The study of algorithms is the cornerstone of computer science.” Algorithms Fall 2011.
Overview of this morning What … is computing? Why … is computing an important skill to learn? What … will my child be learning in computing lessons?
Lecture 6 Problem Solving: Algorithm Design & Analysis.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 5: Algorithms Computer Science: An Overview Tenth Edition by J. Glenn.
Stages of Processing.  When a computer is given instructions, a series of tasks must take place in order for a result to be accomplished  To accomplish.
CPSC 171 Introduction to Computer Science More Algorithm Discovery and Design.
The ____________________ Branch by: _____________________________________ per: _________ 1.What are the parts of this branch? 2. How are the members of.
Ministry of Higher Education Sohar College of Applied Sciences IT department Comp Introduction to Programming Using C++ Fall, 2011.
Computer Lab Procedures. Walking to and from the computer lab Walk quietly the entire way. Do not disturb any other classes. Stay with the group. Do not.
… Computer Science Inside… Algorithm Development.
Computer Science, Algorithms, Abstractions, & Information CSC 2001.
BIOLOGICAL DRAWINGS.
 Structure charts (last lesson)  Screen and page layout diagrams provide  A sketch of each page (screen) of the program  A list of the content, including.
Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.
DEFINITIONS FOR DR. HALVERSON’S CLASSES. DEFINING TERMS A correctly formed DEFINITION of a term consists of 2 parts  Noun – statement of the basic nature.
Instructions What are they? A step by step guide explaining how to make or do something. Instructions can be spoken or written.
Computing in the New Curriculum. Computing Pupils should be taught to: KS1 understand what algorithms are; how they are implemented as programs on digital.
CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,
Algorithms and Programming. Problem: Cheong Choon Ng entrepreneur of loom bands would like to give makers of loom bracelets the exact number of bands.
How to develop a program
Topic: Introduction to Computing Science and Programming + Algorithm
Topic: Introduction to Computing Science and Programming + Algorithm
Introduction to Algorithms
ALGORITHMS part-1.
Energy Lesson 4 Energy Transfers: Making Boats Go.
COMS W1004 Introduction to Computer Science and Programming in Java
An Introduction to Control Structures
Representing branch symbol What are the parts of this branch?
المدخل إلى تكنولوجيا التعليم في ضوء الاتجاهات الحديثة
3-3 Side Effects A side effect is an action that results from the evaluation of an expression. For example, in an assignment, C first evaluates the expression.
Double Chain Rule.
Sequences We use multi-link for the sequences activity.
Faculty of Computer Science & Information System
ME 142 Engineering Computation I
CS 0007 Spring Lory Al Moakar.
The Friendship Algorithm
Algorithm and Ambiguity
Computer Science Core Concepts
Data Structures, Algorithms, & Applications
Getting Started Things to do
An Introduction to Control Structures
Quick Write: With your group, write what you believe science is.
Procedural Text 5.13 A – Interpret details from a procedural text to complete a task, solve a problem, or perform procedures.
Computational Thinking
Representing branch symbol What are the parts of this branch?
WELCOME TO Chemistry MISSION: POSSIBLE.
Type Topic in here! Created by Educational Technology Network
Early Midterm Some Study Reminders.
Computational Thinking (How to think like a computer scientist)
Computational Thinking (How to think like a computer scientist)
CHAPTER 1 THE ABC OF PROGRAMMING
Presentation transcript:

“The study of algorithms is the cornerstone of computer science.” Algorithms Winter 2012

The Concept of an Algorithm An algorithm is: –an ordered set of instructions –that are unambiguous, –that are executable, –which define a process that has an end. Let’s look at these steps in detail...

Ordered set –There must be a well-established structure in terms of the order in which steps are performed. Note: they don’t have to be performed sequentially starting with the first. Unambiguous –All information required for execution must be available and there can be no question about what to do. There can be no “reasoning” required. –Executable steps –It must be possible to execute each step. which ends.

Assignment 3 Winter 2012 Write an algorithm to do a task which you are an “expert” at. About 12—20 steps to accomplish the task. Could be a recipe or some simple chore. Make sure you follow the rules of an algorithm. (See page 2)