MCA II Semester [R09] Regular Examinations June 2010
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. a) Explain about the various memories hierarchy.
b) What are the services offered by the operating system?
2. a) Define Process? Explain about Process scheduling.
b) Write the short notes on Thread Libraries
3. a)Explain about Multi-Processor Scheduling.
b) What is a critical section problem? Suggest a classic software based solution?
4. What is Deadlock? Explain methods for handling Deadlocks.
5. a) What is paging and explain about demand paging.
b) Explain about contiguous memory allocation in the memory management
6. a) Explain about the different types of file access methods.
b) Explain about the file system structure.
7. a) Discuss about N- step- SCAN policy for disk scheduling.
b) Write a short note on RAID Structure
c) Differentiate between logical I/O and device I/O.
8. a) Define Threat? Explain different types of Threats.
b) Compare active attacks with passive attacks.
MCA II Semester [R06] Supplementary Examinations June 2010
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. What is an operating system and explain different types of operating system.
2 a)Define Process? Explain about Process scheduling.
b) Explain about Multi-Processor Scheduling
3. a) Explain about the logical versus physical address space?
b) What is a paging and explain the different types of page replacement algorithms.
4. a) Explain about the file access methods.
b) Explain about the Directory structure and different directory schemes.
5. a) Explain the process of the critical section problem
b) Write Short note on Semaphores
6. a) What is a deadlock? How problems of deadlock be handled?
b) Explain about Deadlock Prevention.
7. a) Explain about the Unix file system and advantages of Unix.
b) Write a short note on Inter Process Communication.
8. a) Explain design Principles of Linux System
b) Explain about Security in Linux System.
MCA II Semester [NR] Supplementary Examinations June 2009
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. a) What is an operating system and explain different types of operating system.
b) What are the services offered by the operating system?
2. a) What is a process Control Block? What is the information it contains?
b) Explain about the different scheduling algorithms with examples.
3. Explain about the following:
a) Semaphores
b) Critical Region
4. a) What is a deadlock? How deadlock problem can be handled?
b) Explain about Deadlock Prevention.
5. a) Describe the swapping policy of an OS.
b) What is paging? Describe page replacement approach in an OS.
6. a) Discuss LRU-Approximation page Replacement.
b) Consider LRU, FIFO, Optimal page replacement algorithms. Rank these algorithms
from bad to perfect according to their page fault rate. Separate those algorithms which
suffer from Belady’s anomaly from those which do not.
7. Explain various techniques implemented for free space management, discuss with
Suitable examples.
8. a) Give the classification of intruders. Explain each class.
b) Write a brief note on intrusion detection.
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. a) Explain about the various memories hierarchy.
b) What are the services offered by the operating system?
2. a) Define Process? Explain about Process scheduling.
b) Write the short notes on Thread Libraries
3. a)Explain about Multi-Processor Scheduling.
b) What is a critical section problem? Suggest a classic software based solution?
4. What is Deadlock? Explain methods for handling Deadlocks.
5. a) What is paging and explain about demand paging.
b) Explain about contiguous memory allocation in the memory management
6. a) Explain about the different types of file access methods.
b) Explain about the file system structure.
7. a) Discuss about N- step- SCAN policy for disk scheduling.
b) Write a short note on RAID Structure
c) Differentiate between logical I/O and device I/O.
8. a) Define Threat? Explain different types of Threats.
b) Compare active attacks with passive attacks.
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. What is an operating system and explain different types of operating system.
2 a)Define Process? Explain about Process scheduling.
b) Explain about Multi-Processor Scheduling
3. a) Explain about the logical versus physical address space?
b) What is a paging and explain the different types of page replacement algorithms.
4. a) Explain about the file access methods.
b) Explain about the Directory structure and different directory schemes.
5. a) Explain the process of the critical section problem
b) Write Short note on Semaphores
6. a) What is a deadlock? How problems of deadlock be handled?
b) Explain about Deadlock Prevention.
7. a) Explain about the Unix file system and advantages of Unix.
b) Write a short note on Inter Process Communication.
8. a) Explain design Principles of Linux System
b) Explain about Security in Linux System.
MCA II Semester [NR] Supplementary Examinations June 2009
OPERATING SYSTEMS
Time: 3 Hours Max Marks: 60
Answer any FIVE questions All questions carry EQUAL marks
1. a) What is an operating system and explain different types of operating system.
b) What are the services offered by the operating system?
2. a) What is a process Control Block? What is the information it contains?
b) Explain about the different scheduling algorithms with examples.
3. Explain about the following:
a) Semaphores
b) Critical Region
4. a) What is a deadlock? How deadlock problem can be handled?
b) Explain about Deadlock Prevention.
5. a) Describe the swapping policy of an OS.
b) What is paging? Describe page replacement approach in an OS.
6. a) Discuss LRU-Approximation page Replacement.
b) Consider LRU, FIFO, Optimal page replacement algorithms. Rank these algorithms
from bad to perfect according to their page fault rate. Separate those algorithms which
suffer from Belady’s anomaly from those which do not.
7. Explain various techniques implemented for free space management, discuss with
Suitable examples.
8. a) Give the classification of intruders. Explain each class.
b) Write a brief note on intrusion detection.
Posts
0 comments:
Post a Comment