Chapter 20 Iteration Principles. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives Trace the execution.

Slides:



Advertisements
Similar presentations
Java Script Session1 INTRODUCTION.
Advertisements

Programming with Microsoft Visual Basic th Edition
Chapter 20 Iteration Principles. Learning Objectives Trace the execution of a given for loop Write a World-Famous Iteration for loop Discuss the structure.
Chapter 19 Programming Functions. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives Apply JavaScript rules.
The Web Warrior Guide to Web Design Technologies
Working with JavaScript. 2 Objectives Introducing JavaScript Inserting JavaScript into a Web Page File Writing Output to the Web Page Working with Variables.
Chapter 20 Thinking Big: Functions. Copyright © 2006 Pearson Addison-Wesley. All rights reserved Anatomy of a Function Functions are packages for.
CS 106 Introduction to Computer Science I 02 / 12 / 2007 Instructor: Michael Eckmann.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Iteration Principles Once is Not Enough lawrence snyder c h a p t e r 21.
XP 1 Working with JavaScript Creating a Programmable Web Page for North Pole Novelties Tutorial 10.
Chapter 2: Input, Processing, and Output
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Java Software Solutions Foundations of Program Design Sixth Edition by Lewis.
© 2004 Pearson Addison-Wesley. All rights reserved5-1 Iterations/ Loops The while Statement Other Repetition Statements.
Copyright © Texas Education Agency, Computer Programming For Loops.
ECE122 L9: While loops March 1, 2007 ECE 122 Engineering Problem Solving with Java Lecture 9 While Loops.
Introduction to JavaScript for Python Programmers
Programming Games Computer science big ideas. Computer Science jargon. Show virtual dog Homework: [Catch up: dice game, credit card or other form.] Plan.
JavaScript, Fifth Edition Chapter 1 Introduction to JavaScript.
Created by, Author Name, School Name—State FLUENCY WITH INFORMATION TECNOLOGY Skills, Concepts, and Capabilities.
Chapter 20 Iteration Principles. Learning Objectives Trace the execution of a given for loop Write a World-Famous Iteration for loop Discuss the structure.
Announcements Assignment 9 is due Project 2 is due 7/27/04 We will be skipping chapter 22 Test 3 (chapters 18-21) will be on 7/29/04 Tip of the Day : Functions.
Chapter 12: How Long Can This Go On?
ASP.NET Programming with C# and SQL Server First Edition Chapter 3 Using Functions, Methods, and Control Structures.
Chapter 4: Decision Making with Control Structures and Statements JavaScript - Introductory.
XP Tutorial 10New Perspectives on Creating Web Pages with HTML, XHTML, and XML 1 Working with JavaScript Creating a Programmable Web Page for North Pole.
Chapter 13 Recursion. Learning Objectives Recursive void Functions – Tracing recursive calls – Infinite recursion, overflows Recursive Functions that.
Using Client-Side Scripts to Enhance Web Applications 1.
DHTML AND JAVASCRIPT Genetic Computer School LESSON 5 INTRODUCTION JAVASCRIPT G H E F.
1 © 2002, Cisco Systems, Inc. All rights reserved. Arrays Chapter 7.
Chapter 5: Windows and Frames
Tutorial 51 Programming Structures Sequence - program instructions are processed, one after another, in the order in which they appear in the program Selection.
Chapter 2 Functions and Control Structures PHP Programming with MySQL 2 nd Edition.
An Introduction to Programming with C++ Sixth Edition Chapter 7 The Repetition Structure.
XP Tutorial 10New Perspectives on HTML and XHTML, Comprehensive 1 Working with JavaScript Creating a Programmable Web Page for North Pole Novelties Tutorial.
Chapter 3 Functions, Events, and Control Structures JavaScript, Third Edition.
JavaScript - Basic Concepts Prepared and Presented by Hienvinh Nguyen, Afshin Tiraie.
Chapter 22 The Smooth Motion: Case Study in Algorithmic Solving.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Fluency with Information Technology Third Edition by Lawrence Snyder Chapter.
Chapter 2: Variables, Functions, Objects, and Events JavaScript - Introductory.
Today’s Announcements Assignment 8 is due Project 2 is due 7/27/04 We will be skipping chapter 22 Test 3 (chapters 18-21) will be on 7/29/04 Tip of the.
I Power Higher Computing Software Development High Level Language Constructs.
JavaScript, Fourth Edition
JavaScript, Fourth Edition Chapter 4 Manipulating the Browser Object Model.
Chapter 15 JavaScript: Part III The Web Warrior Guide to Web Design Technologies.
Sections © Copyright by Pearson Education, Inc. All Rights Reserved.
ActionScript: For Loops, While Loops, Concatenation and Arrays MMP 220 Multimedia Programming This material was prepared for students in MMP220 Multimedia.
Announcements CLUE Tutoring Wednesday nights 7-8:30PM MGH extra-credit points for each session you attend from last week through the end of the quarter.
Copyright © 2012 Pearson Education, Inc. Publishing as Pearson Addison-Wesley C H A P T E R 5 Repetition Structures.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Fluency with Information Technology Third Edition by Lawrence Snyder Chapter.
Chapter Topics 2.1 Designing a Program 2.2 Output, Input, and Variables 2.3 Variable Assignment and Calculations 2.4 Variable Declarations and Data Types.
Repetition Statements (Loops). 2 Introduction to Loops We all know that much of the work a computer does is repeated many times. When a program repeats.
Tutorial 11 1 JavaScript Operators and Expressions.
Concepts of Algorithmic Thinking Iterations, or Loops Once is not Enough D.A. Clements, Lecturer Information School 2/23/2016 D.A. Clements, MLIS, UW Information.
Internet & World Wide Web How to Program, 5/e © by Pearson Education, Inc. All Rights Reserved.
Introduction to JavaScript MIS 3502, Spring 2016 Jeremy Shafer Department of MIS Fox School of Business Temple University 2/2/2016.
JavaScript, Sixth Edition
Loops and Arrays Chapter 19 and Material Adapted from Fluency Text book.
XP Tutorial 10New Perspectives on HTML, XHTML, and DHTML, Comprehensive 1 Working with JavaScript Creating a Programmable Web Page for North Pole Novelties.
1 Agenda  Unit 7: Introduction to Programming Using JavaScript T. Jumana Abu Shmais – AOU - Riyadh.
Fluency with Information Technology
Chapter 19 and Material Adapted from Fluency Text book
A Balanced Introduction to Computer Science David Reed, Creighton University ©2005 Pearson Prentice Hall ISBN X Chapter 13 (Reed) - Conditional.
CIS 16 Application Development Programming with Visual Basic
Javascript Arrays.
The Smooth Motion: Case Study in Algorithmic Solving
FLUENCY WITH INFORMATION TECNOLOGY
Javascript Chapter 19 and 20 5/3/2019.
A Balanced Introduction to Computer Science David Reed, Creighton University ©2005 Pearson Prentice Hall ISBN X Chapter 13 (Reed) - Conditional.
Presentation transcript:

Chapter 20 Iteration Principles

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives Trace the execution of a given for loop Write a World-Famous Iteration for loop Discuss the structure of nested loops Explain the use of indexes List the rules for arrays; describe the syntax of an array reference Explain the main programming tasks for online animations

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Terminology Repeat –5 repeats, means you may have done it once followed by 5 more times (the repeats!) Iterate –5 iterations means that you do it 5 times Iteration means looping through a series of statements to repeat them In JavaScript, the main iteration statement is the for loop

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } Text that is not in must be given literally The statement sequence to be repeated is in the

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } Whole statement sequence is performed for each iteration Computer completes the whole statement sequence of the before beginning the next iteration

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } Three operations in the parentheses of the for loop control the number of times the loop iterates Called the control specification

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for (j = 1; j < = 3; j = j + 1 ) { } Use an iteration variable Iteration variables are normal variables and must be declared This example uses j as the iteration variable

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } sets the iteration variable’s value for the first (if any) iteration of the loop

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } has the same form as the predicate in a conditional statement If the test is false outcome, the loop terminates and is skipped

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } If has a true outcome, the is performed When the statements are completed, the operation is performed changes iteration variable

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Syntax for ( ; ; ) { } Next iteration starts with the test, performing the same sequence of operations Iterations proceed until the test has a false outcome, terminating the loop

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Sequence

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Example

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Iteration Variables Iteration variables are normal variables, but just used in iteration They must be declared using the same rules for identifiers Programmers tend to choose short or even single-letter identifiers for iteration –i, j, and k are the most common

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Starting Point Iterations can begin anywhere –Including with negative numbers: for ( j = −10; j <= 10; j = j + 1) {... } –Including fractional numbers: for ( j = 2.5; j <= 6; j = j + 1) {... } j assumes the values 2.5, 3.5, 4.5, and 5.5

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Continuation/Termination Test If you can begin an iteration anywhere, you can end it anywhere The test follows the rules for predicates—the tests in if statements. The test is any expression resulting in a Boolean value It must involve the iteration variable

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Step-by-Step also allows considerable freedom It allows you to specify how big or small the change in the iteration variable The amount of change is known as the step or step size: j=j+1 j=j+10

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Iteration Variable does Math! iteration variable is often used in computations in the Important that you focus on the values of the iteration variable during the loops For example: fact = 1; for ( j = 1; j <= 5; j = j + 1) { fact = fact * j; {

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley WFI! World-Famous Iteration (WFI) JavaScript uses the same for loop statement structure as other popular programming languages like Java, C++, and C Using the form just described for ( j=0; j<n; j++) {... }

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Infinite Loops ad infinitum for loops are relatively error free Still possible to create infinite loops Think what could go wrong… –Every loop in a program must have a continuation test or it never terminates! The fifth property of algorithms is that they must be finite or stop and report that no answer is possible

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Infinite Loops ad infinitum for ( j = 1 ; j <= 3; i = i + 1) {... } If the test is based on values that don’t change in the loop, the outcome of the test will never change The loop, then, will never end (note i and j above)

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley for Loop Practice: Heads/Tails Let’s use randNum(2) from Chapter 19 –It will return 0 (tails) or 1 (heads) And flip the “coin” 100 times Use WFI

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Nested Loops…Loop in a Loop All programming languages allow loops to nest Inner and outer loops must use different iteration variables or else they will interfere with each other

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Indexing Indexing is the process of creating a sequence of names by associating a base name with a number Each indexed item is called an element of the base-named sequence An index is enclosed in [square brackets] in JavaScript

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Arrays [1] In programming, an indexed base name is called an array Arrays must be declared In JavaScript, arrays are declared: var = new Array( ) Notice that Array starts with an uppercase “A”

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Arrays [2] Variables either are or are not arrays var week = new Array(7); –week is the identifier being declared, –new Array(7) specifies that the identifier will be an array variable. –number in parentheses gives the number of array elements To refer to an array’s length, we use.length

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Arrays [3] Rules for arrays in JavaScript: –Arrays are normal variables initialized by new Array( ) – in the declaration is just that—the number of array elements –Array indexing begins at 0 –Number of elements in an array is its length –Greatest index of an array is − 1 (because the origin is 0)

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Arrays [4] Array reference consists of array name with an index [enclosed in brackets] Value to which the index evaluates must be less than the array’s length Example: –var dwarf = new Array(7); –dwarf[0] = "Happy"; –dwarf[1] = "Sleepy"; The number in the bracket is called the subscript

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley WFI and Arrays 0-origin of the WFI is perfect for 0-origin indexing Easily allows for iterating through all the values of an array

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Animation Movies, cartoons, etc. animate by the rapid display of many still pictures known as frames Human visual perception is relatively slow so it’s fooled into observing smooth motion when the display rate is about 30 fps or 30 Hz Iteration, arrays, and indexing can be used for animation

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

JavaScript Animation Animation in JavaScript requires three things: 1.Using a timer to initiate animation events 2.Prefetching the frames of the animation 3.Redrawing a Web page image

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer JavaScript animation will be shown in a Web browser. Web browsers are event driven: –They sit idle until an event occurs, then they act, and then idly wait for next event…repeat Doesn’t animation require constant action? (action every 30 milliseconds) Then, turn the activity of drawing the next frame into an event!

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer Programmers’ timers typically “tick” once per millisecond Timers, in JavaScript, are intuitive The command to set a timer is setTimeout (" ", )

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer is a “string” giving the JavaScript computation that runs when the timer goes off is positive number in milliseconds saying when the timer should go off the last step for the function must be to set the timer so that it “wakes up” again or the animation will stop

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer Example: –To display a frame in 30 ms using the function animate( ): setTimeout("animate( )", 30) 30 ms later the computer runs the animate( ) function and displays the frame

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer Using a Handle to Refer to a Timer –Computer timers can keep track of many different times at once –Computers use special code called handle to identify which timer is being used timerID is the variable name to handle our timer timerID = setTimeout( "animate()", 30 ); To cancel our timer: clearTimeout( timerID );

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 1. Using a Timer Using Buttons to Start/Stop the Animation –Buttons can be used to start (setTimeout()) and stop (clearTimeout()) animation Start button sets the timer for the first time Animation keeps going on its own Stop button clears the timer/stops the animation

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2. Prefetching Graphics files are usually stored in separate directory Display first image at first (doesn’t need to be animated yet)

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2. Prefetching To animate (overwrite image with next sequenced image): –Loading an image one-at-a-time is too slow –Get all images first, store them locally, then display them Images are already numbered (to keep track of where they are in the sequence) –Indexed already? use an array!

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2. Prefetching Initializing to an Image Object: –Elements of the array must be initialized to an image object –Image object is a blank instance of an image –Initialize the 12 array elements to image objects requires an iteration and the new Image() operation:

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2. Prefetching Using the src Component –Field called src where the image’s source is stored – tag in HTML –Browser saves the name, gets the file, stores it in memory: –NOTE how the file name is build using iteration and concatenation: gifpix/Busyi.gif

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2. Prefetching Important difference between the prefetching and using –Prefetching: is not visible on the screen – : is visible on the screen Advantage to use both: there is an initial image to be seen, then the animation occurs

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 3. Redrawing an Image To animate we need to overwrite it with the images that were prefetched Browsers keep an array of the images used on the page in the DOM When is encountered, browser fills its images To change initial frame, write:

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 3. Redrawing an Image Defining the animate( ) event Handler –To animate the Busy icon must sweep through all of the i values, cyclically, one every 30 ms –animate( ) event handler overwrites the image, sets up for the next frame, and sets the timer to call itself again:

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Complete Busy Animation

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary The basics of for loop iteration. The control part of a for statement is written in parentheses and the is enclosed in curly braces. With each iteration, the entire statement list is performed. The number of iterations is determined by assignments to, and tests of, the iteration variable as specified in the control part.

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary In the JavaScript for statement, the component is executed first. Then, prior to each iteration, including the first, the predicate is tested. If it is true, the is performed; otherwise, it is skipped, and the for statement terminates. After each iteration, the operation is performed.

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary The principles of iteration ensure that every iteration contains a test and that the test is dependent on variables that change in the loop. The for statement is very flexible. The can begin with any number, the test can stop the loop at any number, and the operation can increment by various amounts upward or downward.

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary In indexing, we create a series of names by associating a number with a base name. If we need more names, we count more numbers. Indexed variables are known as arrays in programming. Like ordinary variables, arrays must be declared, but they use the new Array( ) syntax, in which is the number of elements of the array.

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary Array elements—referenced by giving the name and a non-negative index in brackets—can be used like ordinary variables. Arrays and iterations can be effectively used together. Basic concepts of online animation. All animations achieve the appearance of motion by rapidly displaying a series of still frames.

Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary When animating information displayed by a Web browser, we should prefetch the images so that they are readily accessible for rapid display. The key idea is to use a timer to create events, and then use the timer event handler to redraw an image that has been placed on the Web page by the tag. These are referenced as the elements of the document’s images array.