Stage 13 Bee: Conditionals

Slides:

Advertisements

Similar presentations

Selection Statements Make a decision based on conditions Allows the computer to be intelligent.

Advertisements

College of Information Technology & Design

A8 – Control Structures if, if-else, switch Control of flow in Java Any sort of complex program must have some ability to control flow.

INSTITUTE OF ANATOMY TESTING SYSTEM Center of Information Technology Division of Software and Information Systems Kaunas 2013.

Al-Karma Language School Computer Department Prep. 3.

Chapter 2: Algorithm Discovery and Design

Do Loops A Do..Loop terminates based on a condition that is specified Execution of a Do..Loop continues while a condition is True or until a condition.

Greater than or equal? A lesson on math language A lesson on math language.

Introduction to Algorithm – part one Jennifer Elmer Form 3 Computing.

 Select your grade level  Click The Leaf Chronicle  Enter Username: NIE  Enter Password: nie2013.

Introduction to Computer Programming

How to create an account on. Open a web browser (e.g. Mozilla Firefox or Internet Explorer) and type in the address bar, then press.

Stage 9: Relay Programming. Objectives Practice communicating ideas through codes and symbols Use teamwork to complete a task Verify the work of their.

1 Percent Proportion. 2 Percent Means ‘of a hundred’

IXA 1234 : C++ PROGRAMMING CHAPTER 1. PROGRAMMING LANGUAGE Programming language is a computer program that can solve certain problem / task Keyword: Computer.

Writing Program Code in BASIC Write a program to prompt for and accept values into TWO variables, numx and numy. The program should square the value stored.

Stage 12 Conditionals with Cards. Objective Define circumstances when certain parts of programs should run and when they shouldn’t Determine whether a.

Basic Control Structures

Unit 2 – Algorithms & Pseudocode. Algorithms Computer problems solved by executing series of action in order Procedure –The Actions to execute –The Order.

STAGE 16: FLAPPY. OBJECTIVES  Match blocks with the appropriate event handler  Create a game using event handlers  Share a creative artifact with other.

Binary A double zero educational presentation. Binary Basics Binary is the language computers use Only 1’s and 0’s can be found in Binary Very large numbers.

How to Program? -- Part 1 Part 1: Problem Solving –Analyze a problem –Decide what steps need to be taken to solve it. –Take into consideration any special.

 Predict where a program will fall  Modify existing program to solve errors  Identify an algorithm that is successful when the steps are out of order.

Day 1 on Tech Use March 26, Students ◦ Log in at:  j.mp/cmsgaggle (don’t use www or  use FireFox browser ◦ Username: flastxxxx  first.

1 Overview of Programming Principles of Computers.

STAGE 10: DICE RACE What do you remember from the last class? What was your favorite part? What do you wish we had had time to do?

Stage 17 Play Lab: Create a Story

Stage 6: Bee: Functions What do you remember from the last class? What did you like the best? Any questions?

Problem Solving.  Similar to Solving Math Word Problem  Read the Problem  Decide how to go about Solving the Problem  Solve the Problem  Test the.

Teacher instructions Students will be watching a video in Username: atcscience Password:

Selection Using IF THEN ELSE CASE Introducing Loops.

IST 210: PHP Logic IST 210: Organization of Data IST2101.

Introducing Instructions

READ THE INSTRUCSTION CAREFULLY AND FOLLOW THE ARROW

Stage 7: Bee: Conditionals

Welcome to Computer Science!

STAR Chart Instruction

Pseudocode Upsorn Praphamontripong CS 1110 Introduction to Programming

Chapter 5 Decisions. Chapter 5 Decisions ssential uestion: How are Boolean expressions or operators used in everyday life?

ALGORITHMS & FLOWCHARTING II

PEARSON REALIZE TUTORIAL

While Loops (Iteration 2)

Programming Problem solving Debugging

Teaching KS3 Computing Session 4 Theory: Boolean logic AND/OR/NOT

Stage 8: Maze: Conditionals

Coding Shaw STEM Lab-2016.

Higher Computing Using Loops.

Getting Started.

Stage 7 Artist: Loops.

To send your work click on student upload icon

Algorithms Key Revision Points.

Solving Percent Problem with Equations

Computer Science Core Concepts

Goods and services WebQuest

Unit 3 lesson 2-5 The Need For Algorithms- Creativity in Algorithms – Simple Commands - Functions Day 18.

Notes Over 1.7 Solving Inequalities

Notes Over 1.7 Solving Inequalities

Stage 6 Maze: Loops.

Stage 5: Getting Loopy.

Which is bigger 3 5

The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.

Hour of Code Code.org/lightbot

Type Topic in here! Created by Educational Technology Network

Stage 4 Artist: Sequence

Stage 3 Maze: Sequence.

Inequalities x > a Means x is greater than a

WRITING AN ALGORITHM, PSEUDOCODE, AND FLOWCHART LESSON 2.

Stage 8 Bee: Loops.

Presentation transcript:

Stage 13 Bee: Conditionals

Objectives Compare values using the = operator Translate spoken language conditional statements into a program Identify when a conditional can be used to deal with unknown values Execute an algorithm with a conditional statement Solve puzzles using a combination of looped sequences and conditionals

Computer Time Login Open code.org icon to Mozilla Firefox Username: bsmedia Password: Press Enter Open code.org icon to Mozilla Firefox Login into code.org Start Stage 13 Bee: Conditionals Answer the first two questions Stop for video: http://studio.code.org/s/course2/stage/13/puzzle/3

conditionals Equal to (=) means it has to be that number If nectar = 1 then get nectar What happens if nectar is 1? What happens if nectar is 0? Greater Than (>) means it has to be bigger than that number, that number is not included If nectar > 1 then get nectar What happens if nectar is 2? Less Than (<) means it has to be smaller than that number, that number is not included If nectar < 4 then get nectar? What happens if nectar is 7? What happens if nectar is 4?

Computer Time Finish Stage 13 Bee: Conditionals Answer the two questions Stop at Stage 14 Binary Bracelets