WOM 9 98 SSS SNH HH y Z y G y Z j y Z j g Z Z 3 Z Z Z Z q q > Model Question Paper 1 > Model Question Paper 2 > Model Question Paper 3 ENNIO SSSSS$PPBBBOBNNH G0 SSS OGG GGG 8 8666 "°° 7 7 'F*éEY»11. 12. 13. 14, 15. 16. Es 18. 19. 20. 1. 2. 3. 4, 5. 6. 7. 8. 9. a Define operating system. List the services provided by the OS. . Differentiate between a process and a program. }. What is a scheduler? Mention its types. |. Define seek time, transfer time rotational time. . What are the different operations performed on files? . Define the terms turnaround time, throughput, waiting time. . Explain context switch. . What is the role of long term scheduler? ). What is starvation? How is it avoided? oe ). Write in detail about the role of operating system as a resource utilization maximize and guardian account. What are system calls? Explain in detail. Write a detailed note on schedulers with a neat block diagram. Explain the working of SJF and priority scheduling with an example each. Explain in detail about any three directory structures. With an illustration write a detailed note on resource allocation graph. Explain in detail the concept of inter-process communication. With illustration explain the concept of Paging. Write in detail about any four different types of operating systems, Explain the following page replacement algorithms. (A) FIFO. (B) LRU, Mention in depth about the features of the Linux operating system. Qo00|. Answer any Six questions each question carries 2 marks Mire) . Mention the role of an operating system. . How is computer software classified? . What do you mean by booting? . How is job scheduling different from CPU scheduling? . Define a process and a program. .. What is spooling? . What is context switching? . Define a deadlock with an example. . What are file attributes? List any 4 attributes ofa file. Taran ck cocuk kc Corer) pexuavaene 10. Explain the following page replacement algorithms. (A) FIFO. (B) LRU. 11. Write a detail note on directory structures. 12, With a common example compare FCFS algorithm with SIF algorithm and justify which algorithm is advantageous to use. 13. Explain in detail about deadlock detection. 14, Write in detail about the system calls. 15. Explain the different kinds of schedulers. Eu ‘Answer any Three questions each question carries 8 marks 16. Explain in detail the role of operating system in process management, and file managemen Input- output management. 17. Explain inter-process communication in detail. 18. Explain the (a) SSTF (b) SCAN disk scheduling algorithms. 19. Explain in detail about the concept of demand paging. 20. Write a detailed note on any three directory structures. Qo00“Mover QUESTION PAPER - 3 A 6*25 ERE keene ( ro 1. Describe the operating system functions? 2. Explain simple batch system? 3. Define’ process? 4. What are the 3 different types of scheduling queues? 5. What is deadlock? 6. What are different methods for handling deadlocks? 7. What is Internal Fragmentation? 8. List the various File Attributes 9. What isa Directory? |. Answer any Four questions each question carries 6 marks 10. Differentiate between process and threads. 11. Explain FCFS scheduling algorithm with example 12, What are the various objectives and functions of Operating systems? 13. What are the major activities of an operating systems with regard to process management. 14. What are different methods for handling deadlocks? 15. Explain about first fit, best fit, worst fit, next fit algorithms? 16. Describe indexed file, indexed sequential file organization. Ea) 17. solution using semaphore. 19. Explain the basic concepts of segmentation in detail. 20. Explain disk structure in detail. i gQo0Q0