Scribd
Upload
24 views

DICT 18.1P Operating Systems

The document contains 5 questions regarding operating systems concepts. Question 1 asks to construct Gantt charts for different CPU scheduling algorithms and calculate metrics. Question 2 deals with memory allocation algorithms and paging. Question 3 involves disk scheduling algorithms and calculating head movement. Question 4 checks for possible deadlocks in a resource allocation graph. Question 5 defines terms like process states, burst time, distributed OS features, and compaction.

Uploaded by

Sandaruwi Bookshop & Communication
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
24 views

DICT 18.1P Operating Systems

The document contains 5 questions regarding operating systems concepts. Question 1 asks to construct Gantt charts for different CPU scheduling algorithms and calculate metrics. Question 2 deals with memory allocation algorithms and paging. Question 3 involves disk scheduling algorithms and calculating head movement. Question 4 checks for possible deadlocks in a resource allocation graph. Question 5 defines terms like process states, burst time, distributed OS features, and compaction.

Uploaded by

Sandaruwi Bookshop & Communication
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/ 3

NATIONAL INSTITUTE OF BUSINESS MANAGEMENT

Diploma in information Communication Technology 18.1P


Operating Systems DICT-3-2-09
th
26 October 2019, 9.00 a.m. – 12.00 p.m
This paper contains 05 questions
Answer All questions. Time: THREE hours.
Question 1 – 20 Marks
Process B.T A.T Priority
A 7 0 4
B 4 1 1
C 2 2 1
D 1 3 3
E 6 4 2

1. Construct Gantt chart for CPU scheduling using the algorithms given below and
calculate the Average Waiting Time and Average Turnaround Time of each Process (20
Marks)
1) FCFS
2) SJF non preemptive
3) Priority non preemptive
4) Round Robin Time Quantum 4 ms

Question 2 (20 Marks)

1. Given the memory Partitions of 120K, 600K,50K,300K, 250K and 600K (in order),
how would each of the following algorithms place processes of 112K, 520K,225K,
30K,426K and 155K (in Order)? Which algorithm makes the most efficient use of
memory? (10 Marks)

i. First Fit
ii. Best Fit
iii. Worst Fit

2. Describe the paging algorithm and transform the values from logical memory to
the physical memory. Page size = 8 bytes, Physical memory =40 bytes (10 Marks)

Page 1 of 3
0 A0

7 A7

8 B0 0 1

. 1 2

. 2 4

15 B7 3 0

page
16 C0 table

23 C7

24 D0

31 D7

logical
memory

Question 3 (20 Marks)

1. A hard disk with read/ write head is currently serving a request at track 65 and has
just finished a request at track 155.
Consider the sequence 18, 137, 154, 12, 72, 191, 28, 69, 145 of disk track requests,
draw three sets of graphs clearly indicating following disk scheduling algorithms
and calculate the total head movement required for each algorithm. (20 Marks)

a) FCFS

Page 2 of 3
b) SSTF
c) SCAN
d) C SCAN

Question 4 (20 Marks)

1. Draw a Resource Allocation Graph for the following process descriptions and check
for the possibility of a deadlock.(All resources types have one instance each) (5 Marks)

a) Process A holds P and wants Q


b) Process B holds nothing but wants R
c) Process C holds nothing but wants Q
d) Process D holds S and wants Q and R
e) Process E holds R wants T
f) Process F holds Q and U
g) Process G holds U& T and wants S

2. Consider the following file directories and show the file allocation on a hard disk with
4sectors and 8 tracks, by using following methods.

a) Linked Allocation and FAT method (9 Marks)

File Name Start Block End Block Pointers


File A 0 12 4, 11, 14
File B 5 9 10, 13, 2
File C 1 10 14, 22, 27

b) Contiguous Allocation Method (6Marks)


File Name Start Block Length
File 1 1 3
File 2 14 5
File 3 8 2

Question 5 – 20 Marks
1. Discuss the Process States using a Process State Diagram (5 marks)
2. Define “Burst time” (5 Marks)
3. Explain the features/ Characteristics of a Distributed Operating System (5 Marks)
4. Discuss what is compaction in memory (5 Marks)

Page 3 of 3

You might also like