- Computer Science Engineering (CSE)
- Data Structure (DS)
- Which data structure allows deleting dat...

Q. |
## Which data structure allows deleting data elements from front and inserting at rear? |

A. | stacks |

B. | queue |

C. | dequeue |

D. | binary search tree |

Answer» B. queue |

View all MCQs in:
Data Structure (DS)

- Which data structure allows deleting data elements from 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?
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- 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?
- Which of the following data structure is not linear data structure?
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

Login to Continue

It will take less than 2 minutes

Report MCQ