Question

Question 4 (Marks: 40) Q.4.1 Redraw the table and categorise the CPU scheduling algorithms by stating at least (10) two examples of each. CPU scheduling algorithm Preemptive Algorithms Non-Preemptive Algorithms Q.4.2 For both Fixed and Dynamic memory allocation schemes, the operating system must keep lists of each memory location, noting which are free and which are busy. a) Identify the two methods for free space allocation. (10) b) List two characteristics of each method. a) State at least one advantage and one disadvantage of each of the methods. Q.4.3 Deadlock involved the interaction of several processes and resources, but each time, it was preceded by the simultaneous occurrence of four conditions that the operating system or other systems could have recognised. (20) a) In a tabular form identify the four required for a locked system b) Briefly describe these four conditions END OF PAPER

          Question 4
(Marks: 40)
Q.4.1 Redraw the table and categorise the CPU scheduling algorithms by stating at least (10)
two examples of each.
CPU scheduling algorithm
Preemptive Algorithms
Non-Preemptive Algorithms
Q.4.2 For both Fixed and Dynamic memory allocation schemes, the operating system
must keep lists of each memory location, noting which are free and which are busy.
a) Identify the two methods for free space allocation.
(10)
b) List two characteristics of each method.
a) State at least one advantage and one disadvantage of each of the methods.
Q.4.3 Deadlock involved the interaction of several processes and resources, but each
time, it was preceded by the simultaneous occurrence of four conditions that the
operating system or other systems could have recognised.
(20)
a) In a tabular form identify the four required for a locked system
b) Briefly describe these four conditions
END OF PAPER

Question 4
(Marks: 40)
Q.4.1 Redraw the table and categorise the CPU scheduling algorithms by stating at least (10)
two examples of each.
CPU scheduling algorithm
Preemptive Algorithms
Non-Preemptive Algorithms
Q.4.2 For both Fixed and Dynamic memory allocation schemes, the operating system
must keep lists of each memory location, noting which are free and which are busy.
a) Identify the two methods for free space allocation.
(10)
b) List two characteristics of each method.
a) State at least one advantage and one disadvantage of each of the methods.
Q.4.3 Deadlock involved the interaction of several processes and resources, but each
time, it was preceded by the simultaneous occurrence of four conditions that the
operating system or other systems could have recognised.
(20)
a) In a tabular form identify the four required for a locked system
b) Briefly describe these four conditions
END OF PAPER

Added by Sheila D.

Question

Please give Ace some feedback