Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / sudhir & kranti
It is one of the special variation of queue which allows the elements to be inserted and removed at both ends (rear and front) but not at middle.
De-queue can be of 2 types
i)Input restricted de-queue: elements can be removed at both ends but insertion at one end.
ii)Output restricted de-queue: elements can be inserted at both ends but deletion at one end.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What is sequential sorting?
What do you mean by secondary clustering?
Describe queue operation.
Which searching algorithm is best?
What are linked lists used for?
How many types of linked list are there?
What is the best case for bubble sort?
Which is better stack or queue?
What is the difference between ienumerable and list?
What is binary search in programming?
What is the main advantage of a linked list?
What is a Breadth First Search? Give a few of its applications.
What does isempty() member method determines?
What is the best case complexity of quicksort?
Define a set?
