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?

Only the top element can be accessed in stack

Which of them is an abstract data structure (ADT)?

Which of the following uses the FIFO method

Which function is called in a POP() function

Consider Stack is implemented using the array.

#define MAX 10

struct STACK

{

int arr[MAX]

int top = ___________;

}

What will be the initial value with which top is initialized.

Consider the following operations performed on a stack of size 5:

Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e)

Which of the following statements is correct?

Consider the following sequence of operations performed on a stack:

push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop.

What is the sequence of popped out values?

In a stack, if a user tries to remove an element from an empty stack it is called _________

The process of removing an element from a stack is called ____________

User perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(2);

pop();

pop();

push(4);

pop();

pop();

push(5);

List of data in which element can be inserted and removed at the same end is called a/an __________.

If the user push 1 element in the stack already containing five elements and having stack size as 5 then the stack becomes an ___________.

Consider above is a Stack implemented using the array.

In this implementation of stack maximum value of top which cannot cause overflow will _________.

An array is said to permit random access of values stored in that data structure. Implementing stacks using arrays means that any item stored in the stack can be accessed randomly.