FirstRanker.com
Firstranker's choice
Code No: 812AG
--- Content provided by FirstRanker.com ---
R13Time: 3 Hours Max. Marks: 60
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA 1I Semester Examinations, April/May - 2019
OPERATING SYSTEMS
--- Content provided by FirstRanker.com ---
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 and may have a, b, c as sub questions.
PART - A 5 x 4 Marks =20
--- Content provided by FirstRanker.com ---
- Explain about the virtual memory. [4]
- Explain the process state transition diagram with neat sketch. [4]
- Explain the concept of thrashing and why thrashing should be avoided in a system? [4]
- List the common file types along with their extensions and describe each file type? [4]
- Describe the conditions under which a deadlock situation may arise? [4]
--- Content provided by FirstRanker.com ---
PART -B 5 x 8 Marks =40
- a) State and explain various types of computer systems?
b) Distinguish between multiprogramming, multitasking and multiprocessing? [4+4]
OR - Describe the functionalities listed below?
--- Content provided by FirstRanker.com ---
a) Batch programming b) Virtual Memory c) Time sharing [8] - a) Describe dining-philosophers problem? Derive an algorithm to solve the problem using semaphores?
b) State the requirements that a solution to the critical section problem must satisfy? [4+4]
OR - Consider the following set of processes with the length of the CPU burst time given in milliseconds
--- Content provided by FirstRanker.com ---
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4--- Content provided by FirstRanker.com ---
P5 5 2
The processes are assumed to have arrived in the order p1, p2, p3, p4, p5 all at time 0.
a) Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non pre-emptive priority (a smaller priority number implies a higher priority) and RR (quantum=1)scheduling.
b) What is the turnaround time of each process for each of the scheduling algorithms in part?
c) What is the waiting time of each process for each of the scheduling algorithms in part?--- Content provided by FirstRanker.com ---
Which of the schedules in part a results in the minimal average waiting time? [8] - Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in order)? Explain which algorithm makes the most efficient use of memory? [8]
OR - a) State and explain about virtual memory concept with neat diagram?
b) Explain the basic Scheme of page replacement and about the various page replacement strategies with examples? [4+4] - a) Explain about the structure of Directory.
b) Explain about the Free space management in file system. [4+4] - Explain the following in detail with respect to disk?
a) Seek time
b) Latency--- Content provided by FirstRanker.com ---
c) Access time
d) Transfer time [8] - a) List the implementation techniques of access matrix?
b) List any two example systems that implement capability-based protection? [4+4]
OR - Consider the following snapshot of a system Answer the following questions using the banker’s algorithm:
Allocation Max Available
ABCD ABCD ABCD
P1 0013 0012 520
P2 1000 1750--- Content provided by FirstRanker.com ---
P3 1354 2356
a) What is the content of matrix “Need”?
b) Is the system in a safe state?
c) If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted immediately? [8]
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--00000---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUH MCA 2nd Sem Last 10 Years 2023-2013 Question Papers R20-R09 || Jawaharlal nehru technological university
--- Content provided by FirstRanker.com ---