In which data structure, elements can be added or removed at
either end, but not in the middle?
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 |
State the difference between arrays and linked lists?
Is it necessary to sort a file before searching a particular item ?
What are the types of array operations?
List the area of applications where stack data structure can be used?
What is mean by abstract data type?
Is array part of collection framework?
What is array simple?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
0 Answers Agilent, ZS Associates,
Is copyonwritearraylist thread safe?
How do you create a tree diagram?
Give a real time example of stack
How many types of sorting algorithms are there?