How to do Binary Search in an Array?

A stack is a last in, first out (LIFO) abstract data type and linear data structure. A stack can have any abstract data type as an element, but is characterized by two fundamental operations, called push and pop. The push operation adds a new item to the top of the stack, or initializes the stack if it is empty. If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack. A pop either reveals previously concealed items, or results in an empty stack, but if the stack is empty then it goes into underflow state (It means no items are present in stack to be removed).

Stack follows LIFO. Thus the item that is first entered would be the last removed. In array the items can be entered or removed in any order. Basically each member access is done using index and no strict order is to be followed here to remove a particular element .Array may be multi-dimensional or one dimensional but stack should be one-dimensional. Size of array is fixed, while stack can be grow or shrink. We can say stack is dynamic data structure.

Here are the main differences between arrays and stacks:

In summary, arrays have a fixed size and allow for direct element access, while stacks have a dynamic size and prioritize the most recently added element for access.

1. The front will always be pointing to the first element of the queue.
2. Each time a new element is inserted into the queue, the value of rear is incremented by one i.e., Rear = (Rear + 1);
3. Each time when an existing element is deleted from the queue, the value of rear is incremented by one i.e., Front = (Front + 1);
4. The front is the initial or first location of the queue where Rear indicates the last entry location in the queue.

A circular queue is one in which the insertion of a new element is done at the very first location of the queue if the last location of the queue is full. Suppose if we have a Queue of n elements then after adding the element at the last index i.e. (n-1)th , as queue is starting with 0 index, the next element will be inserted at the very first location of the queue which was not possible in the simple linear queue. That's why linear queue leads to wastage of the memory, and this flaw of linear queue is overcome by circular queue. So, in all we can say that the circular queue is a queue in which first element come right after the last element, that means a circular queue has a starting point but no end point .