Q1. When do page faults take place? describe the actions taken by the operating system when a page fault takes place.
Q2. describe why are segmentation and paging sometimes joined to one scheme?
Q3. Describe the given allocation algorithms by giving an appropriate illustration:
Q4. Describe some of the most common schemes for defining the logical structure of a directory.
Q5. Assume that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is presently serving a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is:
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Beginning from the present head position, illustrate the total seek distance (in cylinders) that the disk arm moves to satisfy all pending requests for each of the given disk-scheduling algorithms?
Q6. Illustrate the deadlock-detection algorithm in the fully distributed system.