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
- 107046 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 |
Explain singly linked list in short.
What is difference between concurrenthashmap and hashtable?
Why linked list is required?
In Data Structure, write output of given program.
0 Answers HPCL, Hughes Systique Corporation,
What are two types of sorting?
What is binary tree in computer science?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Which is faster array or linked list?
What does isempty() member method determines?
What is worst case complexity algorithm?
List the data structures which are used in rdbms.
Does treemap allow null keys?
Windows 
