Interested to Buy Any Domain ? << Click Here >> for more details...
what is mean by d-queue?
- 11 Answers
- 25166 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / vinuthna
A deque is a abstract data structure that implements a queue
for which elements can be added to front or rear and the
elements can be removed from the rear or front.
it is also called head-tail linked list
| Is This Answer Correct ? | 77 Yes | 2 No |
Answer / punam & sunita
a deque is a abstract data structure in which insertion and
delection takes place at either side i.e. at rear & front
but not at middle.
| Is This Answer Correct ? | 37 Yes | 2 No |
Answer / baskar
d-queue stands for double ended queue.we can add & delete
elements at either side.they are two other variations like
input restricted deque and output restricted deque.
Input restricted deque means we can delete at both end
but insert only at end of the queue(ie) rear .
Output restricted deque means we can insert at both end
but delete only at end of the queue(ie)front.
| Is This Answer Correct ? | 30 Yes | 2 No |
Answer / ramesh
d-queue stands for double ended queue.we can add & delete
elements at either side.they are two other variations like
input restricted deque and output restricted deque
| Is This Answer Correct ? | 23 Yes | 0 No |
Answer / zakiya
d-queme means doubly ended queue.in which insertion and
deletion can be performed any end.
| Is This Answer Correct ? | 24 Yes | 2 No |
Answer / narendra sharma
d queue is also known as the doubly link list in which data
can be inserted at either end of the list and it is abstract
in nature.
| Is This Answer Correct ? | 15 Yes | 9 No |
Answer / priya
Dequeue is another variation of queue where both insertion
and deletion operation can be made at either ends i.e front
and rear of the structure.
| Is This Answer Correct ? | 3 Yes | 1 No |
Answer / venu
in dqueue there are 2 types.
1.)input restricted queue:-Means insert at rear and delete
at both sides(front and rear).
2.)output restricted queue:-Means insert at both the
ends(front and rear)and delete at one end that to front.
| Is This Answer Correct ? | 6 Yes | 4 No |
Answer / 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 |
Answer / avanesh singh
D-queue is a special type of data structure in which insertions and deletions will be done either at the front end or at the rear end of the queue.
The operations that can be performed on deques are-:
· Insert an item from front end.
· Insert an item from rear end.
· Delete an item from front end.
· Delete an item from rear end.
· Display the contents of queue.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the best case for bubble sort?
Can you sort a hashset?
What is dynamic array how is it created?
Describe what is Node in link list? And name the types of Linked Lists?
Which process places data at the back of the queue?
Explain what is B-tree?
Which is faster treemap or hashmap?
Advanced problems related to Data Structures were asked
Can a hashset contain duplicates?
How can avl tree be useful in all the operations as compared to binary search tree?
What are the applications of linked list?
Write is a binary search tree? Write an algorithm and tell complexity?
0 Answers ITC Indian Tobacco Company,
Windows 
