School of ITEE, University of Queenland
Operating Systems Self-Assessment Quiz 3
last modified Thursday, 17 June 2004 (1:07:16 PM)

If more than one answer could apply, only the best answer will be accepted.

1) Deadlock avoidance is
a) harder to get right than recovering from a deadlock
b) easier to get right than recovering from a deadlock
c) more work in terms of the basic algorithm than recovering from a deadlock
d) b and c
e) none of the above

2) Contiguous allocation as compared with paging
a) is easier to implement (less OS overhead)
b) prevents fragmentation
c) is a good strategy for small physical memories
d) b and c
e) none of the above

3) The working set principle
a) makes it hard to set a limit on physical pages allocated to a process
b) makes it possible to have more virtual than physical address space
c) makes multitasking inefficient in a virtually-addressed machine
d) a and c
e) none of the above

4) FIFO page replacement
a) is an efficient policy in general
b) is easy to implement
c) sometimes has unexpected behaviour (i.e., not what you’d expect in general)
d) b and c
e) none of the above

5) Tree-structured directories
a) allow a name to be reused in different locations
b) allow 2 names for the same thing
c) prevent logical grouping of related files
d) b and c
e) none of the above

6) e. FAT file allocation
a) is very inefficient random access to files (many disk accesses to locate an arbitrary item)
b) is efficient for very large disks
c) supports larger file systems than UNIX inodes
d) all of the above
e) none of the above

Quiz script (minor bug fixes: Philip Machanick) provided by
JavaScriptKit.com