“A ___ is a list of homogeneous elements, wherein the addition
and deletion of elements occurs only at one end, called the top of
the stack”
stack
“A stack is a list of homogeneous elements, wherein the addition
and deletion of elements occurs only at one end, called the ____ of
the stack”
top
“Stack: A data structure in which the elements are added and
removed from one end only, a ____________ data
structure”
Last In First Out (LIFO)
“Stack: A _______ in which the elements are added and
removed from one end only, a Last In First Out (LIFO) data
structure”
data structure
“Adds a new element to the top of the stack.”
push(E item)
“Removes the top element of the stack”
(Malik,2012)
pop()
“Returns the top element of the stack” (Malik,2012)
top()
“Looks at the object at the top of this stack without
removing it from the stack.” (oracle)
peek()
Check if stack is empty.
empty(),isEmpty()
“If the stack is full, then it is said to be an____________” (geeksforgeeks)
Overflow
condition
“If the stack is empty, then it is said to be an
_______________.” (geeksforgeeks)
Underflow condition
“A _______ is a set of elements of the same type in which the
elements are added at one end, called the back or rear , and
deleted from the other end , called the front or first
queue
“A queue is a set of elements of the same type in which the
elements are added at one end, called the ______ , and
deleted from the other end , called the front or first
back or rear
Inserts an element at the end of the queue i.e. at the rear end.
enqueue(E item)
This operation removes and returns an element that is at the front end of the
queue.
dequeue( )
This operation indicates whether the queue is empty or not.
isEmpty( )
This operation indicates whether the queue is full or not.
isFull( )
________ also known as a linear queue is the most
basic version of a queue.
Simple queue
In a ______, the element of the queue act as a
circular ring. The working of a circular queue is similar to the linear queue
except for the fact that the last element is connected to the first element.
circular queue
“___: This queue is a special type of queue. Its specialty is that it
arranges the elements in a queue based on some priority.
Priority Queue
___ is also known as Double Ended Queue. As the name
suggests double ended, it means that an element can be inserted or
removed from both ends of the queue, unlike the other queues in which it can
be done only from one end. Because of this property, it may not obey the
First In First Out property. .”
Dequeue
Dequeue is also known as _________. As the name
suggests double ended, it means that an element can be inserted or
removed from both ends of the queue, unlike the other queues in which it can
be done only from one end. Because of this property, it may not obey the
First In First Out property. .”
Double Ended Queue
