- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- A linear list of elements in which delet...

Q. |
## 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 ? |

A. | Queue |

B. | Stack |

C. | Tree |

D. | Linked list |

Answer» A. Queue |

View all MCQs in:
Data Structures (DS)

- Which data structure allows deleting data elements from front and inserting at rear?
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.
- A linear collection of data elements where the linear node is given by means of pointer is called?
- In a circular queue, how do you increment the rear end of the queue?
- How many pointers are necessarily changed for the insertion in a Linked List?
- What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
- What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
- The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
- 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 ?
- The advantage of a two-way list and a circular header list is combined into a ________.

Login to Continue

It will take less than 2 minutes

Report MCQ