Topic 3 (Stacks)

Process of inserting an element in stack is called (a)  

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

Pushing an element into stack already having five elements and stack size of 5, then stack becomes (a)  

Which of the following is true about linked list implementation of stack?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above

If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values

• 2,2,1,1,2

• 2,2,1,2,2

• 2,1,2,2,1

• 2,1,2,2,2

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?

• Underflow occurs

• Overflow occurs

• Stack operations are performed smoothly

• None of the above

Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack?

• Last node

• Any node

• First node

• Middle node

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, the no of element present on stack are

• 1

• 2

• 3

• 4

What type of data structure does a Stack is?

• Linear

• Non -linear

In stacks, the possibility to do insertion and deletion is ____

• at one end only

• at both ends