St.Francis Institute of Technology
Borivli(W)
Assignment – I
Subject – Operating System
Date given:- 15/2/12
Date of submission:- 21/2/12
1.
Explain features of Modern operating system
2.
Differentiate between Monolithic Kernel and Micro Kernel.
3.
What is PCB? Explain importance of PCB in multiprocessor environment.
4.
Explain ULTs and KLTs in detail.
5.
What are characteristics of real time operating system and explain in detail real time scheduling.
6.
Explain types of processor scheduling.
7.
Write short notes on system calls
8.
Explain in brief the evolution of operating system
9.
What are the objectives and functions of O.S? Explain in brief 'Modern Unix Kernel' .
10.
Explain multiprocessor scheduling
11.
Explain in details reasons for process creation and process termination.
12.
Which of the following scheduling algorithms could result in starvation?
(i) First-Come, First Serve
(ii) Round Robin
(iii) Shortest Job First
(iv) Priority.
13.
Consider the following set of processes, with the length of CPU burst given in milliseconds :
The processes are assumed to have arrived in the order Pl' P2' P3' P4' Ps all at time 0.
(i) Draw Gantt charts for: FCFS, SJF, non-preemptive priority and RR
(Quantum = 1). .
(ii) What is turn around time of each process for each of the above algorithms
(FCFS, SJF, priority, RR)?
(iii) What is the time of each process for each of above algorithms: (FCFS, SJF,priority, RR)? .

(v) Which algorithm results in the minimum average waiting time?
14. Define the essential properties of the following types of operating systems: a. Batch b. Interactive c. Time sharing d. Real time e. Network f. Distributed
15. What are the five major activities of an operating system in regard to
Process management
Memory management
File management
16. What is the main advantage of the layered approach to system design?
17. Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering the questions, use nonpreemptive scheduling and base all decisions on the information you have at the time the decision must be made.
Process
P1 0.0
Arrival Time
8
Burst Time
P2
P3
0.4
1.0
4
1 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm? b. What is the average turnaround time for these processes with the SJF scheduling algorithm? c. The SJF algorithm is supposed to improve performance, but notice that we chose to