Exam Details
Subject | principles of operating system | |
Paper | ||
Exam / Course | b.c.a | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | December, 2017 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
B.C.A. DEGREE EXAMINATION, DECEMBER 2017.
PRINCIPLES OF OPERATING SYSTEM
(2003 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
x 20 100)
1. Enumerate the components of an operating system
and explain them in detail.
Explain system calls and operating system
structure.
2. Define process. Explain the process states and their
transition with a suitable diagram.
Assume there are 3 processes.
Processes Burst Time Priority
P1 8 3
P2 6 2
P3 1 1
Calculate the average wait time and turnaround
time for the following algorithms.
Priority Scheduling
Shortest Job First.
Sub. Code
13
DE-2476
2
SP 5
3. Discuss the concept of Interprocess Communication
in detail.
What are semaphores? Explain this in detail with
an example.
4. Write short notes on
Device Controllers
Device Drivers
Explain the concept of Deadlock Detection and
Recovery.
5. Discuss in detail Banker's algorithm with an example.
6. Discuss in detail the concept of multiprogramming
with fixed partitions.
Define Segmentation. Explain the concept with an
example.
7. Describe memory management with Linked lists
and Buddy Systems.
What is swapping? Explain the analysis of
swapping system in memory management.
8. Enumerate the different disk space management
methods. Explain any two in detail.
Discuss in detail the concept of directory structure
and File servers.
B.C.A. DEGREE EXAMINATION, DECEMBER 2017.
PRINCIPLES OF OPERATING SYSTEM
(2003 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
x 20 100)
1. Enumerate the components of an operating system
and explain them in detail.
Explain system calls and operating system
structure.
2. Define process. Explain the process states and their
transition with a suitable diagram.
Assume there are 3 processes.
Processes Burst Time Priority
P1 8 3
P2 6 2
P3 1 1
Calculate the average wait time and turnaround
time for the following algorithms.
Priority Scheduling
Shortest Job First.
Sub. Code
13
DE-2476
2
SP 5
3. Discuss the concept of Interprocess Communication
in detail.
What are semaphores? Explain this in detail with
an example.
4. Write short notes on
Device Controllers
Device Drivers
Explain the concept of Deadlock Detection and
Recovery.
5. Discuss in detail Banker's algorithm with an example.
6. Discuss in detail the concept of multiprogramming
with fixed partitions.
Define Segmentation. Explain the concept with an
example.
7. Describe memory management with Linked lists
and Buddy Systems.
What is swapping? Explain the analysis of
swapping system in memory management.
8. Enumerate the different disk space management
methods. Explain any two in detail.
Discuss in detail the concept of directory structure
and File servers.
Other Question Papers
Subjects
- accounting fundamentals
- c programming
- electronic devices and digital circuits
- lab i (c programming)
- principles of information technology
- principles of operating system