Which data structure allows deleting data elements from and inserting at rear?

Related MCQs

• Which data structure allows deleting data elements from front and inserting at rear?
• Which data structure allows deleting data elements from front and inserting at rear?
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• 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 ?
• What is the space complexity for deleting a linked list?
• The worst case complexity of deleting any arbitrary node value element from heap is
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• Which of the following data structure can’t store the non-homogeneous data elements?
• Which of the following data structure can’t store the non-homogeneous data elements?