answersLogoWhite

0

A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Some applications of stack are : Polish notation, reversing string, backtracking , quick sort algorithm etc. The queue is a linear data structure where operations od insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. Whenever a new item is added to queue, rear pointer is used. and the front pointer is used when an item is deleted from the queue.

User Avatar

Wiki User

10y ago

What else can I help you with?

Related Questions

Differences between stacks and qeues?

stacks work in by the process of (LIFO) last in first out. While queues use the process of (FIFO) first in first out.


Is String a linear data structure?

yes it is, other linear data structures are lists,queues,stacks,arrays


What is the difference between energy pyramid and food web?

the difference is that energy pyramids show life and food pyramids are just stacks of food


What is the difference between queues and circular queues?

A queue can use a dynamic array, or a linked list, but if using static memory, the queue becomes a circular queue because the underlaying data structure is a static circular array. This means the ends of the array are attached.


What is the difference between a mailboxes and message queue?

Mailbox is similar to a queue, which allows only atomic operations. They can be bounded/unbounded. Get/put task is used to suspend abounded mailbox. That?s why mailbox is used more for communication between threads. Queues are large structures. Inserting data in queues is very difficult


How do you determine symmetry of a data structure For example how do you know if a Stack or a queue or a priority queue or a double ended queue are symmetric?

You can determine symmetry of a data structure in two ways. One is when the stacks and queues data are put in the application and when the stacks are put in during run-time.


What is the need of dequeue?

A deque, or double-ended queue, is a versatile data structure that allows insertion and deletion of elements from both ends, making it useful for various applications. It supports operations like adding or removing elements efficiently from either front or back, which is beneficial for scenarios such as implementing queues, stacks, or maintaining a sliding window over a dataset. Deques provide greater flexibility than traditional queues or stacks, enabling more complex data management and algorithm implementations.


How much space should be allowed between stacks of product in the walk-in freezer at mcdonalds?

space should be allowed between stacks of product in the walk-in freezer


What are the advantages of building ISR queues?

ISR queues


What is Linear and non linear list in data structure?

Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily..


Examples of primitive and non primitive scheduling?

The latter isn't primitive. Most likely it means 'non trivial', 'adaptive' or 'sophisticated'.


How do you separate the two hay stacks on poptropica?

jump in between them