Introduction to Computational Thinking

Slides:

Advertisements

Similar presentations

REAL TIME SYSTEM Scheduling.

Advertisements

Karel The Robot Nested If Statements While Loops Copyright © 2008 by Helene G. Kershner.

Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?

Randomized Algorithms. Introduction Algorithm uses a random number to make at least one decision Running time depends on input and random numbers generated.

An Introduction to Programming Using Alice Object-Oriented Programming.

Bug Session Four. Session description Objectives Session activities summary Resources Prior knowledge of sequencing instructions using Bug Bug website.

Institute for Personal Robots in Education (IPRE)‏ CSC 170 Computing: Science and Creativity.

Review for Exam 2. Topics included Deadlock detection Resource and communication deadlock Graph algorithms: Routing, spanning tree, MST, leader election.

Chapter 5 Recursion. Basically, a method is recursive if it includes a call to itself.

Chapter 1: An Introduction to Control Structures Introduction to Programming with C++ Fourth Edition.

Time Parallel Simulations I Problem-Specific Approach to Create Massively Parallel Simulations.

Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.

Time Complexity. Solving a computational program Describing the general steps of the solution –Algorithm’s course Use abstract data types and pseudo code.

 In computer programming, a loop is a sequence of instruction s that is continually repeated until a certain condition is reached.  PHP Loops :  In.

Reinforcement Learning Dynamic Programming I Subramanian Ramamoorthy School of Informatics 31 January, 2012.

CPSC 233 Tutorial 5 February 2 th /3 th, Java Loop Statements A portion of a program that repeats a statement or a group of statements is called.

Flow Control in Imperative Languages. Activity 1 What does the word: ‘Imperative’ mean? 5mins …having CONTROL and ORDER!

Program Design & Development EE 201 C7-1 Spring

11 Making Decisions in a Program Session 2.3. Session Overview  Introduce the idea of an algorithm  Show how a program can make logical decisions based.

Introduction to Computational Thinking

Mile-long hurdle race Suppose that we want to program Karel to run a one-mile long hurdle race, where vertical wall sections represent hurdles. The hurdles.

Introduction to Computational Thinking

Introduction to Computational Thinking

Physical Features North Africa GOVERNMENT RELIGION RESOURCES

Introduction to Computational Thinking

Solar Energy: Is there a specific direction solar panels should face?

Parallel Shared Memory

ELEC 1041 Digital Electronics Tutorial: Word Problems

Diamond Hunt Mock Programming Project.

Navigating a Maze.

Karel J Robot OOP approach to learning computer science

Loops CS140: Introduction to Computing 1 Savitch Chapter 4 Flow of Control: Loops 9/18/13 9/23/13.

LESSON 11 – WHILE LOOPS UNIT 5 – 1/10/17.

Lecture 2 Introduction to Computer Science (continued)

CPS120: Introduction to Computer Science

CS 188: Artificial Intelligence

M________________ R________________ H ________________

Introduction to pseudocode

An Introduction to Control Structures

Stage 8: Maze: Conditionals

Chapter 3: The Reinforcement Learning Problem

Theory of Computation Turing Machines.

HAPPY NEW YEAR! Lesson 7: If-statements unplugged

Navigating a Maze.

Algorithms Take a look at the worksheet. What do we already know, and what will we have to learn in this term?

Kruskal’s Minimum Spanning Tree Algorithm

Karel J Robot OOP approach to learning computer science

Binding Times Binding is an association between two things Examples:

Chapter 3: The Reinforcement Learning Problem

Flowcharting & Algorithms

Computer Science Core Concepts

Chapter 3: The Reinforcement Learning Problem

ICT Programming Lesson 3:

An Introduction to Control Structures

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

Hidden Markov Models (cont.) Markov Decision Processes

Nested If Statements While Loops

Class 4: Repetition Pretest Posttest Counting Flowchart these!

Computational Thinking

EXAMPLE 1 Read a problem and make a plan Running

LOOPS The loop is the control structure we use to specify that a statement or group of statements is to be repeatedly executed. Java provides three kinds.

Site and Context. Section from East Section E2 Section E1 Sannidhanam Malikapuram Sannidhanam Malikapuram.

Question 1. Question 1 What is 10 x 40? A 40 B 400 C 4000 D 4.0.

Recursive functions.

Markov Decision Processes

Markov Decision Processes

Scratch 7B IT 1.

Presentation transcript:

Introduction to Computational Thinking Algorithms: Discussion (C) Dennis Kafura 2016

Algorithms Basic building blocks of an algorithm Questions action : changing something sequence : doing one step after another decision : choosing whether to take an action iteration : repeating steps until a goal is reached state : the value of all of the properties Questions What can we learn by studying different solutions? What happens while an algorithm is running? (C) Dennis Kafura 2016

Three solutions (1) (2) (3) (C) Dennis Kafura 2016

What happens when an algorithm is running? Abstraction of the avatar Location (where it is in the maze) Heading (which way it is facing) North Abstraction Properties of the Avatar 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 West East Location Heading South Value of each property (C) Dennis Kafura 2016

During execution -1 Location Heading (C) Dennis Kafura 2016

During execution -2 Location Heading (C) Dennis Kafura 2016

During execution -3 Location Heading (C) Dennis Kafura 2016

During execution -4 Location Heading (C) Dennis Kafura 2016

State Idea State: the value of all properties at a give point in the execution of the algorithm The state changes as the algorithm is executed (performed) Only one state exists; previous states forgotten Note: some states not shown Location Heading 1 East Location Heading 2 East … Location Heading 6 South … Location Heading 8 North (C) Dennis Kafura 2016

Nature of state (dynamic) (static) (C) Dennis Kafura 2016