Scribd
Upload
2 views3 pages

OS_QBank

The document is a question bank for an Operating Systems course at P. R. Thakur Government College, containing short and long questions related to key concepts in operating systems. Topics include process management, scheduling algorithms, deadlock conditions, and differences between various types of systems. It serves as a study guide for students to prepare for examinations in computer science.

Uploaded by

sujoymondal5484
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views3 pages

OS_QBank

The document is a question bank for an Operating Systems course at P. R. Thakur Government College, containing short and long questions related to key concepts in operating systems. Topics include process management, scheduling algorithms, deadlock conditions, and differences between various types of systems. It serves as a study guide for students to prepare for examinations in computer science.

Uploaded by

sujoymondal5484
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

P. R.

Thakur Government College


Department of Computer Science
Operating System Question Bank

Short Questions-
(a) What is meant by light in light weight process?
(b) What do you mean by PCB?
(c) Differentiate between waiting time and response time.
(d) What is Race Condition?
(e) What is resource abstraction?
(f) What is batch processing?
(g) What is shell? What is kernel?
(h) When does system call invoke?
(i) What is a 'semaphore"?
(j) Mention any two differences between multi-programming and multi-tasking.
(k) What is the difference between 'client-server' and peer-to-peer' architecture?
(l) What role does 'context switch' play?
(m)Differentiate between long-term scheduler and short-term scheduler.
(n) How does a real-time operating system differ from a traditional one?

(o)
(p) What are the differences between User Level Thread and Kernel Level
Thread?
(p)

Long Questions-
1. Draw the process state diagram and explain its various states.
2. Explain types of scheduler in operating system.
3. Compare Network Operating System with Distributed Operating System.
4. What are the necessary conditions for deadlock?
5. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P (Wait)
operations and 15 V (Signal) operations were completed on this semaphore. Find resulting value
of the semaphore.
6. Consider the following set of processes, with the length of the CPU-burst time given in
milliseconds:
Process Burst-Time Priority
P1 8 2
P2 6 1
P3 3 4
P4 4 5
P5 7 3
Calculate the average turnaround time and average waiting time of each process for each of the
following scheduling algorithms:
(a) FCFS (b) SJF.
7. Consider the following set of processes along with their arrival time and the length of CPU
burst-time given in msec :

Implement the following scheduling algorithms on the above scenario, draw the corresponding
Gantt
chart and calculate the average waiting time in each case : (1) SJF, (ii) SRTF.
8. Explain how the 'strict alternation' algorithm violates the necessary 'progress' condition of the
critical section problems.
9. Why is deadlock prevention considered as a poorer approach, when compared to deadlock
avoidance?
10.
11.

12. What do you mean by the CPU-burst and I/O-burst times? What could be the estimation for
the next predicted CPU-burst time for SJF scheduling? How can you say the SJF scheduling as a
special kind of Priority Scheduling?
Write short note on-
(a) Real Time Operating System
(b) System Call
(c) Starvation.

You might also like