Entry Ticket: Algorithms and Program Construction

Slides:



Advertisements
Similar presentations
Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,
Advertisements

Session Objectives# 24 COULD code the solution for an algorithm
Program Flow Charting How to tackle the beginning stage a program design.
Lecture 5 Sorting. Overview Mathematical Definition.
CS 0004 –Lecture 8 Jan 24, 2011 Roxana Gheorghiu.
 DEFINE COMPUTER ? EXPLAIN CLASSIFICATION OF COMPUTER.  WHAT ARE INPUT AND OUTPUT DEVICES OF COMPUTER ? EXPALIN OUTPUT DEVICES.  WHAT ARE MEMORY AND.
Summary Algorithms Flow charts Bubble sort Quick sort Binary search Bin Packing.
P ROBLEM SOLVING Design program using pseudocode and flowchart.
CSCI-100 Introduction to Computing
HNC Flow Chart 1 IT Systems Analysis and Design SSADM – Design.
Learning Objective To be able to… Understand flow chart symbols Complete and correct flow chart algorithms Create a program based on a flow chart.
IT 210 Week 7 Chapter 5 Programming Problems To purchase this material link Programming-Problems.
Component 1.6.
Starter What does the following code do?
Борисова Надежда Александровна МБОУ СОШ № 49 г.Мурманск
Component 1.6.
Sorting Lower Bound 4/25/2018 8:49 PM
Lesson Objectives Aims To be able to write an algorithm in Pseudo Code
Topic: Introduction to Computing Science and Programming + Algorithm
A451 Theory – 7 Programming 7A, B - Algorithms.
Component 1.6.
Unit 5.
Selection and Python Syntax
Python: Control Structures
IGCSE 6 Cambridge Effectiveness of algorithms Computer Science
Chapter 2- Visual Basic Schneider
User Access and User ID Commands in UNIX
Sorting Algorithms.
Function Mapping/ Function Rules
System Design.
Chapter 5: Control Structure
Teaching design techniques to design efficient solutions to problems
Model Functions Input x 6 = Output Input x 3 = Output
MDD 310 Enthusiastic Studysnaptutorial.com
Print slides for students reference
Coaching.
Chapter 2: Getting Started
(2,4) Trees 11/15/2018 9:25 AM Sorting Lower Bound Sorting Lower Bound.
Mazetool Analytics Project 2 IMGD 2905.
Learning to Program in Python
For -G7 programing language Teacher / Shamsa Hassan Alhassouni.
What makes a good friend?
Count Controlled Loops (Nested)
(2,4) Trees 12/4/2018 1:20 PM Sorting Lower Bound Sorting Lower Bound.
Bar Charts.
flow charts and system diagrams
We’re moving on to more recap from other programming languages
Chapter 2- Visual Basic Schneider
Together Again.
Chapter 2: Getting Started
LESSON 2 Asking about Name and Answering ما اسمك؟ ……………………. اسمى.
No Yes START Do you live in Scotland? Take umbrella See last Flowchart
Console.WriteLine(“Good luck!”);
Programs. at the code at the site..
(2,4) Trees 2/28/2019 3:21 AM Sorting Lower Bound Sorting Lower Bound.
Flowcharts and Pseudo Code
Start or end of algorithm: Action/process step:
COMPUTATIONAL THINKING COMPUTATIONAL THINKING IN PROGRAMMING
Topic 3: Relations, Functions, Function Behavior Lesson 15 (1.7)
Mazetool Analytics Project 2 IMGD 2905.
Objective- To use an equation to graph the
Chapter 6 Vocabulary Input Output Function
Design program using pseudocode and flowchart
Hint idea 2 Split into shorter tasks like this.
MALT©2006 Projector game M512 Time to Times
WJEC GCSE Computer Science
Pseudo-Code Conditional Branches
Tic-Tac-Toe Game Engine
How well do you KNOW your 2 times table ?
GCSE Computing.
Presentation transcript:

Entry Ticket: Algorithms and Program Construction What are these Flow Chart shapes used for? What is pseudocode? What is an algorithm? Extension Draw an algorithm for the following program: Asks the user to input a number Outputs the times table for that number (up to 10) Asks the user if they want to go again If they say yes it runs again If they say no it doesn’t The maximum number of times a user can play the game is 3 After 3 runs the game ends and outputs a message to tell the user they have played too many times

Entry Ticket: Algorithms and Program Construction What are these Flow Chart shapes used for? What is pseudocode? What is an algorithm? Extension Draw an algorithm for the following program: Asks the user to input a number Outputs the times table for that number (up to 10) Asks the user if they want to go again If they say yes it runs again If they say no it doesn’t The maximum number of times a user can play the game is 3 After 3 runs the game ends and outputs a message to tell the user they have played too many times

Exit Ticket: Algorithms and Program Construction How does a Bubble Sort work? How does a Merge Sort work?

Exit Ticket: Algorithms and Program Construction How does a Bubble Sort work? How does a Merge Sort work?