Scribd
Upload
49 views1 page

IMP Questions

This document contains 21 questions about operating system concepts including batch, time-sharing, and real-time operating systems, multitasking, processes and threads, process states and queues, semaphores, deadlock prevention and avoidance, memory management techniques like paging and segmentation, virtual memory, disk scheduling, preemption, RAID levels, and synchronization problems like the readers-writers problem and producer-consumer problem. It asks about scheduling algorithms, memory partitioning schemes, page replacement algorithms, virtual address translation, process control blocks, and the banker's algorithm for deadlock avoidance.

Uploaded by

Wednesday
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
49 views1 page

IMP Questions

This document contains 21 questions about operating system concepts including batch, time-sharing, and real-time operating systems, multitasking, processes and threads, process states and queues, semaphores, deadlock prevention and avoidance, memory management techniques like paging and segmentation, virtual memory, disk scheduling, preemption, RAID levels, and synchronization problems like the readers-writers problem and producer-consumer problem. It asks about scheduling algorithms, memory partitioning schemes, page replacement algorithms, virtual address translation, process control blocks, and the banker's algorithm for deadlock avoidance.

Uploaded by

Wednesday
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/ 1

OPERATING SYSTEM

IMP Ques ons


1. Define the essen al proper es of the following types of opera ng systems: (1) Batch
(2) Time-sharing (3) Real- me.
2. Explain Mul programming and Mul processing OS with their advantages and
disadvantages.
3. What is Thread? What are the difference between user-level threads and kernel
supported threads?
4. What is Process State? Explain different states of a process with various queues
generated at each stage.
5. What is Semaphore? Give the implementa on of Readers-Writers Problem using
Semaphore.
6. What is deadlock? Explain deadlock preven on in detail.
7. What are the disadvantages of FCFS scheduling algorithm as compared to shortest
job first (SJF) scheduling?
8. What is deadlock? Explain deadlock Avoidance in detail. Also Men on the condi ons
that leads to deadlock.
9. What are Pages and Frames? What is the basic method of Segmenta on?
10. Briefly explain and compare, fixed and dynamic memory par oning schemes.
11. Explain the best fit, first fit and worst fit algorithm.
12. Explain Disk arm scheduling algorithm.
13. Define preemp on and non-preemp on.
14. Explain different RAID Levels.
15. What is paging? Discuss basic paging technique in details.
16. Define Virtual Memory. Explain the process of conver ng virtual addresses to
physical addresses with a neat diagram.
17. Explain process control block with diagram
18. Explain producer-consumer problem and solve it using semaphore. Write pseudo
code for the same.
19. What is process? Explain the process crea on and termina on.
20. Explain the Banker’s algorithm for deadlock avoidance with an example.
21. What is page fault? Explain steps to handle page fault with diagram.

You might also like