JNTU NR MCA-II Semester Supplementary Examinations OPERATING SYSTEMS August 2009 Question Paper
NR
Code No: 22001
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA-II Semester Supplementary Examinations, August 2009
OPERATING SYSTEMS
Time : 3hours Max.Marks:60
Answer any FIVE questions
All questions carry equal marks
– – –
1.a) “Operating system converts a machine to a virtual machine”. Justify using the
help of services provided by a typical operating system.
b) Explain the operating system structures: Monolithic, Layered and Microkernel
based.
2.a) Using a gant chart explain the difference in the scheduling policies of FIFO, SJF
and Round Robin scheduling algorithm.
b) What are the different states in which a process can be? Explain the process state
transition diagram.
3.a) Define critical section. Explain the criteria used to evaluate a solution to critical
section problem.
b) Explain how semaphores can be used to achieve synchronization in produces
consumer problem.
4.a) Define Deadlock and explain the conditions necessary for deadlock occurrence.
b) Explain the techniques used for deadlock detection.
5.a) Compare FIFO, LRU and LFU page replacement algorithms.
b) What is thrashing. Explain any two techniques using which thrashing can be
avoided.
6.a) What are global replacement and local page replacement strategies. Explain the
policies used at each level.
b) What is Belady’s anomaly, Explain how it can be overcome?
7.a) Explain SCAN and C-SCAN algorithms for disk scheduling.
b) Explain how mapping from logical address to physical address is done in
segmentation.
8.a) Explain using Access matrix how protection can be enforced.
b) What is intrusion detection? Explain the common security threats.
Categories:MCA;Tags: JNTU, MCA, Question Paper
No Comment to “JNTU NR MCA-II Semester Supplementary Examinations OPERATING SYSTEMS August 2009 Question Paper”