problem 1) What is CPU scheduling? describe the characteristics of CPU scheduling algorithms.
problem 2) What is critical section? Give the algorithm to solve the critical section problem for n processes.
problem 3) Briefly describe internal and external fragmentation with suitable ex.
problem 4) What is deadlock and what are the essential conditions for deadlock? Also, distinguish between deadlock prevention and deadlock avoidance.
problem 5) Describe how files are organized in UNIX.
problem 6) What is a process? Describe how the process structure is used to find the different parts of a process.
problem 7) What is exception and how exceptions are handled in Windows NT?
problem 8) describe the role of I/O manager in Windows NT.
problem 9) prepare the advantages and disadvantages of dynamic loadable modules?
problem 10) Describe the Linux device driver system in detail.
problem 11) What are the typical components of operating systems? Describe the ways by which these components are interconnected and melded into a kernel.
problem 12) What do you mean by deadlock avoidance? Describe the Banker’s algorithm for deadlock avoidance with suitable ex.
problem 13) Describe different interprocess communication mechanisms in UNIX.
problem 14) What do you mean by virtual memory? Describe how the virtual address is translated into real address in Windows NT.
problem 15) Describe Linux process model and thread model in detail.