JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA II OPERATING SYSTEMS Previous Question Paper (June/July - 2018 - R13)
Note: This question paper contains two parts A and B. Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks.
Part A
What are the advantages and disadvantages of Batch processing systems?
Answer
Advantages: Batch systems allow for efficient utilization of CPU time by eliminating idle time between jobs, as jobs are processed in a continuous stream without human intervention. They are well-suited for high-volume, repetitive tasks where fast turnaround is not critical.
Disadvantages: The primary disadvantage is the lack of interaction between the user and the job during execution, making debugging difficult. Additionally, there is a significant turnaround time, and if one job fails or enters an infinite loop, it can delay all subsequent jobs in the batch.
Write down the differences between a semaphore and a monitor.
Answer
A semaphore is an integer variable accessed through atomic operations (wait and signal) used for process synchronization, where the programmer is responsible for ensuring correct usage to avoid deadlocks. A monitor is a high-level synchronization construct provided by the programming language that encapsulates shared data and operations, ensuring mutual exclusion automatically by allowing only one process to be active within the monitor at a time.
Explain briefly about demand paging.
Answer
Sign in to view the complete answer paper.
Discuss the objectives for a file management system.
Answer
Sign in to view the complete answer paper.
Explain briefly about the four conditions of a deadlock situation.
Answer
Sign in to view the complete answer paper.
Part B
Compare and Contrast client-server and peer-to-peer models of a distributed system.
Answer
Sign in to view the complete answer paper.
Explain the services provided by an operating system from user-perspective.
Answer
Sign in to view the complete answer paper.
What is a virtual machine? Explain the concept and working principle of a virtual machine.
Answer
Sign in to view the complete answer paper.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process, Burst Time, Priority. Processes arrive in order P1, P2, P3, P4, P5 at time 0. Draw the Gantt charts using FCFS, SJF, SRTF and Priority algorithms and determine the average waiting time and average turnaround time for each.
Answer
Sign in to view the complete answer paper.
What is a race condition? When it occurs in producer-consumer problem? Describe how monitors are used to solve synchronization problem.
Answer
Sign in to view the complete answer paper.
Define paging scheme. How is it different from segmentation?
Answer
Sign in to view the complete answer paper.
Explain paging technique along with its merits and demerits.
Answer
Sign in to view the complete answer paper.
How many page faults occur for the following reference string 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2 with three page frames using FIFO, LRU and OPTIMAL page replacements algorithms?
Answer
Sign in to view the complete answer paper.
Compare and contrast chained allocation with indexed allocation technique of file allocation.
Answer
Sign in to view the complete answer paper.
What is the need for mounting in a file system?
Answer
Sign in to view the complete answer paper.
Explain various techniques implemented for free space management, discuss with suitable examples.
Answer
Sign in to view the complete answer paper.
Consider a system with five processes P0-P4 and three resources A, B, C. Using Banker’s algorithm, find the content of the matrix Need and determine if the system is in a safe state.
What is the content of the matrix Need?
Answer
Sign in to view the complete answer paper.
Is the system in a safe state?
Answer
Sign in to view the complete answer paper.
Explain the deadlock detection algorithm for multiple instance of resource types with an example.
Answer
Sign in to view the complete answer paper.