Stack

 A stack is a non primitive type. It is an order list in which addition of new  data item and deletion of old data item one end known as top of step (TOS) As all the deletion insertion in a is done from top of step the last added element will be the first two be remove from the step. That is the reason why stack is also called last in first out type of list example-


To goes on increasing conversivly a the top most element of stack is remove the stack top is decrement for example.

Stack Implementation

Stack implementation through a very simple technique but is not a flexible way of creation as the size has to be declared during program design after tag the size cannot been baried.

Dynamic Implementation

it also called linked list representation and uses pointer to implement the stack type data structure.

Operation of Stack

1. PUSH -  The process of adding a new element to the top of stack each called PUSH operation. In case the array is full and number new element can been accommodated. It is called stack full condition . This condition is called STACK overflow.

2. POP - The process of delegating an element from the TOP of STACK is called POP operation after every POP operation the STACK is determined by one. If there is no on the STACK and the POP is perform. this will result into.

Algorithm for PUSH and POP

Inserting an element (PUSH)

1. [STACK already filled?]

If TOP = MAXSTK, then print:OVERFLOW and return.

2. Set TOP = TOP+1 [Increase TOP by 1]

3. Set STACK [TOP] = ITEM

4. Return.

Algorithm for POP ( STACK, TOP, ITEM) Deleting an array from POP

1. [STACK has an element to be removed]
 If TOP = 0 then Print : Overflow and return.
2. Set ITEM = STACK [TOP]
3. Set TOP : TOP-1
4. Return.

Comments

Post a Comment

Popular posts from this blog

Information retriever tools

Image
  FTP(File Transfer Protocol) :-  FTP  stands for  File Transfer Protocol . FTP which was one of the first tool on the internet. It allows user to move files such as test, graphics, sound and so on from one computer to another. Gropher :- The second type of information retriever to every level on the internet is  Gropher . It is menu based interface that provide easy access to information residing on special server called  Gropher . Gropher  sides although gopher perform primarily The same test as the FTP command. Its interface is much more user friendly and its provide additional function such as links to another internet service. Modem :- Modem  is define as a device that is used as modulator and demodulator. Modem is used to convert analog signal to digital and digital signal to analog. Modem can be define as:- A  modem  is a program or device that is used by the computer to transmit data to telephones or cable lines. The information ...
Read more

What Is An IP Address

Image
IP Address ( Internet Protocol Address) Every machine on the internet has a unique identifying number called on  IP address . An  IP address  is a numerical name appointed to every device which is connected to a every computer network that uses the Internet Protocol for communication. A typically  IP address  looks like this 192.168.1.1. To make it easier for us to remember.  IP address  are normally expand in decimal format as a doted decimal number like the above but computers communications in binary form look at the same IP address in binary form 11011000, 00011011, 00111101, 10001001. The four numbers in an  IP address  acted because they each have eight position when viewed in binary form. Each acted can contain any value between 0 to 255 combine the four acted you get a possible 4.294.961.296. The  IP address  that are used to give unique name to each and every computer. Are basically categorized...
Read more

What is an Array

  An  Array  can be define infinite collection of homogeneous (similar type) elements this means that an array can store either all integer, all floating point all character on any other complex data type but all of same data type. Some important points to be pointed out about array there are as follows - 1.   An array elements are always stored in sequential memory locations. 2.   An array can store multiple value which can be reference by a single name unlike a simple  variable   which store one value at a time. followed while an index for subscript specified inside a square.  3.   An array name is actually a pointer to the first location of the    memory block allocated to the name of the array. 4.   There is no bound checking concept for array in C language. It means then one can attempt to enter any number of value irrespective of the integer index specified inside square bracket during declaration of array. Arra...
Read more