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
- 559 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Explain what is the type of the algorithm used in solving the 8 queens problem?
Which interface treemap implements?
Differentiate between priorityqueue and treeset.
Why do we use different types of data structures?
Why do we use sorting?
How does a hashmap work?
Does stringutils isempty check for null?
What is a bubble sort and how do you perform it?
What is the use of substring?
What is the family trees and connection by clause?
Can hashmap store null values?
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
18 Answers CSC, National Instruments, Sasken, Sybrant Technologies,
Windows 
