title: Round Robin Algorithm Using Circular Linked List
body: <p>Use a circular singly linked list to implement Round Robin process scheduling algorithm in which
  each process is provided a fixed time (quantum) to execute and is pre-empted after that time period
  to allow the other process to execute. Assume a set of ‘n’ processes are ready for execution.
  Read the time quantum and for each of the processes, read the total execution time.
  Name the processes as ‘A’, ‘B’ and so on in sequence. Each node should contain the name
  of the process, its total execution time and the remaining execution time. If a process
  completes its execution, remove it from the list after displaying its name and the
  completion time.</p>
  <p>Input format:</p>
  <p>First line contains the value of ‘n’, the number of processes</p>
  <p>Second line contains the time quantum</p>
  <p>The remaining lines contain the total execution time of the processes in order.</p>
  <pre><code>5
  
  2
  
  6
  
  3
  
  7
  
  5
  
  1
  </code></pre>
  <p>Output:</p>
  <pre><code>E 9
  
  B 12
  
  A 18
  
  D 21
  
  C 22
  </code></pre>