Lecture 4: Program

Control

Mr. Imran Latif

(imranlatif@cuilahore.edu.pk)

COMSATS – Lancaster DDP 1

 Outline
Outline
4.1 Introduction
4.2 The Essentials of Repetition
4.3 Counter-Controlled Repetition
4.4 The For Repetition Structure
4.5 The For Structure: Notes and Observations
4.6 Examples Using the For Structure
4.7 The Switch Multiple-Selection Structure
4.8 The Do/While Repetition Structure
4.9 The break and continue Statements
4.10 Logical Operators
4.11 Confusing Equality (==) and Assignment (=) Operators
4.12 Structured Programming Summary

COMSATS – Lancaster DDP Slide 2

 4.1 Introduction
 This lecture introduces
 Additional repetition control structures
 for

 do/while

 switch multiple selection structure

 break statement
 Used for exiting immediately and rapidly from certain control
structures
 continue statement
 Used for skipping the remainder of the body of a repetition
structure and proceeding with the next iteration of the loop

COMSATS – Lancaster DDP Slide 3

 4.2 The Essentials of Repetition
 Loop
 Group of instructions computer executes repeatedly while some
condition remains true
 Counter-controlled repetition
 Definite repetition: know how many times loop will execute
 Control variable used to count repetitions
 Sentinel-controlled repetition
 Indefinite repetition
 Used when number of repetitions not known
 Sentinel value indicates "end of data"

COMSATS – Lancaster DDP Slide 4

 4.3 Essentials of Counter Controlled
Repetition

 Counter-controlled repetition requires

 The name of a control variable (or loop counter)
 The initial value of the control variable
 A condition that tests for the final value of the control variable (i.e.,
whether looping should continue)
 An increment (or decrement) by which the control variable is modified
each time through the loop

COMSATS – Lancaster DDP Slide 5

 4.3 Essentials of Counter Controlled
Repetition
 Example:
int counter = 1; // initialization
while ( counter <= 10 ) { // repetition condition
printf( "%d\n", counter );
++counter; // increment
}
 The statement
int counter = 1;
 Names counter

 Declares it to be an integer

 Reserves space for it in memory

 Sets it to an initial value of 1

COMSATS – Lancaster DDP Slide 6

 4.4 The ‘for’ Repetition Structure

 Format when using for loops

for ( initialization; loopContinuationTest; increment )
statement
 Example:
 int counter;

for( counter = 1; counter <= 10; counter++ )

printf( "%d\n", counter );
No semicolon (;)
 Prints the integers from one to ten after last expression

COMSATS – Lancaster DDP Slide 7

 4.4 The ‘for’ Repetition Structure

 For loops can usually be rewritten as while loops:

initialization;
while ( loopContinuationTest ) {
statement;
increment;
}
 Initialization and increment
 Can be comma-separated lists
 Example:
int i;
for ( i = 0, j = 0; j + i <= 10; j++, i++)
printf( "%d\n", j + i );

COMSATS – Lancaster DDP Slide 8

 4.5 The ‘for’ Structure: Notes &
Observations
 Arithmetic expressions
 Initialization, loop-continuation, and increment can contain arithmetic
expressions. If x equals 2 and y equals 10
for ( j = x; j <= 4 * x * y; j += y / x )
is equivalent to
for ( j = 2; j <= 80; j += 5 )
 Notes about the ‘for’ structure:
 "Increment" may be negative (decrement)
 If the loop continuation condition is initially false
 The body of the for structure is not performed

 Control proceeds with the next statement after the for structure

 Control variable
 Often printed or used inside for body, but not necessary

COMSATS – Lancaster DDP Slide 9

1 /* Fig. 4.5: fig04_05.c
2 Summation with for */
4.5 The ‘for’ Structure: Notes &
3 #include <stdio.h>
1. Initialize variables
4
5 int main() Observations 2. for repetition
6 { structure
7 int sum = 0, number;
8
9 for ( number = 2; number <= 100; number += 2 )
10 sum += number;
11
12 printf( "Sum is %d\n", sum );
13
14 return 0;
15}

 Program Output
Sum is

COMSATS – Lancaster DDP Slide 10

 4.7 The ‘switch’ Multiple Selection
Structure
 switch
 Useful when a variable or expression is tested for all the values it can
assume and different actions are taken
 Format
 Series of case labels and an optional default case
switch ( value ){
case '1':
actions
case '2':
actions
default:
actions
}
 break; exits from structure

COMSATS – Lancaster DDP Slide 11

 4.7 The ‘switch’ Multiple Selection
Structure
 Flowchart of the switch structure
true
case a case a action(s) break

false

true
case b case b action(s) break
false

.
.
.

true
case z case z action(s) break
false

default action(s)

COMSATS – Lancaster DDP Slide 12

int main() {
int color = 1;

printf("Please choose a color(1: red,2: green,3: blue):\n");

scanf("%d", &color);

switch (color) {
case 1:
printf("you chose red color\n"); break;
case 2:
printf("you chose green color\n"); break;
case 3:
printf("you chose blue color\n"); break;
default:
printf("you did not choose any color\n");
}
return 0;
}
Slide 13
#include<stdio.h>
#include<stdlib.h>
int main()
{
int no1,no2;
char option;
printf("enter your no1\n");
scanf("%d",&no1);
printf("enter your no2\n");
scanf("%d",&no2);
fflush(stdin);
printf("if you want to add press + \nfor subtraction - \nfor multiplication *
\nfor division / \n");
scanf("%c", &option);
Slide 14
switch(option)
{
case('+'):
printf("your sum is=%d\n",no1+no2);
break;
case('-'):
printf("your subtraction is=%d\n",no1-no2);
break;
case('*'):
printf("your multiplication is=%d\n",no1*no2);
break;
case('/'):
printf("your division is=%d\n",no1/no2);
break;
Slide 15
}
1 /* Fig. 4.7: fig04_07.c
2 Counting letter grades */
3 #include <stdio.h>
4
5 4.7 The ‘switch’ Multiple Selection
int main() OUTLINE
6 {
7
8
int grade;
Structure
int aCount = 0, bCount = 0, cCount = 0,
9 dCount = 0, fCount = 0;
 1. Initialize variables
10
11 printf( "Enter the letter grades.\n" );
12 printf( "Enter the EOF character to end input.\n" );
 2. Input data
13
14 while ( ( grade = getchar() ) != EOF ) {  2.1 Use switch loop
15
16 switch ( grade ) { /* switch nested in while */
to update count
17
18 case 'A': case 'a': /* grade was uppercase A */
19 ++aCount; /* or lowercase a */
20 break;
21
22 case 'B': case 'b': /* grade was uppercase B */
23 ++bCount; /* or lowercase b */
24 break;
25
26 case 'C': case 'c': /* grade was uppercase C */
27 ++cCount; /* or lowercase c */
28 break;
29
30 case 'D': case 'd': /* grade was uppercase D */
31 ++dCount; /* or lowercase d */ Slide 16
COMSATS – Lancaster DDP
32 break;
33
34 case 'F': case 'f': /* grade was uppercase F */
35
36
4.7 The ‘switch’ Multiple Selection
++fCount;
break;
/* or lowercase f */

37 Structure
38 case '\n': case' ': /* ignore these in input */
39 break;
40
41 default: /* catch all other characters */
42 printf( "Incorrect letter grade entered." );
43 printf( " Enter a new grade.\n" );
44 break;
45 }
46 }
47
48 printf( "\nTotals for each letter grade are:\n" );
49 printf( "A: %d\n", aCount );
50 printf( "B: %d\n", bCount ); OUTLINE
51 printf( "C: %d\n", cCount );
 2.1 Use switch loop
52 printf( "D: %d\n", dCount );
53 printf( "F: %d\n", fCount );
to update count
54  3. Print results
55 return 0; Slide 17
COMSATS – Lancaster DDP
56}
 PROGRAM OUTPUT
Enter the letter grades.
4.7 The ‘switch’ Multiple Selection
Enter the EOF character to end input.
A
B
Structure
C
C
A
D
F
C
E
Incorrect letter grade entered. Enter a new grade.
D
A
B

Totals for each letter grade are:

A: 3
B: 2
C: 3
D: 2
F: 1 Slide 18
COMSATS – Lancaster DDP
 4.8 The ‘do/while’ Repetition Structure
 The do/while repetition structure
 Similar to the while structure
 Condition for repetition tested after the body of the loop is performed
 All actions are performed at least once

 Format:
do {
statement;
} while ( condition );

COMSATS – Lancaster DDP Slide 19

 4.8 The ‘do/while’ Repetition Structure
 Example (letting counter = 1):
do {
printf( "%d ", counter );
} while (++counter <= 10);
 Prints the integers from 1 to 10

COMSATS – Lancaster DDP Slide 20

 4.8 The ‘do/while’ Repetition Structure
 Flowchart of the ‘do/while’ repetition structure

action(s)

true
condition

false

COMSATS – Lancaster DDP Slide 21

1 /* Fig. 4.9: fig04_09.c
2 Using the do/while repetition structure */

4.8 The ‘do/while’ Repetition Structure

3 #include <stdio.h>
OUTLINE
4
 1. Initialize variable
5 int main()  2. Loop
6 {  3. Print
7 int counter = 1;
8
9 do {
10 printf( "%d ", counter );
11 } while ( ++counter <= 10 );
12
13 return 0;
14}

1 2 3 4 5 6 7 8 9 10 Program Output

COMSATS – Lancaster DDP Slide 22

 4.9 The ‘break’ & ‘continue’ Statements
 break
 Causes immediate exit from a while, for, do/while or switch structure
 Program execution continues with the first statement after the structure
 Common uses of the break statement
 Escape early from a loop

 Skip the remainder of a switch structure

COMSATS – Lancaster DDP Slide 23

 4.9 The ‘break’ & ‘continue’ Statements
 continue
 Skips the remaining statements in the body of a while, for or do/while
structure
 Proceeds with the next iteration of the loop

 while and do/while

 Loop-continuation test is evaluated immediately after the continue
statement is executed
 for
 Increment expression is executed, then the loop-continuation test is
evaluated

COMSATS – Lancaster DDP Slide 24

1 /* Fig. 4.12: fig04_12.c
2 Using the continue statement in a for structure */
3 #include <stdio.h>
4
4.9 The ‘break’ & ‘continue’ Statements
5 int main()
OUTLINE

6 { 1. Initialize variable
7 int x; 2. Loop
8
9 for ( x = 1; x <= 10; x++ ) { 3. Print
10
11 if ( x == 5 )
12 continue; /* skip remaining code in loop only
13 if x == 5 */
14
15 printf( "%d ", x );
16 }
17
18 printf( "\nUsed continue to skip printing the value 5\n" );
19 return 0;
20}
1 2 3 4 6 7 8 9 10
Used continue to skip printing the value 5
Program Output

COMSATS – Lancaster DDP Slide 25

 4.10 Logical Operators
 && ( logical AND )
 Returns true if both conditions are true
 || ( logical OR )
 Returns true if either of its conditions are true
 ! ( logical NOT, logical negation )
 Reverses the truth/falsity of its condition
 Unary operator, has one operand
 Useful as conditions in loops
Expression Result
true && false false
true || false true
!false true

COMSATS – Lancaster DDP Slide 26

 4.11 Confusing Equality (==) and
Assignment (=) Operators
 Dangerous error
 Does not ordinarily cause syntax errors
 Any expression that produces a value can be used in control structures
 Nonzero values are true, zero values are false
 Example using ==:
if ( payCode == 4 )
printf( "You get a bonus!\n" );
 Checks paycode, if it is 4 then a bonus is awarded

COMSATS – Lancaster DDP Slide 27

 4.11 Confusing Equality (==) and
Assignment (=) Operators
 Example, replacing == with =:
if ( payCode = 4 )
printf( "You get a bonus!\n" );
 This sets paycode to 4

 4 is nonzero, so expression is true, and bonus awarded no matter

what the paycode was
 Logic error, not a syntax error

COMSATS – Lancaster DDP Slide 28

 4.11 Confusing Equality (==) and
Assignment (=) Operators
 lvalues
 Expressions that can appear on the left side of an equation
 Their values can be changed, such as variable names
 x = 4;

 rvalues
 Expressions that can only appear on the right side of an equation
 Constants, such as numbers
 Cannot write 4 = x;

 Must write x = 4;

 lvalues can be used as rvalues, but not vice versa

 y = x;

COMSATS – Lancaster DDP Slide 29

 4.12 Structured Programming Summary
 Structured programming
 Easier than unstructured programs to understand, test, debug and,
modify programs
 Rules for structured programming
 Rules developed by programming community
 Only single-entry/single-exit control structures are used
 Rules:
1. Begin with the “simplest flowchart”
2. Any rectangle (action) can be replaced by two rectangles (actions)
in sequence
3. Any rectangle (action) can be replaced by any control structure
(sequence, if, if/else, switch, while, do/while or for)
4. Rules 2 and 3 can be applied in any order and multiple times

COMSATS – Lancaster DDP Slide 30

 4.12 Structured Programming Summary
Rule 2 - Any rectangle can be
Rule 1 - Begin with the
replaced by two rectangles in
simplest flowchart
sequence

Rule 2 Rule 2 Rule 2

.
.
.

COMSATS – Lancaster DDP Slide 31

 4.12 Structured Programming Summary
Rule 3 - Replace any rectangle with a control structure

Rule 3

Rule 3
Rule 3

COMSATS – Lancaster DDP Slide 32

 4.12 Structured Programming Summary
 All programs can be broken down into 3 controls
 Sequence – handled automatically by compiler
 Selection – if, if/else or switch
 Repetition – while, do/while or for
 Can only be combined in two ways

 Nesting (rule 3)

 Stacking (rule 2)

 Any selection can be rewritten as an if statement, and any repetition can

be rewritten as a while statement

COMSATS – Lancaster DDP Slide 33