Scribd
Upload
6 views

Operating Systems (2)

This document outlines the examination structure for the Operating Systems course in the II B.Tech II Semester, January 2025. It includes various units with questions on microkernel architecture, process scheduling, memory management, deadlock avoidance, and synchronization. Each unit requires students to answer one question, with a total of 70 marks available.

Uploaded by

redragon165
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
6 views

Operating Systems (2)

This document outlines the examination structure for the Operating Systems course in the II B.Tech II Semester, January 2025. It includes various units with questions on microkernel architecture, process scheduling, memory management, deadlock avoidance, and synchronization. Each unit requires students to answer one question, with a total of 70 marks available.

Uploaded by

redragon165
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/ 2

H.T.No.

Code No: CT3519 SRGEC-R20


II B.Tech II Semester Supplementary Examinations, January 2025
OPERATING SYSTEMS
(Computer Science and Engineering)
Time: 3 Hours Max. Marks: 70
Note: Answer one question from each unit.
All questions carry equal marks.
5 × 14 = 70M
UNIT-I
1. a) Explain the microkernel architecture for operating system. How it is better than layered
architecture? (7M)
b) Explain the system calls used in process control. (7M)
(OR)
2. a) Explain the operating system simple structure. (6M)
b) Explain various services provided by the Operating system to the user. (8M)
UNIT-II
3. Consider the following processes, with the arrival time and the length of the CPU burst given
in milliseconds.
Process Burst Time Arrival Time
P1 6 2
P2 2 5
P3 8 1
P4 3 0
P5 4 4
Draw the Gantt chart, state and prove which scheduling algorithm gives low average waiting
time and average turnaround time using
(i) First Come First Serve
(ii) Non preemptive SJF CPU scheduling algorithm
(iii) Preemptive SJF CPU scheduling algorithm. (14M)
(OR)
4. a) Describe the contents of process control block. Exemplify how PCB is useful in process
context switching. (7M)
b) Briefly explain the following:
(i) Process Scheduling (ii) Scheduling Queues (iii)Schedulers (7M)

Page 1 of 2
UNIT-III
5. Compare paging with segmentation with respect to the amount of memory required by the
address translation structures in order to convert virtual addresses to physical addresses. (14M)
(OR)
6. a) Explain how memory protection is accomplished in paging environment. (7M)
b) Briefly explain FIFO page replacement algorithm. Consider a main memory with four
page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6,
2, 1, 3. How many page faults occur with respect to page replacement policy First-In-First
Out (FIFO) when there are four frames? (7M)
UNIT-IV
7. a) Exemplify how Banker’s algorithm is useful to avoid the deadlock. (7M)
b) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving a request at cylinder at 2150 and previous request was at 1805. The queue of
pending requests in FIFO order is as follows: 2069, 1212, 2295, 2800, 544, 1618, 356,
1523, 4965, and 3681. Starting from the current head position, what is the total distance
that arms moves to satisfy the pending requests using following scheduling algorithms.
FCFS, SSTF. (7M)
(OR)
8. a) Consider a system having ‘m’ resources of the same type. These resources are shared by 3
processes A, B, C, which have peak time demands of 3, 4, 6 respectively. What will be the
minimum value of ‘m’ that ensures that deadlock will never occurs? (6M)
b) Why disk scheduling is needed? Schedule the given requests 98, 180, 32, 120, 24, 124, 68,
74, 10, 150 with the following disk scheduling algorithms and calculate seek time? Let the
current disk arm at 53 location.
(i) SCAN disk scheduling
(ii) C-SCAN disk scheduling
(iii) LOOK disk scheduling
(iv) LOOK disk scheduling (8M)
UNIT-V
9. a) State Dining Philosopher’s problem. How can it be solved using semaphores? (8M)
b) How synchronization can be achieved using locks? (6M)
(OR)
10. a) What is critical section? Explain Peterson’s solution to handle the critical section problem.
(7M)
b) Explain different file access methods in detail. (7M)

*****

Page 2 of 2

You might also like