Chapter 13 Control Structures

Slides:



Advertisements
Similar presentations
Selection Statements Selects statements to execute based on the value of an expression The expression is sometimes called the controlling expression Selection.
Advertisements

1 Introduction to “C” Control Loops and Functions Patt and Patel Ch. 13 & 14.
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.
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.
Section 3 - Selection and Repetition Constructs. Control Structures 1. Sequence 2. Selection 3. Repetition.
Chapter 4: Decision Making with Control Structures and Statements JavaScript - Introductory.
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.
Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional.
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
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 5: Structured Programming
Chapter 5: Structured Programming
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.
Decision Making and Branching (cont.)
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.
Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)
BIL 104E Introduction to Scientific and Engineering Computing Lecture 6.
Chapter 5: Structured Programming
Chapter 4 Repetition Statements (loops)
REPETITION CONTROL STRUCTURE
EKT120 COMPUTER PROGRAMMING
C Program Controls + Flow Structure
Chapter 12 Variables and Operators
Chapter 4 (Conditional Statements)
Chapter 5: Control Structures II
Loop Structures.
Lecture 4 - Loops UniMAP EKT120 Sem 1 08/09.
Week 4 – Repetition Structures / Loops
CS1010 Programming Methodology
Lecture 13 & 14.
JavaScript: Control Statements.
Lecture 07 More Repetition Richard Gesick.
Lecture 4B More Repetition Richard Gesick
Control Structures Lecture 7.
Chapter 13 Control Structures
Looping.
MSIS 655 Advanced Business Applications Programming
CS1100 Computational Engineering
Outline Altering flow of control Boolean expressions
How to develop a program?
CS1100 Computational Engineering
Structured Program
Chapter 4 - Program Control
Exam 1 Date: Feb. 2nd, 2015 during class time (50 minutes) Coverage
CSC215 Lecture Flow Control.
CSC215 Lecture Control Flow.
UMBC CMSC 104 – Section 01, Fall 2016
CSC115 Introduction to Computer Programming
Boolean Expressions to Make Comparisons
More Loops Topics Counter-Controlled (Definite) Repetition
ECE 103 Engineering Programming Chapter 18 Iteration
More Loops Topics Counter-Controlled (Definite) Repetition
More Loops Topics Counter-Controlled (Definite) Repetition
Flow of Control.
CSC215 Lecture Control Flow.
ICS103: Programming in C 4: Selection Structures
ICS103: Programming in C 5: Repetition and Loop Statements
More Loops Topics Counter-Controlled (Definite) Repetition
Module 4 Loops and Repetition 9/19/2019 CSE 1321 Module 4.
Chapter 13 Control Structures
Presentation transcript:

Chapter 13 Control Structures

Control Structures Conditional Iteration 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

If if (condition) action; F condition T action 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).

Example If Statements if (x <= 10) y = x * x + 5; if (x <= 10) { y = x * x + 5; z = (2 * y) / 3; } z = (2 * y) / 3; compound statement; both executed if x <= 10 only first statement is conditional; second statement is always executed

always true, so action is always executed! 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!

If’s Can Be Nested if (x == 3) if (y != 6) { z = z + 1; w = w + 2; } is the same as... if ((x == 3) && (y != 6)) { z = z + 1; w = w + 2; }

Generating Code for If Statement ; if (x == 2) y = 5; LDR R0, R5, #0 ; 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, R5, #-1 NOT_TRUE ... ; next statement

If-else if (condition) action_if; else action_else; condition T F Else allows choice between two mutually exclusive actions without re-testing condition.

Generating Code for If-Else LDR R0, R5, #0 BRz ELSE ; x is not zero LDR R1, R5, #-1 ; incr y ADD R1, R1, #1 STR R1, R5, #-1 LDR R1, R5, #-2 ; decr z ADD R1, R1, #-1 STR R1, R5, #-2 BR DONE ; skip else code ; x is zero ELSE LDR R1, R5, #-1 ; decr y ADD R1, R1, #-1 STR R1, R5, #-1 LDR R1, R5, #-2 ; incr z ADD R1, R1, #1 STR R1, R5, #-2 DONE ... ; next statement if (x) { y++; z--; } else { y--; z++; }

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; is the same as... is NOT the same as... 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;

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”);

While while (test) loop_body; F test T loop_body Executes loop body as long as test evaluates to TRUE (non-zero). Note: Test is evaluated before executing loop body.

Generating Code for While AND R0, R0, #0 STR R0, R5, #0 ; x = 0 ; test LOOP LDR R0, R5, #0 ; load x ADD R0, R0, #-10 BRzp DONE ; loop body LDR R0, R5, #0 ; load x ... <printf> ... ADD R0, R0, #1 ; incr x STR R0, R5, #0 JMP LOOP ; test again DONE ; next statement x = 0; while (x < 10) { printf(“%d ”, x); x = x + 1; }

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.

For for (init; end-test; re-init) statement init F test T loop_body 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. re-init

Generating Code for For ; init AND R0, R0, #0 STR R0, R5, #0 ; i = 0 ; test LOOP LDR R0, R5, #0 ; load i ADD R0, R0, #-10 BRzp DONE ; loop body LDR R0, R5, #0 ; load i ... <printf> ... ; re-init ADD R0, R0, #1 ; incr i STR R0, R5, #0 JMP LOOP ; test again DONE ; next statement for (i = 0; i < 10; i++) printf(“%d ”, i); This is the same as the while example!

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++; }

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.

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; } }

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.

Do-While do loop_body; loop_body while (test); test T F Executes loop body as long as test evaluates to TRUE (non-zero). Note: Test is evaluated after executing loop body.

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

Problem 1: Calculating Pi Calculate  using its series expansion. User inputs number of terms. Start Evaluate Series Initialize Output Results Get Input Stop

Pi: 1st refinement Start Initialize for loop Get Input Evaluate Series iteration count Initialize for loop count<terms F Get Input T Evaluate Series Evaluate next term Output Results count = count+1 Stop

Pi: 2nd refinement if-else Initialize iteration count count is odd T F count<terms F subtract term add term T Evaluate next term add term count = count+1 if-else

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.

Pi: Complete Code #include <stdio.h> 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); }

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 Initialize Print primes Stop

Primes: 1st refinement Start Stop Initialize num = 2 num < 100 F Print primes Print num if prime num = num + 1 Stop

Primes: 2nd refinement Initialize num = 2 Divide num by 2 through 10 no divisors? F T Print num if prime T Print num num = num + 1

Clear flag if num%divisor > 0 Primes: 3rd refinement Initialize divisor = 2 Divide num by 2 through 10 divisor <= 10 F no divisors? F T T Clear flag if num%divisor > 0 Print num divisor = divisor + 1

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

Optimization: Could put a break here to avoid some work. Primes: Complete Code #include <stdio.h> #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. (Section 13.5.2)

Switch evaluate expression switch (expression) { case const1: action1; break; case const2: action2; break; default: action3; } = const1? action1 T F = const2? action2 T F action3 Alternative to long if-else chain. If break is not used, then case "falls through" to the next.

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”); }

If a is 2, prints “BC”. Otherwise, prints “C”. 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”.

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.

Substring: State machine to flow chart read char no match other match = 0 T 't' if 't', match=1 matched 't' F other if 'h', match=2 if 't', match=1 else match=0 match = 1 T 't' 'h' matched 'th' F 't' if 'e', count++ and match = 0 if 't', match=1 else match=0 other match = 2 T 'e' F matched 'the' 't' other increment count

Substring: Code (Part 1) #include <stdio.h> 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;

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;

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); }

Break and Continue break; continue; 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

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?