Computer Engineering Sem 4 Operating System Question Paper PDF 2026 - Mumbai University | munotes
Loading PDF...
Questions asked in this paper
-
Q1 When a computational speed and resource sharing is required and implemented through various full computer systems in a network, what OS should be chosen? Core of operating system 1s Which of the following state transitions is not possible? Blocked to running Ready to running Running to blocked Blocked to ready Degree of multiprogramming is characteristic of Short Term Scheduler
-
Q5 The situation where more than one processes access and update the same data concurrently and the result depends on the sequence of execution in which it takes place is known as Which algorithm requires that the system must have some additional a priori Which Page replacement algorithm suffers from Belady’s Anomaly? None of the Above Which technique is used to overcome external fragmentation when Dynamic Partitioning is used during the process to memory allocation? Which one is not a file attributes? Time, date, and user identification Protection or Permission In algorithm, the disk head moves from one end to the other , servicing requests along the way, when the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip Solve any Four out of Six 5 marks each Describe microkernel operating system structure What is the need of thread? Describe any four advantages of multithreading How to solve busy waiting problem? What is the producer consumer problem? Provide solution to producer Give details of file organization types Give details of IO Buffering techniques Solve any Two Questions out of Three 10 marks each Consider the following set of processes Note Higher number is having higher priority
-
Q1 Draw Gantt chart for SJF-Preemptive Scheduling and Preemptive Priority
-
Q2 Calculate average waiting time, average turnaround time and average response time for this scheduling algorithms Define Deadlock. Explain the necessary & sufficient conditions of deadlock Suggest techniques to avoid deadlock Given five memory partition of 100 KB,500 KB, 200 KB, 300 KB, and 600 KB. (in order), how would the first-fit, best-fit and worst-fit algorithms place Which algorithm makes the most efficient use of memory? Use fixed size Solve any Two 5 marks each Draw and Explain five state process model Explain with the help of a the system call will be generated? Explain the effect of page size on performance INS Solve any One 10 marks each Describe Disk Scheduling algorithms with example Explain File Allocation methods in detail
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Computer Engineering Sem 4 Paper Path
Use this paper as one timed CMPN Sem 4 mock, then compare Operating System, Engineering Mathematics IV, DBMS, Microprocessors, and Analysis of Algorithm papers from nearby year sets.
Step: Open this Computer Engineering Sem 4 paper in the free viewer first.
Step: Compare the May 2024 and December 2022 year sets for repeated subjects.
Step: Use the full CMPN Sem 4 folder when you need more second-year engineering practice.
Quick Help
Related Resources
Something wrong with this paper? Report it.