## Buy/Download all MCQ Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Queue Operations

## Click on any option to know the CORRECT ANSWERS

Question 1 |

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a?

Queue | |

Stack | |

Tree | |

Linked list |

Question 2 |

The data structure required for Breadth First Traversal on a graph is?

Stack | |

Array | |

Queue | |

Tree |

Question 3 |

A queue is a?

FIFO (First In First Out) list | |

LIFO (Last In First Out) list | |

Ordered array | |

Linear tree |

Question 4 |

In Breadth First Search of Graph, which of the following data structure is used?

Stack | |

Queue | |

Linked list | |

None of the mentioned |

Question 5 |

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?

ABCD | |

DCBA | |

DCAB | |

ABDC |

Question 5 Explanation:

Queue follows FIFO approach.

There are 5 questions to complete.