SEQUENCE CONTROL STRUCTURE:

ALGORITHM FOR ADDITION FOR 2 NO.S

STEP 1: START THE PROGRAM START

STEP 2: INPUT A
STEP 3: INPUT B

STEP 4: CALCULATE SUM = A + B READ A B

STEP 5: OUTPUT SUM

STEP 6: STOP THE PROGRAM

SUM = A + B

ALGORITHM FOR FINDING AREA OF CIRCLE

PRINT SUM
STEP 1: START THE PROGRAM
STEP 2: INPUT R

STEP 3: SET PI = 3.14

STEP 4: CALCULATE AREA = PI * R * R
STOP
STEP 5: OUTPUT AREA
STEP 6: STOP THE PROGRAM

START BEGIN

INPUT READ
OUTPUT PRINT
SET INITIALIZE

PSEUDOCODE FOR ADDITION OF TWO NOS:

BEGIN
READ A B

CALCULATE SUM = A + B
PRINT SUM

STOP

DECISION CONTROL STRUCTURE

ALGORITHM FOR CHECKING WHETHER THE 2 NO.S ARE EQUAL OR NOT

STEP 1: START THE PROGRAM
STEP 2: INPUT A
STEP 3: INPUT B

STEP 4: CHECK IF A = = B CONDITION FALSE: GO TO STEP 6

STEP 5: DISPLAY “EQUAL” GO TO STEP 7

STEP 6: DISPLAY “NOT EQUAL”

STEP 7: STOP THE PROGRAM

ALGORITHM FOR FINDING BIGGEST AMONG 2 NOS:

STEP 1: START THE PROGRAM

STEP 2: INPUT A
STEP 3: INPUT B

STEP 4: CHECK IF A > B CONDITION FALSE: GO TO STEP 6

STEP 5: OUTPUT A GO TO STEP 7

STEP 6: OUTPUT B
STEP 7: STOP THE PROGRAM

START

READ A, B

DISPLAY “A IS
FALSE NOT EQUAL TO
A==B B”

TRUE

DISPLAY “A IS
EQUAL TO B”

STOP
BEGIN
READ A B
IF A = = B CONDITION FALSE: GO TO L1
DISPLAY “ A = = B” GO TO L2
L1: DISPLAY “ A ! = B”
L2: STOP

ALGORITHM FOR FINDING BIGGEST AMONG 3 NOS:

STEP 1: START THE PROGRAM

STEP 2: INPUT A

STEP 3: INPUT B
STEP 4: INPUT C

STEP 5: CHECK IF A > B CONDITION FALSE: GO TO STEP 8

STEP 6: CHECK IF A > C CONDITION FALSE: GO TO STEP 10

STEP 7: OUTPUT A GO TO STEP 11

STEP 8: CHECK IF B > C CONDITION FALSE: GO TO STEP 10

STEP 9: OUTPUT B GO TO STEP 11

STEP 10: OUTPUT C
STEP 11: STOP THE PROGRAM