Scribd
Upload
14 views3 pages

HCSCR3062T 2019

Paper

Uploaded by

lakshminarayanshaw84
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 views3 pages

HCSCR3062T 2019

Paper

Uploaded by

lakshminarayanshaw84
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

ST.

XAVIER’S COLLEGE
(AUTONOMOUS)
KOLKATA

3rd SEMESTER EXAMINATION


NOVEMBER – DECEMBER 2019
B.A./B.Sc.
Saturday, November 16, 2019
HCSCR3062T 1:00 PM to 3:30 PM
2 hours 30 minutes
OPERATING SYSTEMS
Full Marks : 50

READ THESE INSTRUCTIONS FIRST:


• Of the questions attempted, the answers to only the first required number of questions (as stipulated
in the question paper) will be evaluated. So please do not attempt extra questions.
• Use fountain pen or ball-point pen of blue or black ink.
• Answer in your own words as far as practicable.
• Do not write anything on the question paper other than your Roll No.
• Answer each Group in a separate Answer script.

At the end of the examination, fasten all your work securely together.
The marks are given in brackets [ ] at the end of each question or part question.

The question paper consists of 3 pages.


16112019 1
Of the questions attempted, the answers to only the first required number of
questions (as stipulated in the question paper) will be evaluated.
So, PLEASE DO NOT ATTEMPT EXTRA QUESTIONS.

Answer EACH GROUP in a SEPARATE ANSWER SCRIPT.


GROUP - A
Answer ANY THREE : [3×10 = 30]
1. (a) Write the differences between Process and thread. “Multiprogramming means
multiple processes are executed by the processor simultaneously” ― Justify
your answer. [4+2]
(b) Explain the states of a process with proper diagram. [3+1]

2. (a) Consider the following processes :


Process Arrival Time Burst Time(ms)
P1 0 7
P2 2 4
P3 4 1
P4 5 4

Solve the above problem with shortest remaining time first by drawing Gnatt
chart and also calculate the average waiting time and average turn around time. [4]
(b) Write down the solution of Dining Philoshper problem using semaphore. [6]

3. (a) What do you mean by aging in Operating system? [2]


(b) Construct a Resource Allocation Graph for the following scenario. At time 't' Process
P1 request for a resource X, process P2 requests for a resource Y. Both the resources
are Available and they are allocated to the requesting process. At time t1 where
t1>t2 both the processes are still holding the resources, however process P1 request
for Y which is held by P2, process P2 request for X held by P1. Will there be a
deadlock? If there is a deadlock discuss the four necessary conditions for deadlock,
else justify there is no deadlock. [8]

4. (a) ‘Deadlock Prevention is possible by designing a system without the occurrence of


four necessary conditions of Deadlock” – Justify your answer. [3]
(b) Explain that the TestandSet algorithm ensures bounded waiting or not. If not write
the modified TestandSet algorithm. [7]

5. (a) Explain PCB with proper diagram. [6]


(b) Differentiate between preemptive and non preemptive scheduling. [4]

16112019 2
GROUP - B
Answer ANY TWO : [2×10 = 20]
6. (a) Explain the following terms – Seek time and Rotational Latency in respect to disk
access. [4]
(b) Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The work queue is:
23, 89, 132, 42, 187. [6]
Determine the seek time for each of the following disk scheduling algorithms:
FCFS
LOOK
C-SCAN.

7. (a) Explain various types of memory placement techniques with advantages and
disadvantages with example. [6]
(b) Explain Belady’s Anomaly with an example. [4]

8. Consider the following page reference sequence: [10]


7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
Assume the main memory is initially empty and number of page frame is 3.
Calculate the hit ratio by using the following algorithm
(i) FIFO (ii) LRU (iii) Optimal.

*******************

16112019 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy