NIELIT 2016 DEC Scientist B (IT) - Section B: 15

Question

A ________ is a linear list in which insertions and deletions are made to from either end of the structure.

• A. Circular queue.
• B. Priority queue.
• C. Stack.
• D. Dequeue.

Comments

Dequeue

---

In dequeue insertion and deletion can be done from both the ends.

Answer 1

(D).Dequeue

   Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.

   Operations on Deque:
          insertFront(): Adds an item at the front of Deque.
          insertLast(): Adds an item at the rear of Deque.
         deleteFront(): Deletes an item from front of Deque.
         deleteLast(): Deletes an item from rear of Deque.

     

Answer 2

D) Dequeue.

Dequeue means double ended queue.It can act as queue from front as well as from rear side.Thats why both insertion and deletion is possible from either end.

Answer 3

Dequeue: it's actually DE-queue, i.e Double Ended Queue.  Unlike a simple queue, it allows insertions and deletions from either side of the structure.

Answer 4

The Option D

As in Dequeue, insertion and deletion can be done from both sides