JNTUA MCA 1st Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)
Firstranker's choice
--- Content provided by FirstRanker.com ---
Code: 9F00204
MCA II Semester Supplementary Examinations February 2014
OPERATING SYSTEMS
(For 2009, 2010, 2011 & 2012 admitted batches only)
Time: 3 hours Max. Marks: 60
--- Content provided by FirstRanker.com ---
Answer any FIVE questions
All questions carry equal marks
- (a) Give a brief note on the operating system structure.
(b) Discuss five major categories of system calls in detail. - Consider the following set of processes, with the length of the CPU burst 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 and P5 all at time 0.
Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non preemptive priority (a smaller priority number implies a high priority) and RR (quantum = 1).
What are the turnaround and waiting processes for each process for each of the scheduling algorithms in part a? - Write the definition of swap () instruction. Explain the implementation of mutual exclusion using swap ().
- What is a semaphore? Give the solution to the dining-philosophers problem using semaphores and explain.
- What are the benefits of executing a program that is partially in memory?
List the typical elements found in a page table entry. Define each element. - Explain the purpose of translation look aside buffer.
--- Content provided by FirstRanker.com ---
Discuss various directory implementation techniques in detail. - Write a short note on free space management.
Give a detailed note on RAID levels. - What is stable storage? Explain how it is implemented.
“A deadlocked state is an unsafe state. Not all unsafe states are deadlocks”. Illustrate this with an example.--- Content provided by FirstRanker.com ---
Discuss resource allocation graph algorithm for deadlock avoidance. - Make a comparison of various techniques for implementing an access matrix.
b) What is the difference between a threat and an attack? Explain about the various security attacks.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUA MCA 1st Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)