Definition of Stack

Stack is defined as a special type of data structure where items are inserted from one end called top of stack and items are deleted from the same end.

          Here, the last item inserted will be on top of stack. Since deletion is done from the same end, Last item is inserted is the First item to be deleted out from the stack and so, stack is also called Last In First Out (LIFO) data structure.

The various operations that can be performed on stacks are

         i.            Insert an item into the stack
       ii.            Delete an item from the stack
      iii.            Display the contents of the stack

·  Insert or push operation: Inserting an element in the stack is called push operation. This can be achieved by first increment top by 1 and then insert an item as shown below;
                top = top+1;
                s[top] = item;
These two statements can also be written as s[++top]= item
                             
When the stack is full the value of top will be [STACK SIZE -1] and it is not possible to insert any new item in the stack. This situation is called stack overflow.

·  Delete or Pop operation: Deleting the stack called pop operation. This can be achieved by first accessing the top element s[top] and then decremented top by one as shown below.
              Item = s[top--];
Each time, the item is deleted, top is decremented and finally, when the stack is empty the top will be -1. When the stack is empty, it is not possible to delete any item and this situation is called underflow of stack.

·      Display operation: Displaying the items of the stack is called display operation.

Applications of Stack:- A stack is very useful in situations when data have to be stored and then retrieved in the reverse order. Some applications of stack are listed below.
         i.            Function calls
       ii.            Large number Arithmetic
      iii.            Evaluation of arithmetic expressions


You Might also view the following Related Posts

For more other Posts: Click Here

Popular posts from this blog

MCQ of Structured Query Language(SQL) With Answer Set -2

1. Which of the following query is correct for using comparison operators in SQL ? A) SELECT sname, coursename FROM studentinfo WHERE age>50 and <80; B) SELECT sname, coursename FROM studentinfo WHERE age>50 and age <80; C) SELECT sname, coursename FROM studentinfo WHERE age>50 and WHERE age<80; D) None of the above 2.How to select all data from studentinfo table starting the name from letter 'r'? A) SELECT * FROM studentinfo WHERE sname LIKE 'r%'; B) SELECT * FROM studentinfo WHERE sname LIKE '%r%'; C) SELECT * FROM studentinfo WHERE sname LIKE '%r'; D) SELECT * FROM studentinfo WHERE sname LIKE '_r%'; 3. Which of the following SQL query is correct for selecting the name of staffs from 'tblstaff' table where salary is 15,000 or 25,000? A) SELECT sname from tblstaff WHERE salary IN (15000, 25000); B) SELECT sname from tblstaff WHERE salary BETWEEN 15000 AND 25000; C) Both A and B D) None of the above 4. The SELECT
Read more

Easy Methods to Increase Your Website Speed

Website speed is the most important factor for SEO. It also affects the popularity of your site, about every 25% of the visitors of the site left that even if it is useful for them for slow loading sites. Google also decided to include website loading speed for website ranking.  You can increase your website by performing testing or analyzing your site by using different such tools and performing the actions suggested by them. The main tasks to be performed to achieve such goals are setting an expiry date or maximum age in the HTTP headers, minimizing the HTTP redirects, minimizing the amount of JavaScript need while loading the page, minimizing unnecessary JavaScript, CSS Scripts and HTML, Optimizing images and long running scripts etc.  Why Website Speed is Most Important For SEO?  Only the fast loading websites can achieve better user experience and can have the minimum exit ratio. They can only achieve their goals in their online business and marketing. Search engine crawlers also
Read more

Solved MCQ on Stack and Queue in Data Structure set-1

1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these 2) In liked representation of stack ....... holds the elements of the stack. A. INFO fields B. TOP fields C. LINK fields D. NULL fields 3) ........ form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these 4) In the linked representation of the stack ......... behaves as the top pointer variable of stack. A. Stop pointer B. Begin pointer C. Start pointer D. Avail pointer 5) New nodes are added to the ......... of the queue. A. Front B. Back C. Middle D. Both A and B 6) In linked representation of stack the null pointer of the last node in the list signals .......... A. Beginning of the stack B. Bottom of the stack C. Middle of the stack D. In between some value 7) What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The
Read more