Question

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.

Answer 1

For this we can design queue of queues using linked list.

We can use multiple no of linked list for designing this.

Link 1 ---- Link 2 ---- Link 3 .....(As for no of queue increasing ......till n ...)
| ----------------- | ----------- |
Link a -------- Link a ----- Link a
Link b -------- Link b ----- Link b
Link c --- -------------- --- - Link c
Link d
Link e

So dynamically when a new queue is created u can add to the queue to the upper linked list (Link1 .. Link2)
and if you want to inser any item in to the particular queue then also u can also add elements (Link a, lInk b ) to the respective queue.

Hope it help...Here it is unable to draw But picture i can make it better expressible.

Comments

I like answer for Sachidananda. Also thought of an alternate

We can use Hashtable and override hash function to select which queue it will go in :)