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
- 634 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
More Data Structures Interview Questions
Can arraylist hold different types?
What is sorting and its types?
Is pointer a variable in data structure?
Define a set?
What is reduction to sorting method?
Define 2-3-4 tree?
How do you perform a merge sort?
What is stable sort example?
Where will be the free node available while inserting a new node in a linked list?
What is the best case complexity of quicksort?
Why is quicksort better than mergesort?
What member function places a new node at the end of the linked list?
Windows 
