Know your data structures!
Some operating systems use a process management scheme called round robin scheduling. It is implemented in the kernel to allow for running multiple processes at once. The backbone behind this method is a circular, doubly-linked list.
The job of
insert is to insert the object to which
new_node points at the head of the given linked list, which is given by following the pointer in
1 2 3 4 5 6 7 8 9 10 11 12
The procedure above is only missing one line (line 9). Which of the following is the correct line that should be there?