Scribd
Upload
5 views

Operating Systems_

The document outlines the examination structure for the B.Tech II Year II Semester in Operating Systems, including a compulsory question section and five units covering various topics such as system calls, process control, CPU scheduling, virtual memory, and security. Each unit contains specific questions that require detailed explanations or calculations related to operating systems concepts. The exam is designed to assess students' understanding of both theoretical and practical aspects of operating systems.

Uploaded by

vikassibyala36
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Operating Systems_

The document outlines the examination structure for the B.Tech II Year II Semester in Operating Systems, including a compulsory question section and five units covering various topics such as system calls, process control, CPU scheduling, virtual memory, and security. Each unit contains specific questions that require detailed explanations or calculations related to operating systems concepts. The exam is designed to assess students' understanding of both theoretical and practical aspects of operating systems.

Uploaded by

vikassibyala36
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code: IT20APC401 R 20

B.Tech II Year II Semester Regular Examinations September 2022


OPERATING SYSTEMS
(Common to IT and CSE(AI&ML))
Time: 3 hrs. Max Marks: 60
PART-A
(Compulsory Question)
1. Answer the following 05 x 02 = 10 Marks
a) What do you mean by system calls? 2M
b) State critical section problem. 2M
c) What do you meant by thrashing? 2M
d) Define Starvation in deadlock. 2M
e) List various program threats. 2M
PART-B
Answer All five Units 05 x 10 = 50 Marks
UNIT-I
2. List and explain various services provided by operating systems in detail. 10 M
OR
3. a) Demonstrate the importance of each block in process control block (PCB). 5M
b) Discuss various operations on process with suitable diagram. 5M
UNIT-II
4. a) Define thread. Explain advantages of threads. 5M
b) What is readers-writers problem? How to solve the problem using semaphores? 5M
OR
5. Consider the set of 6 processes who’ s arrival time and CPU burst times are given 10 M
below
Process ID Arrival time Burst time
P1 5 5
P2 4 6
P3 3 7
P4 1 9
P5 2 2
P6 6 3

If the CPU Scheduling policy are Round Robin with time Quantum = 3 msec and
Shortest remaining job first. Calculate the average waiting time, average
turnaround time of a process in the above schedules.
UNIT-III
6. a) What is paging? Is page and frame are same? Justify. 5M
b) Consider a disk queue with requests for I/O to blocks on cylinders 78, 84, 163, 45, 5M
112, 14, 103, 65, 73, 59. The head is initially at cylinder number 67. The cylinders
are numbered from 0 to 200. Find he total head movement (in number of cylinders)
incurred while servicing these requests (Using FIFO, SSTF, and SCAN
algorithms).
OR
7. a) What is virtual memory? Explain how paging supports virtual memory. 6M
b) Explain the basic concepts of segmentation in detail. 4M

Page 1 of 2
Code: IT20APC401 R 20
UNIT-IV
8. a) A single processor system has three resource types X, Y and Z, which are shared 5M
by three processes. There are 6 units of each resource type. Consider the
following scenario in the table given and apply banker’s algorithm to find whether
system is in safe state or not, if it is in safe stat find out all possible safe state
sequences.

Allocation Max needed

X Y Z X Y Z

P0 1 2 2 2 2 4

P1 2 1 1 2 1 3
P2 3 2 1 3 4 1
b) What is RAID structure? List different levels of RAID structure. Explain RAID 0, 5M
RAID 1, and RAID1+0.
OR
9. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is 10 M
currently serving a request at cylinder 2,150, and the previous request was at
cylinder 1,805. The queue of pending requests, in FIFO order, is:
2069, 1212, 2296, 2800, 544, 1618, 356, 1523, 4965, 3681
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 following
disk-scheduling algorithms?
i) FCFS
ii) SSTF
iii) C-SCAN
iv)C-LOOK.
UNIT-V
10. a) Give short note on Revocation of Access Rights. Discuss schemes that implement 5M
revocation for capabilities.
b) Elaborate internal threats and external threats. How can you distinguish protection 5M
and security?
OR
11. a) What is system security? Give short note on user authentication. 4M
b) Explain the following 6M
i) Asymmetric Encryption
ii) Digital Signature
iii) Computer Security Classifications.

*****

Page 2 of 2

You might also like