By John, Kunal, Murid, Zamir. Turing Guide Repetition

Size: px
Start display at page:

Download "By John, Kunal, Murid, Zamir. Turing Guide Repetition"

Transcription

1 By John, Kunal, Murid, Zamir. Turing Guide Repetition

2 Table of Contents Title Page.1 Table of Contents...2 A Brief History of Turing. 3 What is Repetition.. 4 Infinite Loops...5 Conditional Loops Counted Loops Exiting Loops..8 Examples of repetition Repetition Review Repetition Test 17 Glossary...18 Credits

3 A Brief History of Turing Turing, a Pascal-like programming language, was developed in 1982 by University of Toronto students Ric Holt and James Purdy. Turing was named after a British scientist Alan Turing. Turing is taught as a warm-up program for students interested in learning Java in the future. There are two other versions of Turing,t Object-Oriented Turing and Turing Plus. In September 2001 the original Turing was renamed Classic Turing. Turing is not updated by Holt Software any more since the company went bankrupt with the decline in computer science classes. It is also only compatible with Microsoft Windows. Turing is used a lot in high schools in Ontario for students as an introduction to programming. Turing became free of charge for personal, commercial and education use on November 28, Ric Holt, Co-owner/creator of Turing.

4 What is repetition? Repetition is a function in the Turing software. The main function in repetition is the use of s There are four types of s: 1. Infinite Loops 2. Conditional s 3. Counted s 4. exiting s A good example of repetition is a clock. A clock moves in a circle from right to left and it repeats this circle over and over.

5 Infinite Loops In Turing there are four different types of s. There are Infinite, Conditional, Counted and Exiting s. Infinite Loops repeat themselves over and over again. The following code is an example of an Infinite. % The "ManyCircleAreas" program % Computes the areas of circles var radius, area : real const pi := put "Enter radius ".. get radius area := pi * radius ** 2 put "Area is ", area end. *Taken from Introduction to Programming in Turing by J. N. P. Hume Conditional Loops The second type of is Conditional. They are s that execute again and again if a given condition holds true. Conditional Loops are helpful for developing logic and if programs didn t consist of conditional s then programming codes would be much longer. Run the following example to see what happens. % The "ManyCircleAreas2" program % Compute circle areas until you enter a negative radius var radius, area : real const pi := put "Enter a negative radius to stop execution" put "Enter radius ".. get radius exit when radius < 0 area := pi * radius ** 2 put "Area is ", area end put "That's all folks" *Taken from Introduction to Programming in Turing by J. N. P. Hume In this program there is an exit when (refer to glossary) statement which checks to see if the statement inside the is true. If the statement is false then the

6 program will not run until its value is true. When the statement is true the computer leaves the to go to the statement after the end (refer to glossary). Once the computer executes the statement after the end it will stop the program. There are different types of exit when statements a user can use in his or her program that involves comparing two operators. They are called Logical, Boolean, or true/false statements. These are the complete set of different operators. = equal to < less than > greater than not= not equal to <= less than or equal >= greater than or equal *Taken from Introduction to Programming in Turing by J. N. P. Hume Counted Loops The third type of is a Counted Loop. Counted Loops repeat for a fixed number of times. A Counted starts with the keyword for (refer to glossary about for ) followed by the word count, which is an index or counter (refer to glossary) in the. The index in a is a variable called integer (refer to glossary) which is a special property that is declared in a for statement. Run the following example. % The "ComputeAverages" program % Reads marks and computes average var mark : int var sum : int := 0 put "Enter marks" for count : put count get mark sum := sum + mark end for put "Average is ", round (sum / 5) *Taken from Introduction to Programming in Turing by J. N. P. Hume In this program that reads marks int is given the value 1 the first time the is executed and goes on until it reaches 5. Another way to assign the value of int is to write This gives the start trough the end value. You cannot use this type of counter outside a because count would not be available under the end for (refer to glossary) statement. In the execution screen when the users enter the marks they are read by the get

7 (refer to glossary) statement and counter value is assigned on each line. If the user decides to enter all his or her marks on one line then the execution screen would be like this. *Note: get statement does not read all marks until they are entered. Enter 5 marks Average is 73 *Taken from Introduction to Programming in Turing by J. N. P. Hume When writing program codes that use for statements it is recommended not to use the number 5. If you use 5 then you should declare a constant such as nummarks. This means the code would be different. % The "ComputeAverages" program % Reads marks and computes average var mark : int var sum : int := 0 const nummarks := 5 put "Enter", nummarks, marks for i: 1.. nummarks put count get mark sum := sum + mark end for put "Average is ", round (sum / nummarks) *Taken from Introduction to Programming in Turing by J. N. P. Hume If you wanted to make other modifications to this program you could change anything you like. If you were to increase the index in The Compute Averages" program then you would have to use by clause (refer to glossary). This clause will increase any value greater then 1. Run this example that has a by clause. for count : by 2 *Taken put count from Introduction to Programming in Turing by J. N. P. Hume end for In the above program the index increases by 2 but if the value is greater then 10 then the will exit it self. When using for decreasing (refer to glossary) in counted s you are counting backwards. Use for decreasing when counting backwards. Example program that counts backward.

8 for decreasing count: body of... end for Exiting A Loop In order to exit a you will have to use an exit when statement. This helps the user exit the when he or she is done inputting values. For more information about any type of s please refer to the glossary. Examples of Repetition and Their Results This page will show several examples of repetition questions and their answers. Hopefully, these examples will help you better understand repetition.

9 1. Positive integers are to be gathered from the keyboard. When a nonpositive integer is encountered, the count and sum of all the positive integers is to be displayed. Write a simple program to accomplish this task. var integer : int var sumofinteger : int integercount := integercount + 1 end if var integercount : int integercount := 0 sumofinteger := 0 end exit when integer <= 0 put "Enter any random integer?".. get integer if integer > 0 then put skip, "The sum of the integers is : ", sumofinteger put skip, "The Total number of positive integers is : ", integercount sumofinteger := sumofinteger + integer 2. Gather a set of marks, and display their mean. var mark : real var count : int var mean : real

10 var sum : real count := 0 sum := 0 else mean := 0 end if put skip, "Count : ", count put "Mean : ", mean :0:1 put "Mark?".. get mark exit when mark < 0 sum := sum + mark count := count + 1 end if count not = 0 then mean := sum/count 3. Display the integers from 0 to 13. var integer : int integer := 0 put "These are the following integers from 0-13"..

11 put skip, 0 integer := integer + 1 delay(1000) exit when integer >=13 end put skip, "Those are the integers from zero to 13".. put skip, integer.. 4. Gather an integer, and display its time-tables from 0 to 13. var integer : int var product : int put "Enter an integer from 1-13 ".. get integer product := integer * 1 product := integer * 2 product := integer * 3 product := integer * 4 product := integer * 5 product := integer * 6 product := integer * 7 product :=integer * 8 product := integer * 9 product := integer * 10 product := integer * 11 product := integer * 12 product := integer * 13

12 exit when product = integer *13 end. 5. Display the numbers 1 to 15, each in a different colour. var colournumber : int colournumber := 0 colour (colournumber) put "This is the colour", colournumber exit when colournumber >= 15 colournumber := colournumber + 1 delay (1000) end 6. Gather the user s name and display a never ending amount of Greeting followed by the user s name. var fullname : string put "What is your full name? "

13 get fullname put "Greetings,", fullname end 7. Display a user-specified character in a never-ending pattern of diagonals. const DELAY := 100 var row : int var column : int var character : string var rowchange : int var columnchange : int row := 1 column := 1 columnchange := 1 rowchange := 1 put "Enter any character" get character cls 8. var rowsleft := 80 var columnleft := 25 var rows := 1 locate (row, column) put character.. delay (DELAY) row := row + rowchange column := column + columnchange if row <= 1 or row >= maxrow then rowchange := - rowchange end if if column <= 1 or column >= maxcol then columnchange := - columnchange end if end var columns := 1 var character : char put "Enter any Character "

14 get character cls for j : for decreasing i : rowsleft.. j colourback (blue) delay (20) locate (columnleft, i) for i : j.. rowsleft put character.. colourback (blue) delay (20) end for put character.. end for for i : j.. columnleft colourback (blue) delay (20) locate (i, rowsleft) put character.. for decreasing i : columnleft.. j colourback (blue) delay (20) locate (i, j) put character.. end for columnleft := columnleft - 1 rowsleft := rowsleft - 1 end for end for

15 Repetition Review Complete the following exercises: 1. Display all the numbers from with a 1-second delay. 2. Get a name and display a birthday message with the name entered. Repeat until asked to stop. 3. Display the message This is a 20 times and finish with Done! on a clear screen 4. Get a name and display a greeting message and an option to repeat or exit the program. 5. Display all the numbers from in different colours. Answers: const LIMIT := 255 const DELAY := 1000 var i : int i := 1 put i delay (DELAY) i := i+1 exit when i > LIMIT end const STOP := "stop" var fullname : string put "Enter your full name: " get fullname : * cls exit when fullname = "stop" put "Happy Birthday ", fullname, ", enter a friends' name or type 'stop' to stop the program" end const LIMIT := 255 const DELAY := 1500 var i : int i := colour(i) put i delay (400) i := i-1 exit when i > LIMIT end const LIMIT := 20 const DELAY := 400 var i : int i := 1 delay (DELAY) i := i+1 put "This is a " exit when i > LIMIT end cls put "Done!" const STOP := "stop" var fullname : string put "Enter your full name: " get fullname : * cls put "Hello ", fullname, ", enter a friends' name or type 'stop' to stop the program" exit when fullname = "stop" end

16 Repetition Quiz 1. Display the even numbers from 1-24 with a 1/2 second delay. 2. Recreate this pattern Get a name and repeat it 20 times in different colours. const LIMIT := 24 const DELAY := 500 var i : int i := 2 put i delay (400) i := i+2 exit when i > LIMIT end const DELAY := 1000 var i : string i := "1" put i delay (DELAY) i := i+"1" exit when i > "111111" end var name : string var i : int put "Enter your name: ".. get name i := 1 i := i+1 colour (i) put name exit when i > 20 end

17 Glossary Loop: Repeats itself over and over until told to stop. Exit When: Statement used to exit the when told so. End Loop: Statement that is used to stop the. For Loop: executes a program a specified number of times. Count: Adds one to the amount of numbers Index: Index in Turing is a variable called integer Counter: Tells the program what number to begin at. Integer: Just a number a user/programmer use in some assignments. End For: Ends the for Get: Gets what the user puts in to the program and follows the programmers instructions. By: Tells the user to increase a value. For increasing/ decreasing: Depending on the programmer the integer will either increase or decrease.

18 Credits John: Examples of Repetition Kunal: Repetition Review, Repetition Test, Editing Murid: Cover, Table of Contents, Glossary, History of Turing Zamir: Loops Special Thanks to Mr. Arkin for some of the examples used in this book And J.N.P. Hume for his guide to Turing.

Loops! Loops! Loops! Lecture 5 COP 3014 Fall September 25, 2017

Loops! Loops! Loops! Lecture 5 COP 3014 Fall September 25, 2017 Loops! Loops! Loops! Lecture 5 COP 3014 Fall 2017 September 25, 2017 Repetition Statements Repetition statements are called loops, and are used to repeat the same code mulitple times in succession. The

More information

Repetition Structures

Repetition Structures Repetition Structures Chapter 5 Fall 2016, CSUS Introduction to Repetition Structures Chapter 5.1 1 Introduction to Repetition Structures A repetition structure causes a statement or set of statements

More information

Condition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution.

Condition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution. Repetition Structures Introduction to Repetition Structures Chapter 5 Spring 2016, CSUS Chapter 5.1 Introduction to Repetition Structures The Problems with Duplicate Code A repetition structure causes

More information

The sequence of steps to be performed in order to solve a problem by the computer is known as an algorithm.

The sequence of steps to be performed in order to solve a problem by the computer is known as an algorithm. CHAPTER 1&2 OBJECTIVES After completing this chapter, you will be able to: Understand the basics and Advantages of an algorithm. Analysis various algorithms. Understand a flowchart. Steps involved in designing

More information

Introduction to Programming in Turing. Input, Output, and Variables

Introduction to Programming in Turing. Input, Output, and Variables Introduction to Programming in Turing Input, Output, and Variables The IPO Model The most basic model for a computer system is the Input-Processing-Output (IPO) Model. In order to interact with the computer

More information

Turing - Java Dictionary A Concise Guide for Translating Turing Constructs and Routines into Java

Turing - Java Dictionary A Concise Guide for Translating Turing Constructs and Routines into Java Turing - Java Dictionary A Concise Guide f Translating Turing Constructs and Routines into Java The following tables are a quick reference comparison of the basic elements of Java, and Turing. This guide

More information

LECTURE 5 Control Structures Part 2

LECTURE 5 Control Structures Part 2 LECTURE 5 Control Structures Part 2 REPETITION STATEMENTS Repetition statements are called loops, and are used to repeat the same code multiple times in succession. The number of repetitions is based on

More information

C++ Data Types. 1 Simple C++ Data Types 2. 3 Numeric Types Integers (whole numbers) Decimal Numbers... 5

C++ Data Types. 1 Simple C++ Data Types 2. 3 Numeric Types Integers (whole numbers) Decimal Numbers... 5 C++ Data Types Contents 1 Simple C++ Data Types 2 2 Quick Note About Representations 3 3 Numeric Types 4 3.1 Integers (whole numbers)............................................ 4 3.2 Decimal Numbers.................................................

More information

Control Structures. Lecture 4 COP 3014 Fall September 18, 2017

Control Structures. Lecture 4 COP 3014 Fall September 18, 2017 Control Structures Lecture 4 COP 3014 Fall 2017 September 18, 2017 Control Flow Control flow refers to the specification of the order in which the individual statements, instructions or function calls

More information

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 18 Switch Statement (Contd.) And Introduction to

More information

Laboratory 2: Programming Basics and Variables. Lecture notes: 1. A quick review of hello_comment.c 2. Some useful information

Laboratory 2: Programming Basics and Variables. Lecture notes: 1. A quick review of hello_comment.c 2. Some useful information Laboratory 2: Programming Basics and Variables Lecture notes: 1. A quick review of hello_comment.c 2. Some useful information 3. Comment: a. name your program with extension.c b. use o option to specify

More information

Review. Primitive Data Types & Variables. String Mathematical operators: + - * / % Comparison: < > <= >= == int, long float, double boolean char

Review. Primitive Data Types & Variables. String Mathematical operators: + - * / % Comparison: < > <= >= == int, long float, double boolean char Review Primitive Data Types & Variables int, long float, double boolean char String Mathematical operators: + - * / % Comparison: < > = == 1 1.3 Conditionals and Loops Introduction to Programming in

More information

COMP 202 Java in one week

COMP 202 Java in one week COMP 202 Java in one week... Continued CONTENTS: Return to material from previous lecture At-home programming exercises Please Do Ask Questions It's perfectly normal not to understand everything Most of

More information

A very simple program. Week 2: variables & expressions. Declaring variables. Assignments: examples. Initialising variables. Assignments: pattern

A very simple program. Week 2: variables & expressions. Declaring variables. Assignments: examples. Initialising variables. Assignments: pattern School of Computer Science, University of Birmingham. Java Lecture notes. M. D. Ryan. September 2001. A very simple program Week 2: variables & expressions Variables, assignments, expressions, and types.

More information

Computer Programming I - Unit 5 Lecture page 1 of 14

Computer Programming I - Unit 5 Lecture page 1 of 14 page 1 of 14 I. The while Statement while, for, do Loops Note: Loop - a control structure that causes a sequence of statement(s) to be executed repeatedly. The while statement is one of three looping statements

More information

Coordinate Graphing Quadrants and Reading Ordered Pairs. TeacherTwins 2015

Coordinate Graphing Quadrants and Reading Ordered Pairs. TeacherTwins 2015 Coordinate Graphing Quadrants and Reading Ordered Pairs TeacherTwins 2015 Warm Up Graph the integers on a number line. 1. 2. 3. 4. 5. -5, - 2, 5, 2 0, -3, 7, -2-4, 1, -6, 8-1, 4, -7, 0 6, -8, 5, -4 Warm

More information

Ms. Payne, WCSS. This is very much like asking a question, and having a yes/no answer (also known a true/false). The general structure for this is:

Ms. Payne, WCSS. This is very much like asking a question, and having a yes/no answer (also known a true/false). The general structure for this is: The Decision Structure The repetition (looping) structure discussed previously is a very important structure because it allows the programmer to instruct the computer to do something more than once. The

More information

GOZO COLLEGE. Boys Secondary Victoria - Gozo, Malta Ninu Cremona. Half Yearly Examination

GOZO COLLEGE. Boys Secondary Victoria - Gozo, Malta Ninu Cremona. Half Yearly Examination GOZO COLLEGE Boys Secondary Victoria - Gozo, Malta Ninu Cremona Half Yearly Examination 2010 2011 Subject: Form: Time: COMPUTER STUDIES 4 Junior Lyceum 1 hr 30 min NAME: CLASS: INDEX NO: Instructions to

More information

Looping Subtasks. We will examine some basic algorithms that use the while and if constructs. These subtasks include

Looping Subtasks. We will examine some basic algorithms that use the while and if constructs. These subtasks include 1 Programming in C Looping Subtasks We will examine some basic algorithms that use the while and if constructs. These subtasks include Reading unknown quantity of data Counting things Accumulating (summing)

More information

Lecture 05 I/O statements Printf, Scanf Simple statements, Compound statements

Lecture 05 I/O statements Printf, Scanf Simple statements, Compound statements Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 05 I/O statements Printf, Scanf Simple

More information

Arrays and Other Data Types

Arrays and Other Data Types 241 Chapter 14 Arrays and Other Data Types 14.1 Array Data Types 14.2 Manipulating Lists 14.3 When to Use an Array 14.4 Initialization of Arrays 14.5 Sorting an Array 14.6 Related Lists 14.7 Subrange Data

More information

Variables and Constants

Variables and Constants 87 Chapter 5 Variables and Constants 5.1 Storing Information in the Computer 5.2 Declaring Variables 5.3 Inputting Character Strings 5.4 Mistakes in Programs 5.5 Inputting Numbers 5.6 Inputting Real Numbers

More information

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal Lesson Goals Understand Control Structures Understand how to control the flow of a program

More information

3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition)

3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition) Structures Programming in C++ Sequential Branching Repeating Loops (Repetition) 2 1 Loops Repetition is referred to the ability of repeating a statement or a set of statements as many times this is necessary.

More information

Grade 7/8 Math Circles. Counting I

Grade 7/8 Math Circles. Counting I Faculty of Mathematics Waterloo, Ontario N2L 3G1 Counting Grade 7/8 Math Circles February 13, 2014 Counting I Centre for Education in Mathematics and Computing Counting in mathematics is the process of

More information

Arrays: Higher Dimensional Arrays. CS0007: Introduction to Computer Programming

Arrays: Higher Dimensional Arrays. CS0007: Introduction to Computer Programming Arrays: Higher Dimensional Arrays CS0007: Introduction to Computer Programming Review If the == operator has two array variable operands, what is being compared? The reference variables held in the variables.

More information

ECE 122. Engineering Problem Solving with Java

ECE 122. Engineering Problem Solving with Java ECE 122 Engineering Problem Solving with Java Lecture 10 For Loops and Arrays Outline Problem: How can I perform the same operations a fixed number of times? Considering for loops Performs same operations

More information

Logic is the anatomy of thought. John Locke ( ) This sentence is false.

Logic is the anatomy of thought. John Locke ( ) This sentence is false. Logic is the anatomy of thought. John Locke (1632 1704) This sentence is false. I know that I know nothing. anonymous Plato (In Apology, Plato relates that Socrates accounts for his seeming wiser than

More information

Sequence structure. The computer executes java statements one after the other in the order in which they are written. Total = total +grade;

Sequence structure. The computer executes java statements one after the other in the order in which they are written. Total = total +grade; Control Statements Control Statements All programs could be written in terms of only one of three control structures: Sequence Structure Selection Structure Repetition Structure Sequence structure The

More information

Controls Structure for Repetition

Controls Structure for Repetition Controls Structure for Repetition So far we have looked at the if statement, a control structure that allows us to execute different pieces of code based on certain conditions. However, the true power

More information

Control Flow. COMS W1007 Introduction to Computer Science. Christopher Conway 3 June 2003

Control Flow. COMS W1007 Introduction to Computer Science. Christopher Conway 3 June 2003 Control Flow COMS W1007 Introduction to Computer Science Christopher Conway 3 June 2003 Overflow from Last Time: Why Types? Assembly code is typeless. You can take any 32 bits in memory, say this is an

More information

Chapter 8 Statement-Level Control Structure

Chapter 8 Statement-Level Control Structure Chapter 8 Statement-Level Control Structure To make programs more flexible and powerful: Some means of selecting among alternative control flow paths. Selection statement (conditional statements) Unconditional

More information

CS313D: ADVANCED PROGRAMMING LANGUAGE

CS313D: ADVANCED PROGRAMMING LANGUAGE CS313D: ADVANCED PROGRAMMING LANGUAGE Computer Science department Lecture 2 : C# Language Basics Lecture Contents 2 The C# language First program Variables and constants Input/output Expressions and casting

More information

Informatica e Sistemi in Tempo Reale

Informatica e Sistemi in Tempo Reale Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 5, 2011 G. Lipari (Scuola Superiore Sant Anna) Introduction

More information

Fundamentals of Programming

Fundamentals of Programming Fundamentals of Programming Introduction to the C language Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 29, 2012 G. Lipari (Scuola Superiore Sant Anna) The C language

More information

5. Control Statements

5. Control Statements 5. Control Statements This section of the course will introduce you to the major control statements in C++. These control statements are used to specify the branching in an algorithm/recipe. Control statements

More information

More about Loops and Decisions

More about Loops and Decisions More about Loops and Decisions 5 In this chapter, we continue to explore the topic of repetition structures. We will discuss how loops are used in conjunction with the other control structures sequence

More information

Multiple Choice (Questions 1 13) 26 Points Select all correct answers (multiple correct answers are possible)

Multiple Choice (Questions 1 13) 26 Points Select all correct answers (multiple correct answers are possible) Name Closed notes, book and neighbor. If you have any questions ask them. Notes: Segment of code necessary C++ statements to perform the action described not a complete program Program a complete C++ program

More information

Repetition Structures II

Repetition Structures II Lecture 9 Repetition Structures II For and do-while loops CptS 121 Summer 2016 Armen Abnousi Types of Control Structures Sequential All programs that we have written so far The statements inside a pair

More information

Problem Solving With Loops

Problem Solving With Loops To appreciate the value of loops, take a look at the following example. This program will calculate the average of 10 numbers input by the user. Without a loop, the three lines of code that prompt the

More information

Lecture Programming in C++ PART 1. By Assistant Professor Dr. Ali Kattan

Lecture Programming in C++ PART 1. By Assistant Professor Dr. Ali Kattan Lecture 08-1 Programming in C++ PART 1 By Assistant Professor Dr. Ali Kattan 1 The Conditional Operator The conditional operator is similar to the if..else statement but has a shorter format. This is useful

More information

CIS Introduction to Computer Programming Spring Exam 1

CIS Introduction to Computer Programming Spring Exam 1 CIS 110 - Introduction to Computer Programming Spring 2017 - Exam 1 Name: Recitation (e.g. 201): PennKey (e.g. eeaton): My signature below certifies that I have complied with the University of Pennsylvania

More information

1 class Lecture3 { 2 3 "Selections" // Keywords 8 if, else, else if, switch, case, default. Zheng-Liang Lu Java Programming 88 / 133

1 class Lecture3 { 2 3 Selections // Keywords 8 if, else, else if, switch, case, default. Zheng-Liang Lu Java Programming 88 / 133 1 class Lecture3 { 2 3 "Selections" 4 5 } 6 7 // Keywords 8 if, else, else if, switch, case, default Zheng-Liang Lu Java Programming 88 / 133 Flow Controls The basic algorithm (and program) is constituted

More information

Lecture 7: General Loops (Chapter 7)

Lecture 7: General Loops (Chapter 7) CS 101: Computer Programming and Utilization Jul-Nov 2017 Umesh Bellur (cs101@cse.iitb.ac.in) Lecture 7: General Loops (Chapter 7) The Need for a More General Loop Read marks of students from the keyboard

More information

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal Lesson Goals Understand Control Structures Understand how to control the flow of a program

More information

B.V. Patel Institute of Business Management, Computer & Information Technology, Uka Tarsadia University

B.V. Patel Institute of Business Management, Computer & Information Technology, Uka Tarsadia University Unit 1 Programming Language and Overview of C 1. State whether the following statements are true or false. a. Every line in a C program should end with a semicolon. b. In C language lowercase letters are

More information

Chapter 4: Control structures. Repetition

Chapter 4: Control structures. Repetition Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition

More information

CSE 1223: Exam II Autumn 2016

CSE 1223: Exam II Autumn 2016 CSE 1223: Exam II Autumn 2016 Name: Instructions: Do not open the exam before you are told to begin. This exam is closed book, closed notes. You may not use any calculators or any other kind of computing

More information

COMP 202 Java in one week

COMP 202 Java in one week CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator COMP 202 Java in one week The Java Programming Language A programming language

More information

Chapter 4 Introduction to Control Statements

Chapter 4 Introduction to Control Statements Introduction to Control Statements Fundamentals of Java: AP Computer Science Essentials, 4th Edition 1 Objectives 2 How do you use the increment and decrement operators? What are the standard math methods?

More information

Java. Programming: Chapter Objectives. Why Is Repetition Needed? Chapter 5: Control Structures II. Program Design Including Data Structures

Java. Programming: Chapter Objectives. Why Is Repetition Needed? Chapter 5: Control Structures II. Program Design Including Data Structures Chapter 5: Control Structures II Java Programming: Program Design Including Data Structures Chapter Objectives Learn about repetition (looping) control structures Explore how to construct and use count-controlled,

More information

Michele Van Dyne Museum 204B CSCI 136: Fundamentals of Computer Science II, Spring

Michele Van Dyne Museum 204B  CSCI 136: Fundamentals of Computer Science II, Spring Michele Van Dyne Museum 204B mvandyne@mtech.edu http://katie.mtech.edu/classes/csci136 CSCI 136: Fundamentals of Computer Science II, Spring 2016 1 Review of Java Basics Data Types Arrays NEW: multidimensional

More information

CS112 Lecture: Loops

CS112 Lecture: Loops CS112 Lecture: Loops Objectives: Last revised 3/11/08 1. To introduce some while loop patterns 2. To introduce and motivate the java do.. while loop 3. To review the general form of the java for loop.

More information

Increment and the While. Class 15

Increment and the While. Class 15 Increment and the While Class 15 Increment and Decrement Operators Increment and Decrement Increase or decrease a value by one, respectively. the most common operation in all of programming is to increment

More information

CHAPTER 6 DECISIONS AND REPETITIONS: BASIC ACTIVITIES IN PROGRAMS

CHAPTER 6 DECISIONS AND REPETITIONS: BASIC ACTIVITIES IN PROGRAMS CHAPTER 6 DECISIONS AND REPETITIONS: BASIC ACTIVITIES IN PROGRAMS So far, our programs have been made of statements that declare variables, assignment statements, input statements, and output statements.

More information

Arrays (& strings) Ch 7

Arrays (& strings) Ch 7 Arrays (& strings) Ch 7 Announcements Quiz scores on gradescope Test next week (whole class period) Highlights - arrays - 2D arrays - string functions - arrays and functions string We have been using strings

More information

Computer Science Papers 1, 2 and 3

Computer Science Papers 1, 2 and 3 Pearson Edexcel Level 1/Level 2 GCSE (9 1) Computer Science Papers 1, 2 and 3 Sample assessment material for first teaching September 2016 Pseudo-code command set Paper Reference 1CP1/01 1CP1/02 1CP1/3A-3E

More information

COMP 202. Java in one week

COMP 202. Java in one week COMP 202 CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator Java in one week The Java Programming Language A programming language

More information

Condi(onals and Loops

Condi(onals and Loops Condi(onals and Loops 1 Review Primi(ve Data Types & Variables int, long float, double boolean char String Mathema(cal operators: + - * / % Comparison: < > = == 2 A Founda(on for Programming any program

More information

Introduction. C provides two styles of flow control:

Introduction. C provides two styles of flow control: Introduction C provides two styles of flow control: Branching Looping Branching is deciding what actions to take and looping is deciding how many times to take a certain action. Branching constructs: if

More information

Chapter 4: Control structures

Chapter 4: Control structures Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition

More information

Lesson 6A Loops. By John B. Owen All rights reserved 2011, revised 2014

Lesson 6A Loops. By John B. Owen All rights reserved 2011, revised 2014 Lesson 6A Loops By John B. Owen All rights reserved 2011, revised 2014 Topic List Objectives Loop structure 4 parts Three loop styles Example of a while loop Example of a do while loop Comparison while

More information

What did we talk about last time? Examples switch statements

What did we talk about last time? Examples switch statements Week 4 - Friday What did we talk about last time? Examples switch statements History of computers Hardware Software development Basic Java syntax Output with System.out.print() Mechanical Calculation

More information

Programming Lecture 4

Programming Lecture 4 Five-Minute Review 1. What are classes and objects? What is a class hierarchy? 2. What is an expression? A term? 3. What is a variable declaration? 4. What is an assignment? What is precedence? 5. What

More information

Structured Programming. Flowchart Symbols. Structured Programming. Selection. Sequence. Control Structures ELEC 330 1

Structured Programming. Flowchart Symbols. Structured Programming. Selection. Sequence. Control Structures ELEC 330 1 ELEC 330 1 Structured Programming Control Structures ELEC 206 Computer Applications for Electrical Engineers Dr. Ron Hayne Algorithm Development Conditional Expressions Selection Statements Loops 206_C3

More information

Basic computer skills such as using Windows, Internet Explorer, and Microsoft Word. Chapter 1 Introduction to Computers, Programs, and Java

Basic computer skills such as using Windows, Internet Explorer, and Microsoft Word. Chapter 1 Introduction to Computers, Programs, and Java Basic computer skills such as using Windows, Internet Explorer, and Microsoft Word Chapter 1 Introduction to Computers, Programs, and Java Chapter 2 Primitive Data Types and Operations Chapter 3 Selection

More information

More on control structures

More on control structures Lecture slides for: Chapter 5 More on control structures Java Actually: A Comprehensive Primer in Programming Khalid Azim Mughal, Torill Hamre, Rolf W. Rasmussen Cengage Learning, 2008. ISBN: 978-1-844480-933-2

More information

CPE 112 Spring 2015 Exam II (100 pts) March 4, Definition Matching (8 Points)

CPE 112 Spring 2015 Exam II (100 pts) March 4, Definition Matching (8 Points) Name Definition Matching (8 Points) 1. (8 pts) Match the words with their definitions. Choose the best definition for each word. Relational Expression Iteration Counter Count-controlled loop Loop Flow

More information

Intro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming

Intro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming Intro to Programming Unit 7 Intro to Programming 1 What is Programming? 1. Programming Languages 2. Markup vs. Programming 1. Introduction 2. Print Statement 3. Strings 4. Types and Values 5. Math Externals

More information

Review: Exam 1. Your First C++ Program. Declaration Statements. Tells the compiler. Examples of declaration statements

Review: Exam 1. Your First C++ Program. Declaration Statements. Tells the compiler. Examples of declaration statements Review: Exam 1 9/20/06 CS150 Introduction to Computer Science 1 1 Your First C++ Program 1 //*********************************************************** 2 // File name: hello.cpp 3 // Author: Shereen Khoja

More information

Scanner Objects. Zheng-Liang Lu Java Programming 82 / 133

Scanner Objects. Zheng-Liang Lu Java Programming 82 / 133 Scanner Objects It is not convenient to modify the source code and recompile it for a different radius. Reading from the console enables the program to receive an input from the user. A Scanner object

More information

The action of the program depends on the input We can create this program using an if statement

The action of the program depends on the input We can create this program using an if statement The program asks the user to enter a number If the user enters a number greater than zero, the program displays a message: You entered a number greater than zero Otherwise, the program does nothing The

More information

Java Programming: Guided Learning with Early Objects Chapter 5 Control Structures II: Repetition

Java Programming: Guided Learning with Early Objects Chapter 5 Control Structures II: Repetition Java Programming: Guided Learning with Early Objects Chapter 5 Control Structures II: Repetition Learn about repetition (looping) control structures Explore how to construct and use: o Counter-controlled

More information

A First Program - Greeting.cpp

A First Program - Greeting.cpp C++ Basics A First Program - Greeting.cpp Preprocessor directives Function named main() indicates start of program // Program: Display greetings #include using namespace std; int main() { cout

More information

St. Edmund Preparatory High School Brooklyn, NY

St. Edmund Preparatory High School Brooklyn, NY AP Computer Science Mr. A. Pinnavaia Summer Assignment St. Edmund Preparatory High School Name: I know it has been about 7 months since you last thought about programming. It s ok. I wouldn t want to think

More information

3 The L oop Control Structure

3 The L oop Control Structure 3 The L oop Control Structure Loops The while Loop Tips and Traps More Operators The for Loop Nesting of Loops Multiple Initialisations in the for Loop The Odd Loop The break Statement The continue Statement

More information

All copyrights reserved - KV NAD, Aluva. Dinesh Kumar Ram PGT(CS) KV NAD Aluva

All copyrights reserved - KV NAD, Aluva. Dinesh Kumar Ram PGT(CS) KV NAD Aluva All copyrights reserved - KV NAD, Aluva Dinesh Kumar Ram PGT(CS) KV NAD Aluva Overview Looping Introduction While loops Syntax Examples Points to Observe Infinite Loops Examples using while loops do..

More information

1 class Lecture3 { 2 3 "Selections" // Keywords 8 if, else, else if, switch, case, default. Zheng-Liang Lu Java Programming 89 / 137

1 class Lecture3 { 2 3 Selections // Keywords 8 if, else, else if, switch, case, default. Zheng-Liang Lu Java Programming 89 / 137 1 class Lecture3 { 2 3 "Selections" 4 5 } 6 7 // Keywords 8 if, else, else if, switch, case, default Zheng-Liang Lu Java Programming 89 / 137 Flow Controls The basic algorithm (and program) is constituted

More information

Computer Programming. Basic Control Flow - Loops. Adapted from C++ for Everyone and Big C++ by Cay Horstmann, John Wiley & Sons

Computer Programming. Basic Control Flow - Loops. Adapted from C++ for Everyone and Big C++ by Cay Horstmann, John Wiley & Sons Computer Programming Basic Control Flow - Loops Adapted from C++ for Everyone and Big C++ by Cay Horstmann, John Wiley & Sons Objectives To learn about the three types of loops: while for do To avoid infinite

More information

ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59)

ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59) ASSIGNMENT 2 COMP-202A, Fall 2013, All Sections Due: October 20 th, 2013 (23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified, you

More information

Programming. C++ Basics

Programming. C++ Basics Programming C++ Basics Introduction to C++ C is a programming language developed in the 1970s with the UNIX operating system C programs are efficient and portable across different hardware platforms C++

More information

Repetition CSC 121 Fall 2014 Howard Rosenthal

Repetition CSC 121 Fall 2014 Howard Rosenthal Repetition CSC 121 Fall 2014 Howard Rosenthal Lesson Goals Learn the following three repetition methods, their similarities and differences, and how to avoid common errors when using them: while do-while

More information

Quick Reference Guide

Quick Reference Guide SOFTWARE AND HARDWARE SOLUTIONS FOR THE EMBEDDED WORLD mikroelektronika Development tools - Books - Compilers Quick Reference Quick Reference Guide with EXAMPLES for Pascal language This reference guide

More information

Looping and Counting. Lecture 3 Hartmut Kaiser hkaiser/fall_2012/csc1254.html

Looping and Counting. Lecture 3 Hartmut Kaiser  hkaiser/fall_2012/csc1254.html Looping and Counting Lecture 3 Hartmut Kaiser hkaiser@cct.lsu.edu http://www.cct.lsu.edu/ hkaiser/fall_2012/csc1254.html Abstract First we ll discuss types and type safety. Then we will modify the program

More information

CSE 131 Introduction to Computer Science Fall 2016 Exam I. Print clearly the following information:

CSE 131 Introduction to Computer Science Fall 2016 Exam I. Print clearly the following information: CSE 131 Introduction to Computer Science Fall 2016 Given: 29 September 2016 Exam I Due: End of Exam Session This exam is closed-book, closed-notes, no electronic devices allowed The exception is the "sage

More information

Programming Fundamentals

Programming Fundamentals Programming Fundamentals Computers are really very dumb machines -- they only do what they are told to do. Most computers perform their operations on a very primitive level. The basic operations of a computer

More information

Repetition Algorithms

Repetition Algorithms Repetition Algorithms Repetition Allows a program to execute a set of instructions over and over. The term loop is a synonym for a repetition statement. A Repetition Example Suppose that you have been

More information

Course Outline Introduction to C-Programming

Course Outline Introduction to C-Programming ECE3411 Fall 2015 Lecture 1a. Course Outline Introduction to C-Programming Marten van Dijk, Syed Kamran Haider Department of Electrical & Computer Engineering University of Connecticut Email: {vandijk,

More information

CS112 Lecture: Repetition Statements

CS112 Lecture: Repetition Statements CS112 Lecture: Repetition Statements Objectives: Last revised 2/18/05 1. To explain the general form of the java while loop 2. To introduce and motivate the java do.. while loop 3. To explain the general

More information

CS1100 Introduction to Programming

CS1100 Introduction to Programming Decisions with Variables CS1100 Introduction to Programming Selection Statements Madhu Mutyam Department of Computer Science and Engineering Indian Institute of Technology Madras Course Material SD, SB,

More information

York University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes

York University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes York University AK/ITEC 1620 3.0 OBJECT-BASED PROGRAMMING Midterm Test Sample Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes This exam is closed textbook(s) and closed notes. Use of any electronic

More information

Text Input and Conditionals

Text Input and Conditionals Text Input and Conditionals Text Input Many programs allow the user to enter information, like a username and password. Python makes taking input from the user seamless with a single line of code: input()

More information

C introduction: part 1

C introduction: part 1 What is C? C is a compiled language that gives the programmer maximum control and efficiency 1. 1 https://computer.howstuffworks.com/c1.htm 2 / 26 3 / 26 Outline Basic file structure Main function Compilation

More information

Looping and Counting. Lecture 3. Hartmut Kaiser hkaiser/fall_2011/csc1254.html

Looping and Counting. Lecture 3. Hartmut Kaiser  hkaiser/fall_2011/csc1254.html Hartmut Kaiser hkaiser@cct.lsu.edu http://www.cct.lsu.edu/ hkaiser/fall_2011/csc1254.html 2 Abstract First we ll discuss types and type safety. Then we will modify the program we developed last time (Framing

More information

BCA-105 C Language What is C? History of C

BCA-105 C Language What is C? History of C C Language What is C? C is a programming language developed at AT & T s Bell Laboratories of USA in 1972. It was designed and written by a man named Dennis Ritchie. C seems so popular is because it is

More information

C++ Basics. Data Processing Course, I. Hrivnacova, IPN Orsay

C++ Basics. Data Processing Course, I. Hrivnacova, IPN Orsay C++ Basics Data Processing Course, I. Hrivnacova, IPN Orsay The First Program Comments Function main() Input and Output Namespaces Variables Fundamental Types Operators Control constructs 1 C++ Programming

More information

Chapter 2 - Control Structures

Chapter 2 - Control Structures Chapter 2 - Control Structures 1 Outline 2.1 Introduction 2.2 Algorithms 2.3 Pseudocode 2.4 Control Structures 2.5 if Selection Structure 2.6 if/else Selection Structure 2.7 while Repetition Structure

More information

CS 101 Fall 2006 Midterm 1 Name: ID:

CS 101 Fall 2006 Midterm 1 Name:  ID: You only need to write your name and e-mail ID on the first page. This exam is CLOSED text book, closed-notes, closed-calculator, closed-neighbor, etc. Questions are worth different amounts, so be sure

More information

Computer Programming

Computer Programming Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty Department of Computer Science and Engineering Session: for statement in C++ Dr. Deepak B. Phatak & Dr. Supratik Chakraborty, 1 Quick Recap

More information

BASIC ELEMENTS OF A COMPUTER PROGRAM

BASIC ELEMENTS OF A COMPUTER PROGRAM BASIC ELEMENTS OF A COMPUTER PROGRAM CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING LOGO Contents 1 Identifier 2 3 Rules for naming and declaring data variables Basic data types 4 Arithmetic operators

More information