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.
- 0 Answers
- 762 Views
- I also Faced
- E-Mail Answers
More Data Structures Interview Questions
What do you know about different sorting algorithms?
For addition and deletion. Which one is most preferred: array list or linked list?
Which sorting algorithm uses minimum number of swaps?
Differentiate null and void?
Which sorting algorithm is used in arrays sort?
What is quick sort example?
What is a hashers run?
How do I use quick sort?
Explain the internal working of a hash map?
What is difference between list and array?
What happens if an array goes out-of-bounds?
How many types of search algorithms are there?
Windows 
