0% found this document useful (0 votes)
51 views

CP Lecture # 2

The document discusses algorithms and programming structures. It defines an algorithm as a procedure for solving a problem through a series of ordered actions. Pseudocode is presented as an informal way to develop algorithms using everyday English. Control structures like if/else statements and while loops are introduced to allow programs to execute actions conditionally or repetitively rather than just sequentially. Flowcharts are also discussed as a way to visually represent program logic and control structures.

Uploaded by

MasoomBachii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views

CP Lecture # 2

The document discusses algorithms and programming structures. It defines an algorithm as a procedure for solving a problem through a series of ordered actions. Pseudocode is presented as an informal way to develop algorithms using everyday English. Control structures like if/else statements and while loops are introduced to allow programs to execute actions conditionally or repetitively rather than just sequentially. Flowcharts are also discussed as a way to visually represent program logic and control structures.

Uploaded by

MasoomBachii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Programming

Structures
Algorithm

 The solution to any computing problem involves executing a series of actions


in a specific order.
 A procedure for solving a problem in terms of
 1. the actions to be executed, and
 2. the order in which these actions are to be executed is called an algorithm.

 Consider the “rise-and-shine algorithm.


Pseudocode

 Pseudocode is an artificial and informal language that helps you develop


algorithms.
 The pseudocode we present here is particularly useful for developing
algorithms that will be converted to structured C programs.
 Pseudocode is similar to everyday English; it’s convenient
 and user friendly although it’s not an actual computer programming language.
Control Structures
 Normally, statements in a program are executed one after the other in the
order in which they’re written. This is called sequential execution.
 next statement to be executed may be other than the next one in sequence.
This is called transfer of control
Flowchart

 Oval symbol containing the word “Begin” and “END”


 Most important flowcharting symbol is the diamond symbol, also called
 the decision symbol
 Squair for operation
 The if selection statement either performs (selects) an action if a condition is
true or skips the action if the condition is false.
 The if statement is called a single selection statement because it selects or
ignores a single action.
 The if…else statement is called a double-selection statement because it
selects between two different actions.
 The switch statement is called a multiple-selection statement because it
selects among many different actions.
The if Selection Statement

 if ( grade >= 60 ) {
printf( "Passed\n" );
 } /* end if */
Nested if…else statements

 Write pseudocode and drew flow chart


 A for exam grades greater than or equal to 90,
 B for grades greater than or equal to 80,
 C for grades greater than or equal to 70,
 D for grades greater than or equal to 60,
 and F for all other grades.
The “while” Repetition Statement

 A repetition statement allows you to specify that an action is to be repeated


while some condition remains true.
 The pseudocode statement
While there are more items on my shopping list
Purchase next item and cross it off my list

 Product = 3;
 while ( product <= 100 )
 {
 product = 3 * product;
 } /* end while */
Counter Control Repitition

 A class of ten students took a quiz. The grades (integers in the range 0 to
100) for this quiz are available to you. Determine the class average on the
quiz.

 Write a Program???
Class average program with sentinel-
controlled repetition
 Write a program to calculate average using sentinel-controlled repetition ??

 cast operator average = ( float ) total / counter;


 printf( "%.2f\n", 3.446 ); /* prints 3.45 */
Nested Control Structures
 while ( student <= 10 ) {
 /* prompt user for input and obtain value from user */
 printf( "Enter result ( 1=pass,2=fail ): " );
 scanf( "%d", &result );
 /* if result 1, increment passes */
 passes = passes + 1;
 } /* end if */
 /* otherwise, increment failures */
 failures = failures + 1;
 } /* end else */
 student = student + 1; /* increment student counter */
 } /*
Assignment Operators

 c = c + 3;
 can be abbreviated with the addition assignment operator += as
 c += 3;
Increment and Decrement Operators

 If increment or decrement operators are placed before a variable (i.e.,


prefixed), they’re referred to as the preincrement or predecrement
operators, respectively.
 If increment or decrement operators are placed after a variable (i.e.,
postfixed), they’re referred to as the postincrement or postdecrement
operators, respectively

You might also like