Stacks and Queues

Which of the following usees FIFO method

• Queue

• stack

• linklist

• binary tree

This form of access is used to add and remove nodes from a queue.

• LIFO, Last In First Out

• FIFO, First In First Out

• Both a and b

• none

........ form of access is used to add remove nodes from a stack.

• LIFO
• Fifo
• none
• all

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 number of elements present on stack are

• 1

• 2

• 3

• 4

The following circular queue can accommodate a maximum six elements with the following data

front = 2 rear = 4

queue = ____; L ; M; N; ___; ___

What will happen after ADD O operation takes place?

• front = 2 rear = 5

  queue = ______; L, M, N, O, ___

• ront = 3 rear = 5

  queue = L, M, N, O, ___

• front = 3 rear = 4

  queue = ______; L, M, N, O, ___

• ront = 2 rear = 4

  queue = L, M, N, O, ___

What method is used to add an element to a Queue?

• dequeue()

• enqueue()

• push()

• pop()

What method is used to add an element to a Stack?

• dequeue()

• enqueue()

• push()

• pop()

What method is used to remove an element from a Stack?

• dequeue()

• enqueue()

• push()

• pop()

What method is used to remove an element from a Queue?

• dequeue()

• enqueue()

• push()

• pop()

What method is used to view the next element to be removed from a stack?

• dequeue()

• NextItem()

• peek()

• pop()