Professional Documents
Culture Documents
Amrapali Institute of Applied Sciences: Note-Attempt Any Five Question. All Question Carry Equal Marks
Amrapali Institute of Applied Sciences: Note-Attempt Any Five Question. All Question Carry Equal Marks
2. (a) Explain the difference and relationship between a program and process? What is process state explain
with the diagram? 2+3
(b) What is Shell . Describe in brief about the different types of Shell . 3
(c) What is System Call? 2
3. What is Scheduler? What constitutes a good scheduling algorithm? Describe FCFS, Round robin
and Priority scheduling? 2+2+6
4. (a) Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
8
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
i. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority
(a smaller priority number implies a higher priority), and RR (quantum = 1) scheduling.
ii. What is the turnaround time of each process for each of the scheduling algorithms in part a?
iii. What is the waiting time of each process for each of the scheduling algorithms in part a?
iv. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
5. (a) Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each
of the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in
order)?Which algorithm makes the most efficient use of memory?
Give differences between logical and physical addresses. 5
6. What do you mean by ‘Deadlock’? Discuss the methods for handling deadlock. 10
7. (a) What is file? What are the common file types? Describe operation on a file. Discuss the structure of directory5
(b) Explain various access methods for files. Give an example of an application in which data in a file should be
accessed in the: 5
(i) Sequential
(ii) Random Order