You are on page 1of 2

PIC

13/05/2021
Solution to any problem
ANALYSE THE PROBLEM/TASK
IDENTIFY INPUTS
IDENTIFY COMPUTATIONAL STEPS/PROCEDURE
STORE RESULTS
OUTPUT THE RESULTS

PSEUDOCODE – ALGORITHM
WAYS OF WRITING!!

Step 1:[START/BEGIN] Step 1:START


Step 2: [INPUT] Step 2: INPUT
Read a,b i nput(a,b)
Step 3: [COMPUTE AND STORE] Step 3: COMPUTE AND STORE
sum=a+b sum <- a + b
Step 4: [ OUTPUT] Step 4: OUTPUT
Print sum write(sum)
Step 5: [STOP/END] Step 5: STOP

ALGORITHM TO FIND GREATEST OF TWO NUMBERS


STEP 1: START
STEP 2: INPUT
INPUT A, B
STEP 3: COMPARE
IF (A>B)
BIG <- A
ELSE
BIG <-B
STEP 4: OUTPUT
PRINT BIG
STEP 5: STOP

OR

STEP 1: START
STEP 2: INPUT
INPUT A, B
STEP 3: COMPARE
IF (A>B)
PRINT "A IS BIGGER"
ELSE
PRINT "B IS BIGGER" // printf("Largest of given two numbers is :%d",b);
STEP 4: OUTPUT
PRINT
STEP 5: STOP

You might also like