OS Question Bank

Disclaimer: The provided question bank contains ONLY IMPORTANT
questions for exam preparation. Please note that the coverage of the entire
syllabus is recommended and necessary.
Operating System Question Bank
1. Give the Difference between Multi-Programming, Multi-tasking, Multiprocessing
Systems.
2. Explain different types of OS in detail
3. What is Kernel? Differentiate between Monolithic Kernel andMicro Kernel.
4. Explain different service provided by operating system.
5. What is system call? Explain steps for system call execution.
6. What is Process? Draw the Five State Process Model and Explain it.
7. Give the Difference between Thread and Process.
8. Write the difference between the user-level thread and the Kernal-level thread.
9. The following table gives the arrival time and expected run time of five processes.
Find the average turnaround time for following the scheduling algorithm.
a. Round robin (quantum = 1 sec),
b. Shortest Job First.
c. FCFS
10. Define the following terms.
Context switching, Dispatcher, Throughput, Waiting Time, Turnaround Time,

Response Time, Short Term Scheduler, CPU Utilization, Long term scheduler,
Short term scheduler, Medium term schedular.
11. Define: Mutual Exclusion

12. Write a note on Critical section
13. Explain race condition with the help of Producer-Consumer problem.
14. List and define the three conditions needed to achieve synchronization. ( in this
you have to explain Mutual Exclusion, progress, bounded waiting)
15. Discuss Peterson's solution and how it ensures mutual exclusion, progress and
bounded waiting.
16. What is semaphore?
17. Explain the types of the semaphore.
18. Describe Down()/ P() and Up()/V() operations for counting and binary
semaphores.
19. Explain the Bounded buffer producer-consumer problem using Semaphore.
20. Explain the dining philosopher problem. Provide a solution to the dining
philosopher problem using semaphores.
21. Define deadlock in the context of operating systems. Explain the conditions
necessary for deadlock to occur.
22. How can we prevent the deadlock? Explain in detail.
23.
Consider the snapshot of the system with Five Processes and Fourtypes of resources
A,B,C,D. The currently available set of resources is(1,5,2,0). Answer the following
Questions using the banker algorithm.
A. Find the content of Need Matrix.
B. Is the System in a Safe State? If yes, write Safe sequence.
C. If a request from Process P1 arrives for (0,4,2,0) can the requestbe granted
immediately?
24. Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit

25. What are First fit, Next fit, and best-fit allocation strategies? Given memory
partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how
would each of the first-fit, best-fit and worst-fit algorithms place processes of 212
KB, 417 KB, 112 KB and 426 KB (in that order) ? Which algorithm makes the
most efficient use of memory?
26. What is Paging? What is Page Table? Explain the conversion of Virtual Address to
Physical Address in Paging with example.
27. What is fragmentation? Explain the difference between internal and external
fragmentation.
28. What is demand paging? Explain the steps of Demand paging with a diagram.
29. For the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1,

7, 0, 1. And the size of page frame be 3. Calculate the page faults applying the
following Page Replacement Algorithms for a memory with three frames: (I)
Optimal (II) LRU (III) FIFO
30. Consider a system where the main memory access time is 100ns and the TLB
access time is 20ns. The hit ratio is 95%. What is an effective memory access time
with and without TLB?
31. Consider a system where Main Memory access time is 30 ns. Page fault service
time is 300 ns. Page hit ration is 85%. What is Effective Memory Access
Time(EMAT)?
32. Describe various file organization techniques.
33. Explain the concept of Direct Memory Access (DMA) and its significance in I/O.
34. Discuss the structure of a disk and its components.
35. Suppose Disk drive has 300 cylinders. The current position of the head is 90.
The queue of pending request is 36,79,15,120,199,270,89,170. Calculate head
movement for the following algorithms.
1. FCFS 2. SSTF 3. SCAN 4. C-SCAN

OS Question Bank

Uploaded by

Copyright:

Available Formats

OS Question Bank

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

OS Question Bank

Uploaded by

Copyright:

Available Formats

Disclaimer: The provided question bank contains ONLY IMPORTANT

7. Give the Difference between Thread and Process.

a. Round robin (quantum = 1 sec),

b. Shortest Job First.

10. Define the following terms.

Context switching, Dispatcher, Throughput, Waiting Time, Turnaround Time,

11. Define: Mutual Exclusion

13. Explain race condition with the help of Producer-Consumer problem.

16. What is semaphore?

17. Explain the types of the semaphore.

19. Explain the Bounded buffer producer-consumer problem using Semaphore.

A. Find the content of Need Matrix.

B. Is the System in a Safe State? If yes, write Safe sequence.

24. Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit

29. For the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1,

32. Describe various file organization techniques.

34. Discuss the structure of a disk and its components.

You might also like