Scribd
Upload
14 views3 pages

HCSCR3062T 2022

Question

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 2022

Question

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


DECEMBER 2022
B.A./B.Sc.
Monday, December 05, 2022
HCSCR3062T 01:00 PM to 03: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.


2022 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) What is the purpose of system calls? What are the different states of a process? Explain. [2+3]
(b) What is multi-threading? What are the benefits of multi-threaded programming? [2+3]

2. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3.
Resource type R1, has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at
time T0, the following snapshot of the system has been taken :
Allocation Max Available
Process
R1 R2 R3 R1 R2 R3 R1 R2 R3
P0 0 1 0 7 5 3 3 1 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 2 2 4 3 3

Do you think the system is in safe state? Explain. Assume that now the process P1 requests one
additional instance of type R1 and two instances of resource type R3. Find out the system is in safe
state or not after giving the requested resource to P1. [6+4]

3. (a) State why strict non-preemptive scheduling is unlikely to be used in a computer. (2)

(b) Differentiate the terms Mutual Exclusion and Critical Section with proper explanation. (4)

(c) How the critical Section problem can be solved using Semaphore? Explain. (4)

2022 2
4. (a) Why is the synchronization of processes required? Explain with suitable example. (5)
(b) Give the difference between Starvation and Deadlock? Define race condition. (3+2)

5. Write short notes ANY TWO from the following: (5+5)


(a) PCB
(b) Schedulers used in OS
(c) Multi-level Feedback queue scheduling.

GROUP - B

Answer ANY TWO : [2×10 = 20]

6. (a) What do you mean by Virtual Memory? Is it dependent on Address bus size of a processor?
If yes explain. (2+2)
(b) What is paging? Draw and explain the structure of a page table. (1+3)
(c) Explain the concept of segmented paging and page segmentation with example. (2)

7. (a) Consider a disk queue with request for input/output to block on cylinders
98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned
at cylinder 53 and moving towards cylinder number 0. Find the total number of head
movements using Shortest Seek Time First (SSTF) and SCAN algorithms. [2.5+2.5]
(b) Explain about the difference between internal fragmentation and external fragmentation. (3)
(c) Differentiate local and global page replacement algorithm. (2)

8. (a) Given memory partitions of 100K, 500K, 200K, 300K, and 600K (inorder), how would each
of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K,
and
426K (in order)? Which algorithm makes the most efficient use of memory? (6)
(b) What are the techniques of page replacement policies? Do you think LRU is better than
FIFO? Explain with suitable example. (2+2)

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

2022 3

You might also like