PA 8001 2014 Extra Practical 0

From CERES
Jump to: navigation, search

In this exercise you implement a program which works with a queue of jobs. Each job in this queue has a processing time. In order to implement the queue you should create a linked list. There are a number of references where you can have a quick review on dynamic allocation and linked lists such as here.

  • First start by writing a simple program working with printf and scanf functions.
  • Download the zip file corresponding to this exercise.

The function which creates the linked list is already implemented. Notice that the size of the queue and the processing time of the jobs should be inserted as input. Complete the JobQueue.c and main.c as explained in the comments in these files.