Scribd
Upload
42 views2 pages

MCA

This document outlines the examination paper for the MCA II Semester on Operating Systems at Jawaharlal Nehru Technological University Hyderabad. It includes a variety of questions covering topics such as the goals of operating systems, process management, inter-process communication, scheduling algorithms, deadlock, semaphores, paging, and file access methods. Students are required to answer any five questions, with all questions carrying equal marks.

Uploaded by

Shiva Glenn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views2 pages

MCA

This document outlines the examination paper for the MCA II Semester on Operating Systems at Jawaharlal Nehru Technological University Hyderabad. It includes a variety of questions covering topics such as the goals of operating systems, process management, inter-process communication, scheduling algorithms, deadlock, semaphores, paging, and file access methods. Students are required to answer any five questions, with all questions carrying equal marks.

Uploaded by

Shiva Glenn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code No: 862AB R19

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


MCA II Semester Examinations, May - 2022
OPERATING SYSTEMS
Time: 3 Hours Max.Marks:75
Answer any five questions
All questions carry equal marks
---

1.a) Examine the goals and functions of an operating system.


b) Mention the advantages and disadvantages of time-shared operating systems. [8+7]

2.a) Differentiate between Parallel systems and Distributed systems.


b) What is meant by a system call? Discuss how an operating system makes use of system
calls for implementing various services. [7+8]

3.a) What is the need of the process task control block in process management?
b) How is fork() system call differs from an exec() system call? Explain with illustrative
examples. [5+10]

4.a) State the need for inter process communication.


b) Following is the snapshot of a CPU
Process CPU Burst Arrival Time Priority
P1 12 0 1
P2 09 1 3
P3 18 2 5
P4 05 3 2
P5 20 4 4
Draw the Gantt chart and calculate the turnaround time and waiting time of the jobs for
FCFS (First Come First Served), SJF (Shortest Job First), SRTF (Shortest Remaining
Time First) and RR (Round Robin with time quantum 5) and priority scheduling
algorithms. [5+10]

5.a) Give an example of classical problem of concurrent access to shared resources by multiple
threads and show how it leads to deadlock?
b) Consider the following snapshot of a system: [6+9]
Processes Allocation Max Available
A B CD A B CD ABCD
P0 0012 0012 2100
P1 2000 2750
P2 00 3 4 6656
P3 2345 4356
P4 0332 0652
Answer the following questions using the banker’s algorithm:
i) What is the content of the matrix Need?
ii) Is the system in a safe state? Why?
iii) Is the system currently deadlocked? Why or why not?
6. What is a semaphore? Explain how semaphores are used to implement synchronization
between processes with an illustrative example. [15]

7. What is paging and segmentation? Explain paging scheme with relevant diagrams in
detail. [15]

8. Explain different File Access Methods and different File Sharing Modes in file system.
[15]
---oo0oo---

You might also like