Scribd
Upload
52 views2 pages

Anurag University: Course: Operating Systems (Common To CSE, CSE-DS, IT & CSE-CS)

os notes

Uploaded by

gudalasubbu143
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
52 views2 pages

Anurag University: Course: Operating Systems (Common To CSE, CSE-DS, IT & CSE-CS)

os notes

Uploaded by

gudalasubbu143
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

R20

QP Code: R20A31CS02

Anurag University
B Tech III Year I-Semester Regular & Supplementary Examinations, Oct/Nov-2023
Course: Operating Systems
(Common to CSE, CSE-DS, IT & CSE-CS)
Time: 3Hours Max Marks: 60
Section –A (Short answer type questions)
 Answer all questions: (10 x 2 =20Marks)

1. Draw the structure of an Operating System.


2. Distinguish Uni-programmed and multi-programmed Operating Systems.
3. Differentiate between pre-emptive and non-pre-emptive scheduling.
4. Define Process synchronization.
5. Justify the role of Resource Allocation Graph.
6. Define a Deadlock with an example.
7. Compare and contrast internal and external Fragmentation.
8. List any two advantages and disadvantages of contiguous memory allocation.
9. Justify the need for File system mounting.
10. Define a program threat with an example.

Section—B (Essay answer type questions)


 Answer all questions: (5 x 8 =40 Marks)

11. A) Define an Operating System. Discuss various services offered by an Operating


System?
OR
B) Define a system call? Explain various types of system calls provided by an
Operating system with suitable examples.

12. A) Define CPU scheduling. Compare and contrast FCFS and Round robin scheduling
schemes.
OR
B) Consider the following set of processes with the arrival time and CPU burst time
given in milliseconds. Calculate average waiting time, average turn around time and
average completion time using round robin algorithm with 2ms time slice. Draw the
gantt chart.

Process Arrival Time Burst Time Priority


P1 0 7 2
P2 1 4 1
P3 2 15 3
P4 3 11 5
P5 4 20 6
P6 4 9 4

P.T.O
13. A) Considering a system with five processes P1 through P5 and three resources of type
A, B, C. Resource type A has 10 instances, B has 5 instances and type C has 7 instances.
Suppose at time t0 following snapshot of the system has been taken:

Process Allocation Max Available


A B C A B C A B C
P1 0 1 0 7 5 3 3 3 2
P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3

i. What is the reference of the need matrix?


ii. Determine if the system is safe or not.
iii. What will happen if the resource request (1, 0, 0) for process P1 can the system
accept this request immediately?
OR
B) A Deadlock can be prevented by eliminating any of the four necessary conditions.
Elaborate the necessary conditions that can prevent the deadlock situations

14. A) Compare and contrast Paging and Segmentation.


OR
B) Examine FIFO and LRU page replacement algorithms with suitable examples.

15. A) Illustrate various protection and security measures provided by an Operating System.
OR
B) Discuss various file access methods with suitable examples

You might also like