DSU MCQ on Stacks & Queues

Stack is also called as

• First in first out

• First in last out

• Last in last out

• Last in first out

Any node is the path from the root to the node is called

• Ancestor node

• Successor node

• Internal node

• None of the above

Which of the following is not the type of queue?

• Priority queue

• Circular queue

• Single ended queue

• Ordinary queue

......... 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 of these

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

• LIFO

• FIFO

• Both A and B

• None of these

In the linked representation of the stack ......... behaves as the top pointer variable of stack.

• Stop pointer

• Begin pointer

• Start pointer

• Avail pointer

New nodes are added to the ......... of the queue.

• Front

• Back

• Middle

• Both A and B

What happens when you push a new node onto a stack?

• The new node is placed at the front of the linked list

• The new node is placed at the back of the linked list

• The new node is placed at the middle of the linked list

• No Changes happens

Circular Queue is also called ________

• Square Buffer

• Ring Buffer

• Rectangle Buffer

• Curve Buffer

What kind of a datastructure does a queue is?

• Linear

• non-linear

• both A&B

• none