Scribd
Upload
5 views3 pages

OS Important Questions

The document contains a comprehensive list of important questions related to Operating Systems, covering fundamental concepts such as definitions, scheduling criteria, memory management, process control, and file systems. It also addresses advanced topics like deadlock, virtual memory, and various algorithms for process and disk scheduling. Overall, it serves as a study guide for key topics in an Operating Systems course (BCS-401).

Uploaded by

vaibhavabhisheksinghunnao
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
5 views3 pages

OS Important Questions

The document contains a comprehensive list of important questions related to Operating Systems, covering fundamental concepts such as definitions, scheduling criteria, memory management, process control, and file systems. It also addresses advanced topics like deadlock, virtual memory, and various algorithms for process and disk scheduling. Overall, it serves as a study guide for key topics in an Operating Systems course (BCS-401).

Uploaded by

vaibhavabhisheksinghunnao
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

Important Questions

Operating System (BCS-401)


1. Define Operating System. List the objectives of an operating
system
2. What are the various scheduling criteria for CPU scheduling?
3. What is the use of inter process communication and context
switching?
4. Write the difference between internal and external
fragmentation.
5. What are the disadvantages of single contiguous memory
allocation?
6. Discuss the usage of wait-for graph method.
7. Define Busy Waiting? How to overcome busy waiting using
Semaphore operations.
8. Describe the typical elements of the process control block
9. What is the main function of the memory-management unit?
10. Define SCAN and C-SCAN scheduling algorithms.
11. What is a safe state and an unsafe state? f. Explain the logical
address space and physical address space diagrammatically.
12. Explain Paging with example. Differentiate Paging and
Segmentation.
13. Explain the difference between External fragmentation and
Internal fragmentation. How to solve the fragmentation
problem using paging.
14. What are files and explain the access methods for files.
15. Write short notes on : i) File system protection and security
and ii) Linked File allocation methods
16. Explain what semaphores are, their usage, implementation
given to avoid busy waiting and binary semaphores.
17. What is Producer Consumer problem? How it can illustrate the
classical problem of synchronization? Explain.
18. Explain Paging with example. Differentiate Paging and
Segmentation.
19. Explain the difference between External fragmentation and
Internal fragmentation. How to solve the fragmentation
problem using paging.
20. What do you mean by Belady's anomaly? Which algorithm
suffers from Belady’s anomaly and how can it be rectified?
21. What is Thrashing? What is the cause of Thrashing? How does
the system detect Thrashing? What can the system do to
eliminate this problem?
22. Discuss the Linked, Contiguous and Index and multilevel
Indexing file allocation schemes. Which allocation scheme will
minimize the amount of space required in directory structure
and why?
23. Write short notes on : i) I/O Buffering ii) Disk storage and
scheduling
24. What do you mean by cashing, spooling and error handling.
Explain in detail. Explain FCFS, SCAN & CSCAN scheduling with
example.
25. Difference between Process and Program.
26. Explain Context Switching.
27. What is Demand paging?
28. Explain Concept of Virtual Memory.
29. Difference between Directory and File.
30. Define multiprogramming system.
31. Difference between External and Internal Fragmentation.
32. What is Critical Section?
33. Explain threads.
34. Define services of OS.
35. Explain in detail about the Inter Process Communication
models and Schemes.
36. Explain in detail about the Monolithic and Microkernel
Systems.
37. Explain in detail about the Deadlock System model and
Deadlock characterization.
38. Illustrate the following page-replacement algorithms. i) FIFO
ii) Optimal Page Replacement
39. Explain in detail about the Dining Philosopher Problem.
40. Explain in detail about the Multiuser Systems and
Multithreaded Systems.
41. Explain in detail about the Mutual Exclusion and Critical
Section Problem.
42. Explain in detail about the Process Control Block (PCB) in CPU
Scheduling.
43. Explain in detail about the Disk storage and Disk scheduling.
44. What is Kernel? Describe various operations performed by
Kernel.
45. Explain RAID and its characteristics. Describe RAID levels also.
46. Explain terms: i) Buffering ii) Polling iii) Direct Memory
Access (DMA).

You might also like