Operating Systems - Module 3 - Important Questions - 18CS43

1. Explain the normal mode of operation of a process and when it is in a deadlock state with suitable example.
2. Briefly explain the characteristics that results in deadlocks
3. Describe deadlocks with the help of a resource allocation graph
4. Briefly explain the methods for handling deadlocks
5. Examine deadlock prevention w.r.t four necessary conditions of a deadlock.
6. Explore and explain the two deadlock avoidance algorithms.
7. How is a system recovered from deadlock.
8. Explain Banker's Algorithm.
9. Explain memory allocation model for a process.
10. Explain the implementation of non contiguous memory allocation using segmentation.
11. Discuss the techniques used to perform fresh memory allocation from a free list.
12. Compare contiguous and non contiguous memory allocation technique
13. Define : i) Virtual memory ii) Page Fault
14. Define : i) Page in operation ii) Page out operation
15. Define : i) Memory fragmentation ii) Memory Compaction.
16. Define : Page and Page Frames.
17. Define : internal and external fragmentation.
18. Define : Paging and external fragmentation.
19. Define : Logical and physical address
20. Explain the concepts involved in demand loading of a page with neat diagram.
21. Explain FIFO and LRU page replacement policies.
22. Explain demand loading of a page with the help of a figure.
23. Discuss the methods used to achieve the memory protection with a suitable example.
24. Describe the memory allocation methods for program controlled blocks.
25. Explain demand paging preliminaries.

Operating Systems - Module 2 - Important Questions - 18CS43

1. With the help of a state transition diagram explain fundamental state transitions of a process.
2. Explain fields of process control block
3. What are the advantages of thread over process
4. Explain functions of long, medium and short term schedulers in a time sharing system.
5. Describe the components of process environment
6. Explain with neat diagram kernel level thread implementations
7. Explain fundamental state transition diagram for a process with process control block
8. Explain in detail the programmers view of processes. With interaction between processes, highlight the remark for its interaction.
9. What is a thread?. List its advantages
10. Explain the control synchronisation and data access synchronisation with examples.
11. With a neat diagram, Explain the different states of a process in unix operating system.
12. Explain with neat diagram. i) User level threads ii) Kernel level threads
13. Discuss the primary concerns / reasons for process termination.
14. List the events occur during the operation of OS. With a diagram discuss the event handling actions of kernel.
15. With a diagram explain the relation between processes and threads. Discuss the advantages of threads
16. Explain four kinds of process interaction
17. Explain control synchronisation and need for control synchronisation with an example.
18. Explain the race condition in airline reservation system with an example.
19. What is race condition?. List the requirements that a solution to critical section must satisfy.
20. Illustrate with example the Peterson's solution for critical section problem and prove that the mutual exclusion property is preserved.
21. Explain Reader's-Writer's problem. Show how semaphores provide solution to Reader's- Writer's problem.
22. Explain the Dining Philosopher's problem using monitors.
23. What are semaphores ? Explain any 3 use cases of Semaphores.
24. Describe an n-process solution to critical section problem which uses test() and set() hardware instruction. Prove how this algorithm satisfies all the requirements of critical section problem's solution.
25. Explain critical section problem. What are the requirements that critical section probelm must satisfy.
26. What are Monitors? Compare with semaphores their relative advantage and disadvantage.
27. What do you mean by binary semaphore and counting semaphore?
28. Explain implementation of wait() and signal() semaphore operation.