INTERVIEW QUESTIONS DATABASE DETAILS

Question: What is difference between stack and queue?

Answer: In high level programming, a stack is defined as a list or sequence of elements that is lengthned by placing new elements "on top" of existing elements and shortened by removing elements from the top of existing elements. It is an ADT with math operations of "push" and "pop". A queue is a sequence of elements that is added to by placing the new element at the rear of existing and shortened by removing elements in front of queue. It is an ADT. There is more to these terms understood in programming of Java, C++, Python and so on.

In high level programming, a stack is defined as a list or sequence of elements that is lengthned by placing new elements "on top" of existing elements and shortened by removing elements from the top of existing elements. It is an ADT with math operations of "push" and "pop". A queue is a sequence of elements that is added to by placing the new element at the rear of existing and shortened by removing elements in front of queue. It is an ADT. There is more to these terms understood in programming of Java, C++, Python and so on. Source: CoolInterview.com

Stack is last in first out(LIFO). that is which is entered last will be retrieved firstly. example of stack is arranging plates in one above one.
Queue is first in first out(FIFO). That is which is entered first will be served first. Example is ordinary queue in provisional store. Source: CoolInterview.com

Stack is a linear data structure which follows the LIFO "Last In, First Out" method
Stack is a linear data structure which follows the FIFO "First In, First Out" method
Insertions and deletions are possible through one end called “TOP” in a stack.
Insertions are at the rear end and deletions are from the Front end in a queue
Eg( Queue): Processes waiting for an I/O devices like printer or disk can be arranged in a order for their arrival using a Queue. Stacks are in fact used on every Processor. Each processor has a stack where data and addresses are pushed or added to the stack
In a real time queue are used to control the landing and take off of aircrafts at airports. The popular “Rat in a maze” problem is also solved using stacks.

Source: CoolInterview.com

Stack-: this can be define as an abstract data type the inserting and deleting follow the principle of (LIFO) and the operation on it is pop and push
while
Queue follow the principle of (FIFO) Source: CoolInterview.com

I tell simple answer stack mean LIFO which is the element or data comes last this data will be top of stack.the top of element is removing.queues is add element in rear side and element removing frond side(FIFO)(EX:CINMA TICKET COUNTER) Source: CoolInterview.com

stack .it is define as a data type inserting follow the operation Lifo(last in first out)ex-books in liberary
queue. it is defins as a data type inserting and deleting operation follow on fifo(first in first out)ex.queue for ticket. Source: CoolInterview.com

Stack is based on (LIFO) operation , eg. in parties the the sequential order of plates.Last plate will remove at first.
Queue is based on (FIFO)operation,
eg. on railway reservation counter the first person will serve first according to there sequential line number. Source: CoolInterview.com

Stack is a linear data structure which follows the LIFO "Last In, First Out" method
Stack is a linear data structure which follows the FIFO "First In, First Out" method
Insertions and deletions are possible through one end called ?TOP? in a stack.
Insertions are at the rear end and deletions are from the Front end in a queue
Eg( Queue): Processes waiting for an I/O devices like printer or disk can be arranged in a order for their arrival using a Queue. Stacks are in fact used on every Processor. Each processor has a stack where data and addresses are pushed or added to the stack
In a real time queue are used to control the landing and take off of aircrafts at airports. The popular ?Rat in a maze? problem is also solved using stacks.



Source: CoolInterview.com

stack .it is define as a data type inserting follow the operation Lifo(last in first out)ex-books in liberary
queue. it is defins as a data type inserting and deleting operation follow on fifo(first in first out)ex.queue for ticket. Source: CoolInterview.com

stack- in stack ,list of element is inserted or deleted by push and pop.

queue- in queue ,list of element is inserted or deleted by front and rear.ex-(bus) Source: CoolInterview.com

ang pinag ka iba nila ung spelling !! haixt common answer!!
BUTATA!! Source: CoolInterview.com

If you have the better answer, then send it to us. We will display your answer after the approval.

Rules to Post Answers in CoolInterview.com:-

• There should not be any Spelling Mistakes.
• There should not be any Gramatical Errors.
• Answers must not contain any bad words.
• Answers should not be the repeat of same answer, already approved.
• Answer should be complete in itself.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code: *
	Inform me about updated answers to this question