Information Technology Engineering Sem 4 Operating System Question Paper PDF 2026 - Mumbai University | munotes

Questions asked in this paper

1. Q1 a) Explain race condition with example. 5 marks
   • b) What is thrashing? How is it handled? 5
   • c) What is demand paging? What are the advantages? 5
   • d) Explain the concept of Virtual memory. 5
2. Q2 a) What is an operating system? What is the need for an operating system? Discuss the Major functions of an operating system with examples. (10)
   • b) Consider a system consisting of m resources of the same type, being shared by n processes. Resources can be requested and released by processes only one at a time. Show that the system is deadlock-free if the following two conditions hold:
   • a) The maximum need of each process is between | and m resources
   • b) The sum of all maximum needs is less than 10
3. Q3 a) A variable partition memory system has at some point in time the following hole sizes in the given order:- 20k,15k,40k,60k,10k,25k. A new process is to be loaded. Which hole size would be filled using best-fit, first-fit and worst fit respectively? (10)
   • b) What problems could occur of system allowed a file system to be mounted simultaneously at more than one location? (05)
   • c) Define critical section. What are the requirements to solve critical-section problem?
4. Q4 a) Ina variable partition scheme, the OS must keep track of allocation and free space Suggest a mean to of achieve this. Describe an effect of new allocation and process termination in your suggested scheme. (10)
   • b) What is the need of Page replacement? Consider the following reference string Find the number of Page Faults with FIFO, Optimal Page replacement and LRU with four free frames which are empty initially. Which algorithm gives the minimum number of page
5. Q5 a) What is paging? How it is different from segmentation? Explain hardware support for
   • b) What is the critical section problem? What requirement should a solution to critical section problem satisfy? State Peterson’s solution and indicate how it satisfies the above
6. Q6 a) Compare the following main memory organization schemes: contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues:
   • 1) External fragmentation 11) Internal fragmentation iii) Ability to share code across processes
   • b) Explain the Distributed Processing in Operating Systems. What are the necessary conditions for deadlock? (10)

Read from the scan above, so a character or two may differ. The scan is the original.