Scribd
Upload
52 views

Course Name: Operating Systems (Os) Part A: Answer All Questions. Each Carries 2 Marks

This document contains details of an Operating Systems exam including: - 3 parts (A, B, C) with multiple choice and long answer questions. - Part A contains 10 short answer questions worth 2 marks each related to OS concepts like peer-to-peer systems, loadable kernel modules, process states, and synchronization. - Part B contains 6 long answer questions worth 5 marks each about deadlock recovery, process creation, scheduling algorithms, and synchronization problems. - Part C contains 5 long answer questions worth 10 marks each involving memory allocation algorithms, virtual memory addressing, file systems, scheduling analysis.

Uploaded by

Sayan Majumder
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
52 views

Course Name: Operating Systems (Os) Part A: Answer All Questions. Each Carries 2 Marks

This document contains details of an Operating Systems exam including: - 3 parts (A, B, C) with multiple choice and long answer questions. - Part A contains 10 short answer questions worth 2 marks each related to OS concepts like peer-to-peer systems, loadable kernel modules, process states, and synchronization. - Part B contains 6 long answer questions worth 5 marks each about deadlock recovery, process creation, scheduling algorithms, and synchronization problems. - Part C contains 5 long answer questions worth 10 marks each involving memory allocation algorithms, virtual memory addressing, file systems, scheduling analysis.

Uploaded by

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

Course Name: OPERATING SYSTEMS (OS)

Max. Marks: 100 Duration: 2.5 Hours


PART A
Answer all questions. Each carries 2 marks.

1 What are the advantages of peer-to-peer systems over client-server systems?


2 What are the advantages of loadable kernel modules?
3 Which are the different process states?
4 What are the three requirements to Critical
Section Problem?
5 Describe how semaphores can be used as a
synchronisation mechanism?
6 What is the main problem with Shortest Job First scheduling and what is its
solution?
7 What are the conditions that lead to a deadlock?
8 Discuss the steps in handling a page fault?
9 Discuss the different aspects of contiguous memory allocation?
10 Explain Belady Anomaly.

PART B
Answer all questions. Each carries 5 marks.
1. What are the measures to recover from a deadlock?
2. Explain the process creation in Unix with the help of suitable example.
What is a PCB (Process Control Block)?
3. Describe the differences among short-term, medium-term and long-term
scheduling?
4. With the help of a diagram, describe the actions taken by the kernel to context
switch between process?
5. Enumerate any three classical problems of synchronisation?
6. Discuss how Resource Allocation Graph can be used for deadlock avoidance?

PART C
Answer all questions. Each carries 10 marks.
1. a) Given six memory partitions of 100KB,500 KB,200 KB,300 KB,600 KB (in order),how
would the first-fit, best-fit and worst-fit algorithms place processes of size 212KB,417
KB,112 KB,426KB(in order). Rank the algorithms in terms of how efficiently they use
memory.
b) Consider a logical address space of 64 pages of 1024 words each, mapped onto a
physical memory of 64 frames.
a. How many bits are required in the logical address?
b. How many bits are required in the physical address?
2 a) Discuss the concept of Virtual File Systems?
b) Suppose that a disk drive has 200 cylinders numbered from 0 to 199.The disk is
currently servicing at cylinder 100 and the previous request was at cylinder 120.The
queue of pending requests in FIFO order is 23,89,132,42,187. Starting from the
current head position, what is the total distance(in cylinders) that the disk arm moves to
satisfy all the pending requests for each of the scheduling algorithms? i)FCFS ii)SSTF
iii)SCAN
3 a) Which are the different access methods of a file?
b) What are the different allocation methods of a file?
4 a) Consider the following segment table:

Segment Base Length


0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
What are the physical addresses for the following logical addresses?
i. 0,430
ii. 1,10
iii. 2,500
iv. 3,400
v. 4,112
b) How is segmentation different from paging?

5. Draw the Gantt Chart , find the average waiting time for the following algorithms
i) FCFS ii) Pre-emptive Priority
iii)Non-pre emptive priority

Arrival Burst
Process Time(ms) time(ms) Priority
P1 0 8 4
P2 2 6 1
P3 2 1 2
P4 1 9 2
P5 3 3 3

*****

You might also like