|
(a) Describe, using suitable examples,
how the following scheduling algorithms
work: [6]
(i) Shortest job first
(ii) Priority scheduling
(iii) Round robin
(b) (i) Explain the terms external fragmentation and internal fragmentation.
[2]
(ii) Give one drawback of coalescing and one drawback of compaction.
[2]
(c) Describe, using suitable examples, the following methods of indirect
addressing: [6]
(i) Prime number division
(ii) Mid-square
(iii) Folding
(d) Describe two approaches to overflow handling. [4]
(e) (i) List two disadvantages of a single-level directory structure.
[2]
(ii) List one advantage and one disadvantage of a two-level directory
structure. [2]
(iii) List two advantages of a tree directory structure. [2]
(f) The Tower of Hanoi problem is an example of an artificial intelligence
problem.
(i) Describe the Tower of Hanoi problem. [2]
(ii) What is the goal state for the Tower of Hanoi problem? [2]
|