McqMate

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 |

2.6k

0

Do you find this helpful?

13

View all MCQs in

Data Structures (DS)No comments yet

- 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
- In a priority queue, insertion and deletion takes place at ………………
- 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?
- 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?
- 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.
- Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- 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 ?
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end___________.