int nums[ ] =

{2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.

It use pointer to link nodes.

LIFO stands for

Act of adding values into a stack is called

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, get the total number of element present in stack is