NARAYANA ENGINEERING COLLEGE::NELLORE

Permanently affiliated to JNTUA, Ananthapuramu

(Accredited by NAAC with “A+” Grade)

OPERATING SYSTEMS (19A05403T)
12 Marks Questions
Class : II Year II Sem Academic Year : 2021-22
Branch : CSE Staff :T.Sai Prasad Reddy
UNIT-I

S.No Question CO BL Marks

1 Explain briefly about computer system architecture? 1 2 12

2 Explain about operating systems structure? 1 2 12

3 Explain different functions of operating system? 1 2 12

Explain the different services provided by an Operating

4 1 2 12
System?

5 Explain different types of system calls? 1 2 12

Explain about user mode and kernel mode with a neat
6 1 2 12
diagram?
Define Operating System and explain different OS
7 1 2 12
operations?
8 Explain the evolution of operating systems? 1 2 12

9 Explain different user and operating systems interface? 1 2 12

Write a short note on the following
10 1 2 12
a) Real Time Systems b) Distributed Systems
 UNIT-II
S. C B Mar
Question
No O L ks
Explain with a neat diagram various Process States and the
1 2 3 12
importance of Process Control Block?
2 Explain with a neat diagram the concept of Scheduling Queues? 2 2 12
3 Describe briefly about context switch with a neat diagram? 2 3 12
a) Consider the following five processes, with the length of the
CPU burst time given in milliseconds. Find Average Waiting
Time and Turnaround time for given process using FCFS
algorithm?

Process Burst Time 2 3 6

4 P0 4
P1 10
P2 7
P3 2
P4 5
b) Write about the critical section problem. 2 2 6
What is Semaphore? Explain its implementation for providing
5 2 2 12
process synchronization?
a) What is process synchronization? 2 2 6
c) Consider the following five processes, with the length of the
CPU burst time given in milliseconds. Find Average Waiting
Time and Turnaround time for given process using SJF
algorithm (non-preemptive)?
6
Process Burst Time 2 3 6
P1 5
P2 3
P3 1
P4 3
P5 5
 Explain the critical section problem? What are the minimum
7 requirements that should be satisfied to critical section problem? 2 2 12
Explain with an example the Banker’s algorithm for Deadlock
8 2 4
avoidance? 12
a) Define Deadlock and explain briefly about Deadlock
Characterization? 2 2 6
9
b) Explain in detail about Dining Philosophers problem? 2 4 6
Explain briefly about Deadlock Detection and various Deadlock
10 Prevention Techniques? 2 3 12