The following data structure allows deleting data elements from front and inserting at rear

Related MCQs

• Which data structure allows deleting data elements from front and inserting at rear?
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• Which of the following data structure store the homogeneous data elements?
• The following data structure can’t store the non-homogeneous data elements
• The following data structure store the ho- mogeneous data elements
• Which of the following data structure is linear data structure?
• Which of the following data structure is lin- ear data structure?
• Which of the following data structure is not linear data structure?