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
- 105740 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / vivek tiwari
I think that Linked List is not correct answer. Because
items can be added at middle.....
| Is This Answer Correct ? | 42 Yes | 3 No |
Answer / achintya shankar adhikari
it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..
| Is This Answer Correct ? | 25 Yes | 3 No |
Answer / naz
Dequeue is the exactly Right answer........am 100% sure for
it.........
| Is This Answer Correct ? | 22 Yes | 0 No |
Answer / auradi
Double ended queue is the way in which a elements r inserted
and deleted from either end not been inserted from middle or
removed.....
I am Sure about this answer plz check tenenbam
Datastructure using c and c++ there is an explanation given
for this
| Is This Answer Correct ? | 25 Yes | 3 No |
Is it possible to increase size of array?
What is meant by deque?
What is faster array or arraylist?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
What is the height of binary tree?
How do you sort an array in descending order?
What is two-dimensional array?
What are the types of map?
What is the difference between arrays sort and collections sort?
Differentiate between file and structure storage structure.
What is the difference between null and void?
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 ?
Windows 
