The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+6 votes
208 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 (7.3k points)
edited by | 208 views

2 Answers

+6 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 (96.5k 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 (55.4k points)
edited by
Plz check my answer.
Got it habib..
i forget to take two pointer.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,981 questions
36,818 answers
91,195 comments
34,706 users