Scribd
Upload
56 views3 pages

Question Bank (OS I)

Important questions

Uploaded by

Black Adam
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
56 views3 pages

Question Bank (OS I)

Important questions

Uploaded by

Black Adam
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/ 3

Question Bank

Subject: Operating System I Class: TyBSc(CS)

Q1) Write short answers. Each question carries 1 mark.

a) What is a shell?
b) Define the I/O Bound process.
c) Define the term semaphore.
d) What is a thread library?
e) What is synchronization?
f) What is physical address space?
g) What is context switching?
h) What is a page?
i) Define the term dispatcher?
j) What is booting?
k) Define bootstrapping.
l) What is the role of a dispatcher?
m) List the solutions to critical section problems.
n) What do you mean by page hit?
o) What is kernel?
p) What is the ready queue?
q) What do you mean by I/O bound process?
r) What are the two types of semaphores?
s) What is virtual memory?

Q2) Attempt the following :Each question carries 2 marks.

a) Write advantages of distributed operating systems.


b) Compare preemptive and non preemptive scheduling?
c) List out functions of memory management.
d) List the types of schedulers and also explain short term schedulers in
detail.
e) Define independent and dependent processes.
f) What is the system call? Explain system calls related to device manipulation.
g) Write a short note on multilevel queue scheduling.
h) Explain producer, consumer problem.
i) Explain paging in brief.

Q3) Attempt the following : Each question carries 4 marks

a) Explain the multithreading model in detail.


b) Which three requirements must be satisfied while designing a solutions to
the critical section problem? Explain in detail.
c) Consider the following set of processes with the length of cpu burst time
and arrival time in milliseconds.
Processes B.T A.T
P1 5 1.5
p2 1 0
p3 2 2
P4 4 3

Compute total waiting time and turnaround time using preemptive SJF.
scheduling algorithm
d) Describe PCB with all its fields.
e) Explain the bounded buffer problem in detail.
f) Consider the following reference string and find out the total number of
page faults using OPT and FIFO. Assume no of frames are 3
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3
g) Differentiate between client server and peer to peer computing
environments
h) Describe segmentation in detail

Q.4) Attempt the following : Each question carries 4 marks

a) What is thread? Explain any 2 multithreading models in brief with diagrams.


b) Write short note on logical address and physical address binding with
diagram.
c) Consider following set of processes with the length of CPU burst time
and arrival time given in milliseconds. Calculate waiting time, turnaround
time per each process. Also calculate the average waiting time and average
turn around time using preemptive priority scheduling.
Process Burst time Arrival time Priority
P1 14 4 3
P2 5 2 1
P3 6 9 2
P4 5 5 3
P5 9 0 4

d) Define process. Explain process state diagram in brief.


e) Explain reader-writer problems in brief.
f) Consider a reference string 3,2,1,0,3,2,4,3,2,1,0,4 No. of frames = 3.
Find out the number of page faults using i) LRU ii) OPT.
g) Explain layered operating systems in brief with diagrams.
h) Explain first fit, best fit, worst fit, next fit algorithm.

You might also like