Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 13-2 Control Structures Conditional.

Slides:



Advertisements
Similar presentations
Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional.
Advertisements

Control Structures Corresponds with Chapters 3 and 4.
Selection Statements Selects statements to execute based on the value of an expression The expression is sometimes called the controlling expression Selection.
Problem Solving and Program Design in C (5th Edition) by Jeri R. Hanly and Elliot B. Koffman Chapter 4 (Conditional Statements) © CPCS
Computer Science 1620 Loops.
CS 106 Introduction to Computer Science I 02 / 12 / 2007 Instructor: Michael Eckmann.
1 Introduction to “C” Control Loops and Functions Patt and Patel Ch. 13 & 14.
Loops – While, Do, For Repetition Statements Introduction to Arrays
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Java Software Solutions Foundations of Program Design Sixth Edition by Lewis.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Chapter 6 Repetition Statements.
Control Structures Control structures control the flow of program execution. 3 types of control structures: sequence, selection.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Chapter 6 Repetition Statements.
© 2004 Pearson Addison-Wesley. All rights reserved5-1 Iterations/ Loops The while Statement Other Repetition Statements.
C++ for Engineers and Scientists Third Edition
©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 6: Repetition  Some additional operators increment and decrement.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Repetition Statements.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Chapter 6 Repetition Statements.
©The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4 th Ed Chapter Chapter 6 Repetition Statements.
1 Lecture 5  More flow control structures  for  do  continue  break  switch  Structured programming  Common programming errors and tips  Readings:
ספטמבר 04Copyright Meir Kalech1 C programming Language Chapter 2: Control Flow.
CONTROL STATEMENTS Lakhbir Singh(Lect.IT) S.R.S.G.P.C.G. Ludhiana.
Section 3 - Selection and Repetition Constructs. Control Structures 1. Sequence 2. Selection 3. Repetition.
Outlines Chapter 3 –Chapter 3 – Loops & Revision –Loops while do … while – revision 1.
Lecture 10: Reviews. Control Structures All C programs written in term of 3 control structures Sequence structures Programs executed sequentially by default.
Chapter 4: Decision Making with Control Structures and Statements JavaScript - Introductory.
C++ Programming: From Problem Analysis to Program Design, Third Edition Chapter 4: Control Structures I (Selection)
Principles of Programming - NI July Chapter 5: Structured Programming In this chapter you will learn about: Sequential structure Selection structure.
CSEB 114: PRINCIPLE OF PROGRAMMING Chapter 5: Structured Programming.
Chapter 3 Control Flow Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh University.
Lecture 8: Choosing the Correct Loop. do … while Repetition Statement Similar to the while statement Condition for repetition only tested after the body.
CMPE13Cyrus Bazeghi Chapter 13 C Control Structures.
Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional making.
Repetitive Structures BBS514 Structured Programming (Yapısal Programlama)1.
Flow of Control Part 1: Selection
Mr. Dave Clausen1 La Cañada High School Chapter 6: Repetition Statements.
1 Flowchart notation and loops Implementation of loops in C –while loops –do-while loops –for loops Auxiliary Statements used inside the loops –break –continue.
Copyright © Nancy Acemian 2004 For Loops-Break-Continue COMP For loop is a counter controlled loop. For loop is a pretest loop. Used when number.
Chapter 8 Iteration Dept of Computer Engineering Khon Kaen University.
Chapter 5: Structured Programming
Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 4: Making Decisions.
Chapter 5: Structured Programming
 2000 Deitel & Associates, Inc. All rights reserved. Chapter 10 - JavaScript/JScript: Control Structures II Outline 10.1Introduction 10.2Essentials of.
Chapter 15 JavaScript: Part III The Web Warrior Guide to Web Design Technologies.
Loops cause a section of a program to be repeated a certain number of times. The repetition continues while a condition remains true. When a condition.
Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 5: Looping.
Decision Making and Branching (cont.)
Repetition Repetition allows you to repeat an operation or a series of operations many times. This is called looping and is one of the basic structured.
1 Programming in C++ Dale/Weems/Headington Chapter 9 Additional Control Structures (Switch, Do..While, For statements)
A First Book of C++ Chapter 4 Selection. Objectives In this chapter, you will learn about: –Relational Expressions –The if-else Statement –Nested if Statements.
Chapter Looping 5. The Increment and Decrement Operators 5.1.
Beginning C For Engineers Fall 2005 Lecture 3: While loops, For loops, Nested loops, and Multiple Selection Section 2 – 9/14/05 Section 4 – 9/15/05 Bettina.
Copyright © 2015, 2012, 2009 Pearson Education, Inc., Publishing as Addison-Wesley All rights reserved. Chapter 4: Making Decisions 1.
Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)
Chapter Looping 5. The Increment and Decrement Operators 5.1.
Lecture 3.1 Operators and Expressions Structured Programming Instructor: Prof. K. T. Tsang 1.
BIL 104E Introduction to Scientific and Engineering Computing Lecture 6.
A First Book of C++ Chapter 4 Selection.
Chapter 5: Structured Programming
REPETITION CONTROL STRUCTURE
Chapter 12 Variables and Operators
Control Structures Lecture 7.
Chapter 13 Control Structures
Looping.
MSIS 655 Advanced Business Applications Programming
CS1100 Computational Engineering
Chapter 13 Control Structures
Exam 1 Date: Feb. 2nd, 2015 during class time (50 minutes) Coverage
Flow of Control.
Chapter 13 Control Structures
Presentation transcript:

Chapter 13 Control Structures

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional making a decision about which code to execute, based on evaluated expression if if-else switch Iteration executing code multiple times, ending based on evaluated expression while for do-while

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display If if (condition) action; condition action T F Condition is a C expression, which evaluates to TRUE (non-zero) or FALSE (zero). Action is a C statement, which may be simple or compound (a block).

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Example If Statements if (x <= 10) y = x * x + 5; if (x <= 10) { y = x * x + 5; z = (2 * y) / 3; } if (x <= 10) y = x * x + 5; z = (2 * y) / 3; compound statement; both executed if x <= 10 only first statement is conditional; second statement is always executed

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display More If Examples if (0 <= age && age <= 11) kids += 1; if (month == 4 || month == 6 || month == 9 || month == 11) printf(“The month has 30 days.\n”); if (x = 2) y = 5; This is a common programming error (= instead of ==), not caught by compiler because it’s syntactically correct. always true, so action is always executed!

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display If’s Can Be Nested if (x == 3) if (y != 6) { z = z + 1; w = w + 2; } if ((x == 3) && (y != 6)) { z = z + 1; w = w + 2; } is the same as...

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Generating Code for If Statement ; if (x == 2) y = 5; LDR R0, R6, #3 ; load x into R0 ADD R0, R0, #-2 ; subtract 2 BRnp NOT_TRUE ; if non-zero, x is not 2 AND R1, R1, #0 ; store 5 to y ADD R1, R1, #5 STR R1, R6, #4 NOT_TRUE... ; next statement

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display If-else if (condition) action_if; else action_else; condition action_ifaction_else TF Else allows choice between two mutually exclusive actions without re-testing condition.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Generating Code for If-Else if (x) { y++; z--; } else { y--; z++; } LDR R0, R6, #3 BRz ELSE ; x is not zero LDR R1, R6, #4 ; incr y ADD R1, R1, #1 STR R1, R6, #4 LDR R1, R6, #5 ; decr z ADD R1, R1, #1 STR R1, R6, #5 JMP DONE ; skip else code ; x is zero ELSE LDR R1, R6, #4 ; decr y ADD R1, R1, #-1 STR R1, R6, #4 LDR R1, R6, #5 ; incr z ADD R1, R1, #1 STR R1, R6, #5 DONE... ; next statement

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Matching Else with If Else is always associated with closest unassociated if. if (x != 10) if (y > 3) z = z / 2; else z = z * 2; if (x != 10) { if (y > 3) z = z / 2; else z = z * 2; } is the same as... if (x != 10) { if (y > 3) z = z / 2; } else z = z * 2; is NOT the same as...

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Chaining If’s and Else’s if (month == 4 || month == 6 || month == 9 || month == 11) printf(“Month has 30 days.\n”); else if (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12) printf(“Month has 31 days.\n”); else if (month == 2) printf(“Month has 28 or 29 days.\n”); else printf(“Don’t know that month.\n”);

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Switch switch (expression) { case const1: action1; break; case const2: action2; break; default: action3; } evaluate expression = const1? = const2? action1 action2 action3 T T F F Alternative to long if-else chain. If break is not used, then case "falls through" to the next.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Switch Example /* same as month example for if-else */ switch (month) { case 4: case 6: case 9: case 11: printf(“Month has 30 days.\n”); break; case 1: case 3: /* some cases omitted for brevity...*/ printf(“Month has 31 days.\n”); break; case 2: printf(“Month has 28 or 29 days.\n”); break; default: printf(“Don’t know that month.\n”); }

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display More About Switch Case expressions must be constant. case i: /* illegal if i is a variable */ If no break, then next case is also executed. switch (a) { case 1: printf(“A”); case 2: printf(“B”); default: printf(“C”); } If a is 1, prints “ABC”. If a is 2, prints “BC”. Otherwise, prints “C”.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display While while (test) loop_body; test loop_body T F Executes loop body as long as test evaluates to TRUE (non-zero). Note: Test is evaluated before executing loop body.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Generating Code for While x = 0; while (x < 10) { printf(“%d ”, x); x = x + 1; } AND R0, R0, #0 STR R0, R6, #3 ; x = 0 ; test LOOP LDR R0, R6, #3 ; load x ADD R0, R0, #-10 BRzp DONE ; loop body LDR R0, R6, #3 ; load x ADD R0, R0, #1 ; incr x STR R0, R6, #3 JMP LOOP ; test again DONE ; next statement

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Infinite Loops The following loop will never terminate: x = 0; while (x < 10) printf(“%d ”, x); Loop body does not change condition, so test never fails. This is a common programming error that can be difficult to find.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display For for (init; end-test; re-init) statement init test loop_body re-init F T Executes loop body as long as test evaluates to TRUE (non-zero). Initialization and re-initialization code includedin loop statement. Note: Test is evaluated before executing loop body.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Generating Code for For for (i = 0; i < 10; i++) printf(“%d ”, i); ; init AND R0, R0, #0 STR R0, R6, #3 ; i = 0 ; test LOOP LDR R0, R6, #3 ; load i ADD R0, R0, #-10 BRzp DONE ; loop body LDR R0, R6, #3 ; load i ; re-init ADD R0, R0, #1 ; incr i STR R0, R6, #3 JMP LOOP ; test again DONE ; next statement This is the same as the while example!

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Example For Loops /* -- what is the output of this loop? -- */ for (i = 0; i <= 10; i ++) printf("%d ", i); /* -- what does this one output? -- */ letter = 'a'; for (c = 0; c < 26; c++) printf("%c ", letter+c); /* -- what does this loop do? -- */ numberOfOnes = 0; for (bitNum = 0; bitNum < 16; bitNum++) { if (inputValue & (1 << bitNum)) numberOfOnes++; }

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Nested Loops Loop body can (of course) be another loop. /* print a multiplication table */ for (mp1 = 0; mp1 < 10; mp1++) { for (mp2 = 0; mp2 < 10; mp2++) { printf(“%d\t”, mp1*mp2); } printf(“\n”); } Braces aren’t necessary, but they make the code easier to read.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Another Nested Loop The test for the inner loop depends on the counter variable of the outer loop. for (outer = 1; outer <= input; outer++) { for (inner = 0; inner < outer; inner++) { sum += inner; } }

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display For vs. While In general: For loop is preferred for counter-based loops. Explicit counter variable Easy to see how counter is modified each loop While loop is preferred for sentinel-based loops. Test checks for sentinel value. Either kind of loop can be expressed as the other, so it’s really a matter of style and readability.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Do-While do loop_body; while (test); loop_body test T F Executes loop body as long as test evaluates to TRUE (non-zero). Note: Test is evaluated after executing loop body.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Break and Continue break; used only in switch statement or iteration statement passes control out of the “smallest” (loop or switch) statement containing it to the statement immediately following usually used to exit a loop before terminating condition occurs (or to exit switch statement when case is done) continue; used only in iteration statement terminates the execution of the loop body for this iteration loop expression is evaluated to see whether another iteration should be performed if for loop, also executes the re-initializer

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Example What does the following loop do? for (i = 0; i <= 20; i++) { if (i%2  0) continue; printf("%d ", i); } What would be an easier way to write this? What happens if break instead of continue ?

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Problem Solving in C Stepwise Refinement as covered in Chapter 6...but can stop refining at a higher level of abstraction. Same basic constructs Sequential -- C statements Conditional -- if-else, switch Iterative -- while, for, do-while

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Problem 1: Calculating Pi Calculate  using its series expansion. User inputs number of terms. Start Initialize Get Input Evaluate Series Output Results Stop

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Pi: 1st refinement Start Initialize Get Input Evaluate Series Output Results Stop Initialize iteration count count<terms Evaluate next term count = count+1 for loop F T

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Pi: 2nd refinement Initialize iteration count count<terms Evaluate next term count = count+1 F T count is odd subtract termadd term if-else FT

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Pi: Code for Evaluate Terms for (count=0; count < numOfTerms; count++) { if (count % 2) { /* odd term -- subtract */ pi -= 4.0 / (2 * count + 1); } else { /* even term -- add */ pi += 4.0 / (2 * count + 1); } Note: Code in text is slightly different, but this code corresponds to equation.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Pi: Complete Code #include main() { double pi = 0.0; int numOfTerms, count; printf("Number of terms (must be 1 or larger) : "); scanf("%d", &numOfTerms); for (count=0; count < numOfTerms; count++) { if (count % 2) { pi -= 4.0 / (2 * count + 1); /* odd term -- subtract */ } else { pi += 4.0 / (2 * count + 1); /* even term -- add */ } printf("The approximate value of pi is %f\n", pi); }

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Problem 2: Finding Prime Numbers Print all prime numbers less than 100. A number is prime if its only divisors are 1 and itself. All non-prime numbers less than 100 will have a divisor between 2 and 10. Start Stop Initialize Print primes

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Primes: 1st refinement Start Stop Initialize Print primes Initialize num = 2 num < 100 Print num if prime num = num + 1 F T

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Primes: 2nd refinement Initialize num = 2 num < 100 Print num if prime num = num + 1 F T Divide num by 2 through 10 no divisors? Print num F T

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Primes: 3rd refinement Divide num by 2 through 10 no divisors? Print num F T Initialize divisor = 2 divisor <= 10 Clear flag if num%divisor > 0 divisor = divisor + 1 F T

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Primes: Using a Flag Variable To keep track of whether number was divisible, we use a "flag" variable. Set prime = TRUE, assuming that this number is prime. If any divisor divides number evenly, set prime = FALSE.  Once it is set to FALSE, it stays FALSE. After all divisors are checked, number is prime if the flag variable is still TRUE. Use macros to help readability. #define TRUE 1 #define FALSE 0

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Primes: Complete Code #include #define TRUE 1 #define FALSE 0 main () { int num, divisor, prime; /* start with 2 and go up to 100 */ for (num = 2; num < 100; num ++ ) { prime = TRUE; /* assume num is prime */ /* test whether divisible by 2 through 10 */ for (divisor = 2; divisor <= 10; divisor++) if (((num % divisor) == 0) && (num != divisor)) prime = FALSE; /* not prime */ if (prime) /* if prime, print it */ printf("The number %d is prime\n", num); } } Optimization: Could put a break here to avoid some work.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Problem 3: Searching for Substring Have user type in a line of text (ending with linefeed) and print the number of occurrences of "the". Reading characters one at a time Use the getchar() function -- returns a single character. Don't need to store input string; look for substring as characters are being typed. Similar to state machine: based on characters seen, move toward success state or move back to start state. Switch statement is a good match to state machine.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Substring: State machine to flow chart matched 't' matched 'th' matched 'the' 't' 'h' 'e' 't' no match other increment count read char match = 0 match = 1 match = 2 if 't', match=1 if 'h', match=2 if 't', match=1 else match=0 if 'e', count++ and match = 0 if 't', match=1 else match=0 T T T F F F

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Substring: Code (Part 1) #include main() { char key; /* input character from user */ int match = 0; /* keep track of characters matched */ int count = 0; /* number of substring matches */ /* Read character until newline is typed */ while ((key = getchar()) != '\n') { /* Action depends on number of matches so far */ switch (match) { case 0: /* starting - no matches yet */ if (key == 't') match = 1; break;

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Substring: Code (Part 2) case 1: /* 't' has been matched */ if (key == 'h') match = 2; else if (key == 't') match = 1; else match = 0; break;

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Substring: Code (Part 3) case 2: /* 'th' has been matched */ if (key == 'e') { count++; /* increment count */ match = 0; /* go to starting point */ } else if (key == 't') { match = 1; else match = 0; break; } } printf("Number of matches = %d\n", count); }