Let me explain the queue thing some more. I have to set up a program that will read in a bunch of randomly generated times and calculate them in different stages. It's called a nonpreemtive shortest job first algorithm. I have a process queue(or a linked list), a memory queue, and an execution queue. The process queue needs to contain a process id, memory space requirement, cpu time requirement, and a status field. The memory queue should have a starting address and a segment size. The execution queue needs to have a process id(the same as the process id), a starting address, an execution time, allocated memory size, and a status. I know this is all very complicated, but really what I need to know is can I create a bunch of different queues (or linked lists) to represent all of these.
