Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 946 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
Define a Deque?
What is the time complexity of arrays sort?
How many passes are required in bubble sort?
Describe tree database. Explain its common uses.
What is rule regarding overriding equals and hascode method?
what is a balanced tree.
What is stack push?
Do you know how to find if linked list has loop?
what is R-B tree
What is a b+ tree? Explain its uses.
What is the idea behind splaying?
What is lifo?
Windows 
