QUiz e

In a linked list implementation of stack, where does the new element get inserted?

• At the end of the list

• In the middle of the list

• depends on the implementation

• at the front of the list

What is the time complexity of Stack Pop operation if it is implemented using Singly Linked List?

• O(1)

• O(N^2)

• O(N)

• O(logN)

Will we be able to do 10⁷ pop operations if we implement Stack using vector?

• YES

• NO

Which of the examples are of Queue?

• Phitron Support Session Management

• Books on a Shelf

• Undo Operation

• Online Code judging system

Which one of the following is not a operation of Queue STL

• pop

• enqueue

• front

• size

what will be the final stack of following code ?
stack<int> s ;
s.push(10);
s.push(20);
s.push(30) ;

s.pop() ;
s.pop()
s.push(10) ;

• 10 20 10

• 10 20 30 10

• 10 10

• Empty

What will occur if we transfer elements from one queue to another in the order they are removed?

• Reverse Queue

• Sorted Queue

• Random Queue

• Same Queue

How many pop operations will be needed if we want to remove the middle element from this queue?

• 2

• 3

• 4

• 5

if we track tail in a Singly Linked List , and implement stack using it. What will be time complexity of Pop Operation ?

• O (1)

• O(N)

which of the following operations are of STL Stack

• pop

• insert

• front

• push