Semester -3    Subject -Data Structures and Algorithms

Define stacks . Explain implementation of stacks ? 

==> Stacks--

  • A stack is linear Data Sturcture in which items are added (pushed, inserted) and removed(pop, deleted) from one end called top.
  • A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. In the stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack
Share to whatsapp

More Questions from Data Structures and Algorithms Module 2

Define stacks . Explain implementation of stacks ? 


View

Define Queue. Explain Basic features of Queue ? 


View

Define Queue. Explain Applications of Queue ? 


View

Explain briefly Infix expression, Polish Notation and Reverse Polish Notation ?


View

Define Tower of Hanoi . Explain algorithm for Tower of Hanoi ? 


View

Define Tower of Hanoi. Explain Problem statement for Tower of Hanoi ? 


View

Define Circular Queue. Describe implementation of Circular Queue ? 


View