Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 104263 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / chandrashaker
the answers above said(linked lists,stacks,queues)are not correct answers.the correct answer is "dqueus" also called it as double ended queue in which we can insert all the elements from front and rear
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / arockia dass
Enque and Deque is used to insert or remove an element at
the start or end of the queue
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / saran
deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / sarmistha saha
double ended queue.
and i am sure about this
| Is This Answer Correct ? | 0 Yes | 0 No |
What are different techniques for making hash function?
What is scalar example?
Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?
Does hashmap allow duplicate keys?
How does sort function work?
What is an object array?
How will you reverse Linked List.
Define a right-skewed binary tree?
If I try to add enum constants to a treeset, what sorting order will it use?
What are examples of data structures?
Define a tree?
What happens in insertion sort?
Windows 
