What is the difference between Stack and Queue?

1.	What is the difference between Stack and Queue?
Answer» Stack is a data structure which follows the principle of LIFO (Last In Fast Out) OR FILO (First In Last Out), i.e element inserted at last will be the first to be removed from the stack. Queue is a data structure which follows the principle of FIFO (First In First Out), i.e. element inserted at first to the list will be the first to be removed from the list. For Stack, insertion and deletion of an element are TERMED as PUSH and POP while for Queue, insertion, and deletion of an element are termed as ENQUEUE and DEQUEUE. In JAVA, Stack is a class present in java.util package and Queue is an interface present in java.util package.

Answer»

Stack is a data structure which follows the principle of LIFO (Last In Fast Out) OR FILO (First In Last Out), i.e element inserted at last will be the first to be removed from the stack.

Queue is a data structure which follows the principle of FIFO (First In First Out), i.e. element inserted at first to the list will be the first to be removed from the list.

For Stack, insertion and deletion of an element are TERMED as PUSH and POP while for Queue, insertion, and deletion of an element are termed as ENQUEUE and DEQUEUE.

In JAVA, Stack is a class present in java.util package and Queue is an interface present in java.util package.

Discussion

No Comment Found

Related InterviewSolutions

How is WeakHashMap differs from other HashMap?
How the ConcurrentHashMap works, how it provides the thread safety?
What is CopyOnWriteArrayList? How it is different from ArrayList in Java?
When to use the Queue and Stack? What is the possible use case?
When to use the Iterator and Enumeration? What is the possible use case?
How can you use Comparable and Comparator interfaces to sort collections?
What is the situation in which fail-fast and fail-safe iterators works? What are the issues to use the fail-safe along with the example?
What is the purpose of the initial capacity and load factor parameters of a HashMap? What are their default values? How is the threshold plays the role to decide the size?
What is the time complexity of putting and getting an element from such structure? Which Map implementation provide better performance?
What is collision problem? How HashMap performs collision detection and collision prevention when the index position found for the same key, what are the algorithms performed to avoid this situation?