2081
Bsc CSIT / Semester 4 / Science
Computer Science and Information Technology
Operating System
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 3 Hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.
Attempt any TWO question.
Explain the translation of logical address into physical address using segment table with necessary diagram. List advantages and disadvantages of segmentation.
Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing
the following request queue:
Suppose the disk has tracks numbered from 0 to 150 and assume the disk arm to be at 30 and moving outward.
Explain the Sleeping Barber problem. Illustrate on how it can be solved.
Attempt any EIGHT question.
Explain microkernels and exokernels.
Consider a swapping system in which memory consists of the following hole sizes in memory order:
15 MB, 2 MB, 10 MB, 6 MB, 8 MB and 20 MB.
Which hole is taken for successive segment requests of:
(a) 10 MB
(b) 10 MB
For first fit, next fit and best fit.
Explain how semaphore solves the problem of critical section.
How do you think deadlock can be avoided? Explain.
Explain Inter-Process Communication in Linux.
List different file structures and explain them.
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:
| PID | Brust Time | Arrival Time | Priority |
|---|---|---|---|
| A | 3 | 0 | 3 |
| B | 2 | 2 | 3 |
| C | 4 | 3 | 2 |
| D | 2 | 3 | 1 |
Explain memory-mapped I/O.
Write short notes on:
a. Virtual Memory
b. Race Condition
*** END OF QUESTION PAPER ***
Translation of Logical Address to Physical Address Using Segment Table In segmentation, the logical address is divided into two parts: - Segment Number (s) - Offset (d) within that segment Each proces
Disk Scheduling — SCAN, C-SCAN, LOOK and C-LOOK Given: - Disk tracks: 0 .. 150 - Initial head position = 30 - Head direction = outward (toward higher track numbers) - Request queue: 35, 70, 45,
Sleeping Barber Problem 1. Introduction The Sleeping Barber Problem is a classical process synchronization problem introduced by Dijkstra. It demonstrates how to handle synchronization between mult
Microkernels and Exokernels (5 Marks) Microkernel A microkernel is an operating system architecture where only the most essential and basic functions are kept inside the kernel. Other services run in
Swapping Allocation: First Fit, Next Fit and Best Fit Given Holes in order: 15 MB, 2 MB, 10 MB, 6 MB, 8 MB, 20 MB Requests: (a) 10 MB (b) 10 MB --- 1. First Fit Allocation First Fit selects
And more questions available on this page.