Q1. Describe any three disk scheduling methods. Give an illustration.
Q2. On a simple Paged system, associative registers hold the most active page entries and the full page table is stored in main memory. When references satisfied by the associative registers take 90 ns and reference via the main memory page table take 220 ns, illustrate the effective access time if 60% of all memory references determine their entries in the associative registers.
Q3. Give a page reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1. Assume that there are three free frames initially; compute how many page faults will take place?
Q4. Illustrate the different file access methods? Describe Sequential access method. How it can be simulated on direct access file?
Q5. Describe the characteristic features of real-time Kernals and the real time CPU scheduling.
Q6. Describe the given distribution synchronization methods:
a) Mutual Exclusion
b) Election algorithm
c) Atomicity
Q7. Describe the compression method in multimedia.