Scribd
Upload
73 views1 page

OSC Question Bank (Unit 1, 2, 3)

The document discusses various topics related to operating systems including distributed operating systems, demand paging, deadlocks, process scheduling, memory management, file systems, and interprocess communication. It addresses design issues for distributed OS, necessary and sufficient conditions for deadlocks, deadlock detection and recovery methods, differences between centralized and distributed systems, paging and translation lookaside buffers, file protection techniques and access methods, process control blocks and state diagrams, deterministic and queuing models, synchronization and solving the critical section problem, paging and segmentation, swapping, free space allocation in file systems, features of process scheduling policies, deadlock avoidance, types of distributed systems, demand paging techniques, contiguous and non-contiguous memory allocation, definitions of

Uploaded by

shubham dhabarde
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
73 views1 page

OSC Question Bank (Unit 1, 2, 3)

The document discusses various topics related to operating systems including distributed operating systems, demand paging, deadlocks, process scheduling, memory management, file systems, and interprocess communication. It addresses design issues for distributed OS, necessary and sufficient conditions for deadlocks, deadlock detection and recovery methods, differences between centralized and distributed systems, paging and translation lookaside buffers, file protection techniques and access methods, process control blocks and state diagrams, deterministic and queuing models, synchronization and solving the critical section problem, paging and segmentation, swapping, free space allocation in file systems, features of process scheduling policies, deadlock avoidance, types of distributed systems, demand paging techniques, contiguous and non-contiguous memory allocation, definitions of

Uploaded by

shubham dhabarde
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

1. Explain design issues of distributed operating system.

2. Explain in brief demand paging


3. What is deadlock? Explain the necessary and sufficient condition for the deadlock.
4. What is deadlock? Explain how deadlock can be detected and recovered with the help of
examples.
5. What is distributed operating system and how it different from the centralized system.
6. Explain the concept of paging with the example and use of TLB
7. Describe file protection techniques and various file access methods
8. Explain process control block and process state diagram
9. Explain deterministic model and queuing model with examples
10. What is the need of synchronization? Explain n-process solution for critical section
problem, giving the proof that it satisfies all the three necessary condition for
synchronization.
11. Explain deadlock algorithm in detail
12. What are various scheduling criteria? Explain one non-preemptive and one preemptive
scheduling algorithm with example
13. Discuss the significance of paging and segmentation
14. Describe swapping in detail
15. Describe how OS maintains and allocates free spaces in File System
16. What is process scheduling and explain various functions performed by process
scheduler. What are the features which a typical process scheduling policy should
contain
17. What is deadlock? Explain about the deadlock avoidance
18. What is distributed operating system> explain the various type of distributed system.
(DOS)
19. Explain demand page memory management technique in detail
20. What is the difference between contiguous and non-contiguous memory allocation?
21. What do you mean by process
22. Explain preemptive and non-preemptive scheduling algorithms
23. Define IPC. Explain in detail that how IPC is implemented in client -server system.
24. What is IPC? Explain shared memory and message passing model for IPC.
25. Explain the concept of segmentation with the help of example.
26. Explain queuing model and simulation model used for evaluations of CPU scheduling
algorithms
27. Explain types of multiprocessors
28. What is mobile operating system> explain types of mobile OS
29. Write shotes notes on
• File Allocation table (FAT) • Features of android OS
• Demand paging • Page fault
• Semaphore • Logical and physical view of
• Simulation OS
• Memory fragmentation • Directory structure
• Layered structure of OS • Global OS
• System calls • Context Switching
• Process states • Critical Section Problem

You might also like