PART A — 2 MARKS 1. What is an operating system? 2. What is the main advantage

PART A — 2 MARKS
1. What is an operating system?
2. What is the main advantage of the layered approach to system design?
3. What is the objective of multiprogramming? 4. What is critical-section problem? 5. What is a binary semaphore? 6. List the necessary conditions for deadlock. 7. What is memory management unit? 8. What is segmentation? 9. What is a file control block? 10. List the methods for allocating disk space.
11. What is the role of operating system in computer I/O? 12. What is encryption?
13State any two advantages of multiprocessor systems.
14.Name any two CPU-Scheduling algorithms.
15.What is a binary semaphore?
16.Give any two classic problems of synchronization.
17.Write the idea of overlays.
18.Specify the principles followed in first-fit and best-fit allocation strategies.
19.Mention the significance of FIFO page replacement.
20.List the basic file operations.
21.Write the functions of executable and batch files.
22.What is a buffer?
23.What are worms and viruses?
24.Give the significance of non-maskable interrupt. 25. What are the goals of Operating Systems?
26. What is multiprogramming?
27. Write the states of a process.
28. What is race condition?
29. Define deadlock.
30. What is dynamic loading?
31. Give the purpost of compaction.
32. Define 50% rule.
33. What is lazy swapper?
34. Give the solution to thrashing.
35. Differentiate blocking and non-blocking I/O.
36. What is access latency?
PART –B 5 MARKS
List and explain the operating system services.
Give a brief account on virtual machines.
Explain any TWO classic problems of synchronization. . Explain the various methods for handling deadlock. Explain briefly the address binding.
List and explain the various file attributes. Explain the domain structure with an example.
Discuss about mainframe systems.
9.Explain the operating-system services.
10Describe the important aspects in deadlock detection.
11State and explain the readers-writers problem.
12Explain the logical and physical address space.
13Write a note on thrashing.
14Discuss about I/O hardware.
15. List and explain Operating System services.
16. Explain multithreading models.
17.Briefly explain critical section problem.
18. Explain External and Internal fragmentation with example.
19. Write a note on Demand Paging.
20. Discuss the concept of Interrupts.
21. Write a note on file management systems.
PART C — 10 MARKS
1 List and explain any TWO CPU-Scheduling algorithms with examples.
2. Describe in detail, the various algorithms used for deadlock avoidance. 3. Explain the common techniques for structuring the page table
4.List and explain any TWO page replacement algorithms with examples. 5. Discuss about the kernel I/O system in detail.
6. Discuss process scheduling.
7. Discuss about semaphores.
8. Elaborate the importance of paging and segmenatation schemes.
9. Explain the major methods of allocating disk space.
10. Explain in detail multiprocessor and distributed systems.
11. Explain the various CPU scheduling algorithms in detail.
12. Explain the deadlock avoidance with Bankers algorithm.
13. Explain in detail the concept of
segmetation with a neat diagram.
14. Write notes on access matrix and its implementation.