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
- 105705 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / naz
Dequeue is the exactly Right answer........am 100% sure for
it.........
| Is This Answer Correct ? | 22 Yes | 0 No |
Post New Answer View All Answers
Why heap sort is not used?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
Why do we study data structures?
Mention the steps to insert data at the starting of a singly linked list?
How to create an Array?
What is a simple path?
Where is binary tree used?
What are the advantages of binary search over linear search?
Why sorting is used?
What is complexity of bubble sort?
What are the basic data structures?
What is the use of treemap?
Is bucket sort stable?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
What are priority queues?
