Self Assessment 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

In liked representation of stack ....... holds the elements of the stack.

• INFO fields

• TOP fields

• LINK fields

• NULL fields

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

In linked representation of stack the null pointer of the last node in the list signals ..........

• Beginning of the stack

• Bottom of the stack

• Middle of the stack

• In between some value

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