- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- If the elements “A”, “B”, “C” and “D” ar...

Q. |
## If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed? |

A. | ABCD |

B. | DCBA |

C. | DCAB |

D. | ABDC |

Answer» A. ABCD |

View all MCQs in:
Data Structures (DS)

- If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
- In a circular queue, how do you increment the rear end of the queue?
- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
- When elements are deleted the nodes go to_________.
- What is the space complexity of a linear queue having n elements?
- What is the time complexity to insert a node based on key in a priority queue?
- What is the time complexity to insert a node based on position in a priority queue?
- The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
- The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

Login to Continue

It will take less than 2 minutes

Report MCQ