GATE CSE
First time here? Checkout the FAQ!
x
+4 votes
134 views

A queue is a particular kind of abstract data type. Enqueue and Dequeue makes the queue FIFO data structure. There are several efficient implementations of FIFO queues. An efficient implementation is one which can perform the operations of enququeing and dequeueing in O(1) time. The best choice is :

a] DLL                                    c] SLL

b] Dynamic Array                    d] any one of these

asked in Programming by Boss (6.5k points)  
edited by | 134 views

2 Answers

+4 votes
Best answer
The properties which are required are as follows :

a) Since queue length is not fixed , hence we can use either of the three mentioned data structures for our purpose

b) Also it is required that enqueue and dequeue operations are to be done in O(1) time.This can also be done for all.For linked list , we can maintain two pointers  one pointing to front element from where dequeue will take place and the other pointing to rear element for enqueue operation.Hence just by making a few change of pointers , we are able to enqueue an dequeue using single and double linked list.Also can be done using dynamic array by maintaining index of front and rear elements of the queue.

 

Hence D) should be the correct option.
answered by Veteran (65.9k points)  
edited by
+2 votes

Any one can be used if use two or more pointer in case od single and double pointer..Dynamic array take constant time to detele and insert .

 

answered by Veteran (46.2k points)  
edited by
Plz check my answer.
Got it habib..
i forget to take two pointer.

Related questions



Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,040 answers
63,230 comments
24,135 users