Scribd
Upload
14 views2 pages

OSY Assignment 2

Second

Uploaded by

Omkar Rakhonde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

OSY Assignment 2

Second

Uploaded by

Omkar Rakhonde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Define following terms i) Page fault ii) paging iii) Segmentation iv) virtual memory
2. List any four file attributes.
3. Describe different scheduling criteria. Or Explain any four CPU scheduling Criteria.
(Throughput, Turnaround time, waiting time, Response time, Completion time, Burst time, CPU
utilization etc.)
4. Define deadlock and state the necessary conditions for deadlock.
5. Explain following terms with respect to Memory management: I. Compaction II. Swapping.
6. Enlist different file allocation methods and explain any two.
7. Compare between short term and long term scheduler. (any four points)
8. Compare FCFS and SJF Scheduling algorithm with any four points.
9. Describe contiguous memory allocation done by Operating System with the help of
suitable example.
10. Write the output of the following commands.
a. Kill 9042018
b. Ps 07121975
c. Sleep 05
11. Given a page reference string(arrival) with four page frames, calculate the page faults
with FIFO and LRU page replacement algorithms respectively: 12, 3, 4, 5, 1, 2, 5, 1, 2, 3, 4, 5,
1,6,7,8,7,8,9,7,8,9,5,4,4,5,4,2.
12. Solve given problem by Using FCFS to calculate average waiting time and turnaround time.
Process Arrival Burst
time time
P1 0 7
P2 1 4
P3 2 9
P4 3 6
P5 4 8
13. Draw figure of CPU burst followed by I/O burst to achieve maximum CPU utilization concept.
14. Define & explain internal and external fragmentation
15. Draw figure of linked list method for free space management techniques.
16. Describe any four file attributes
17. Draw figure of RAID level 4 and 5
18. Suppose four processes P1, P2, P3 and P4 arriving at a time 0, 1, 2 and 3 respectively. Their burst
times are 8, 5, 4 and 12 units respectively. Calculate average waiting time and average turnaround time.
The approach used by processes is such that if a process with smaller burst time is coming next then
ongoing execution of a process is stopped and CPU will execute that incoming process.
19. Consider the memory map given aside and assume new process P4 comes with memory
requirements of 6KB. Locate this process in memory using 1) first fit 2) Best fit 3) worst fit.

20. Differentiate between Paging and Segmentation (Any 4 points).


21. Explain Resource allocation graph with respect to term Vertices, Edges. Explain the relation of cycles
in resource allocation graph with respect to deadlock occurrence in the following graphs.

22. Consider following set of process that arrive at time 0, with length of CPU burst time given in
millisecond and. Find out average turnaround time and average waiting time using Round Robin
Scheduling algorithm (Time quantum=4).
Process Burst Time
P1 24
P2 3
P3 3
23. Assume we have the workload shown below. All five jobs arrive at time 0 in order given. Consider
FCS, SJFS and Round Robin (time quantum=10) scheduling algorithm for this set of jobs, find out which
algorithm would give minimum average waiting time
Process Burst Time
P1 10
P2 29
P3 33
P4 7
P5 12

You might also like