University of Madras
Chepauk, Chennai-600 005.
B.Sc Computer Science
SAE5A-APRIL - 2013
|
PART A - (10 * 2 = 20 marks)
Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1.State any two advantages of multiprocessor systems.
2.Name any two CPU-Scheduling algorithms. 3.What is a binary semaphore? 4.Give any two classic problems of synchronization. 5.Write the idea of overlays. 6.Specify the principles followed in first-fit and best-fit allocation strategies. 7.Mention the significance of FIFO page replacement. 8.List the basic file operations. 9.Write the functions of executable and batch files. 10.What is a buffer? 11.What are worms and viruses? 12.Give the significance of non-maskable interrupt. SECTION B - (5 * 5 = 25 marks)
Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13.Discuss about mainframe systems.
14.Explain the operating-system services. 15.Describe the important aspects in deadlock detection. 16.State and explain the readers-writers problem. 17.Explain the logical and physical address space. 18.Write a note on thrashing. 19.Discuss about I/O hardware. SECTION C - (3 * 10 = 30 marks)
Answer any THREE questions. All questions carry equal marks. Each answer should not exceed 500 words. 20. Discuss process scheduling.
21. Discuss about semaphores. 22. Elaborate the importance of paging and segmenatation schemes. 23. Explain the major methods of allocating disk space. 24. Give an overview of security aspects of systems. |
PC5A-NOVEMBER - 2009
PART A - (10 * 3 = 30 marks)
Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1. What are the main advantages of multiprogramming? 2. What is a PCB? Mention its contents. 3. What is a critical section. 4. What is a monitor? Give its syntax. 5. What is thrashing? 6. Differentiate between logical and physical address. 7. Define compaction. 8. List out the schemes for defining logical structure of a directory. 9. List out the various types of I/O devices based on their characteristics. 10.What is spooling? 11. What do you mean by disk management? 12. What is authentication? PART B - (5 * 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. Describe the layered approach in system design List out the advantages of it. 14. Outline the various criteria considered for CPU scheduling. 15. Explain the necessary conditions for a deadlock to occur 16. Describe the first fit strategy used in multiple partition allocation scheme with a suitable example. 17. Compare and contrast paging and segmentation with their advantages and disadvantages. 18. Describe the various file access methods. 19. Describe the various services related to I/O provided by kernels. PART C - (4 * 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. Each answer should not exceed 500 words. 20. Discuss the common services provided by an operating system. 21. Explain Banker's algorithm for deadlock avoidance with an example. 22. Describe any four page replacement algorithms in detail. 23. Discuss the three methods of allocating disk space with their advantages and disadvantages. 24. Describe the various disk scheduling algorithms. 25. Explain access matrix with its various methods of implementation. |
PC5A - NOVEMBER - 2011
PART A - (10 * 3 = 30 marks) Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1. What are the advantages of virtual machine concept? 2. Distinguish between independent and cooperating processes. 3. Mention the requirements to be satisfied by a solution to the critical-section problem. 4. Write the significance of ‘Monitors’. 5. What are in a segment table? 6. Define: Logical and physical address. 7. Distinguish between sequential access and direct file access. 8. Mention the disadvantages of single level directory. 9. Name the three major methods of allocating disk space. 10. What are viruses? 11. Give any three forms of malicious access. 12. Define: Access matrix. PART B - (5 * 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. What are the components of an operating system? Briefly explain. 14. Describe the thread structure. 15. Write a note on semaphores. 16. Explain the readers and writers problem. 17. Discuss the dynamic loading and linking. 18. Describe FIFO page – replacement algorithm. 19. Explain the goals and domain of protection. PART C - (4 * 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. Each answer should not exceed 500 words. 20. Describe the shortest – job-first CPU scheduling algorithm and compare this with priority scheduling. 21. What are the methods used for handling deadlocks? Explain any one in detail. 22. Explain the internal and external fragmentation with respect to memory management. 23. Give an overview of paging. 24. Discuss the free-space management in file system. 25. Explain the kernel I/O subsystem. |
PC5A - NOVEMBER - 2005
PART A - (10 x 3 = 30 marks)
Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1. List out the common services provided by the operating system. 2. Describe the states of a process. 3. What do you mean by interprocess communication? 4. What is a monitor? Give its syntax. 5. What are external and internal fragmentations? 6. What is paging? 7. List out the various common file types. 8. List out the file allocation methods in disk space. 9. What are the various types of I/O devices classified on their characteristics? 10.Define a bit map and give its use. 11.What are the goals of protection? 12.What is encryption? Explain the mechanism followed for it? PART B - (5 x 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. Describe how hardware protection are handled in a system. 14. Explain the various criteria considered for CPU scheduling. 15. Describe how mutual exclusion is implemented with test-and-set and swap instructions. 16. Explain the segmentation memory management scheme. 17. Write a note on thrashing. 18. Describe the various disk scheduling algorithms. 19. Explain the various methods of implementation of access matrix. PART C - (4 x 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. Each answer should not exceed 500 words. 20. Discuss the various types of operating systems. 21. Describe any five CPU scheduling algorithms. 22. Explain the Banker's algorithm for deadlock avoidance with an example. 23.Describe any four page replacement algorithms. 24.Discuss the various schemes for defining the logical structure of a directory. 25.Write short notes on : (a) Worms (b)Viruses and (c)Threat monitoring. |