Showing posts with label IMPLEMENTATIONS. Show all posts
Showing posts with label IMPLEMENTATIONS. Show all posts

HOW TO WRITE ALGORITHM


>AVAIL LIST: Is a list which contains free node i.e free memory list.

>ALGORITHM: is a written form of program.

>SOFTWARE: Is a collection of programs.

>PROGRAM: is a collection of instructions.

>INSTRUCTION: any order given to computer to perform some task.

=> HOW TO WRITTEN AN ALGORITHM:

>first gave "overflow" and "underflow" condition.

>"OVERFLOW" condition give in push operation.

>"UNDERFLOW" condition give in pop operations.

> At the end of algorithm writes EXIT.

=>ARRAY IMPLEMEMTATION OF STACK:

*(PUSH):

1) IF TOP=MAXSTK then
print " overflow" and exit