Q1. Illustrate the different system calls for performing various types of tasks.
Q2. Describe the issues, which require to be looked into designing a distributed operating system.
Q3. What do you mean by threads? Why are they needed? Describe the differences between Kernel level and user level threads?
Q4. Assume that a process scheduling algorithm favors such processes which have used the least processor time in the recent past. Explain why this algorithm will favor Input output bound processes; however not starve CPU-bound processes?
Q5. Explain why is segmented paging significant (as compared to the paging system)? Illustrate the various pieces of the virtual address in segmented paging system?
Q6. Assume that the two processes enter the ready queue with the given properties:
Process 1 consists of a total of 8 units of work to perform, however after every 2 units of work, it should perform 1 unit of Input-output (therefore the minimum completion time of this process is 12 units). Suppose that there is no work to be done given the last Input output operation.
Process 2 consists of a total of 20 units of work to perform. This process occurs just behind P1.
Show the resultant schedule for the shortest first job (preemptive) and the round-robin algorithms. Suppose that a time slice of 4 units of RR. Illustrate the completion time of each process under each and every algorithm?