send me some important 16 marks questions in operating systems CS1252 Vth sem dept of information technology?
myself doing B-TECH IT in latha mathavan engg college madurai.i want to clear this paper in current semester itself.so i need some important questions.
unit 1
PART – B (16 MARKS)
1. Explain the various types of computer systems.
2. Explain how protection is provided for the hardware resources by the operating system.
3. What are the system components of an operating system and explain them?
4. What are the various process scheduling concepts?
5. Explain about inter process communication.
6. List five services provided by an operating system. Explain how each provides
convenience to the users. Explain also in which cases it would be impossible for userlevel
programs to provide these services.
unit 2
PART – B (16 MARKS)
1. Give an overview about threads.
2. Explain in detail about the threading issues.
3. Write about the various CPU scheduling algorithms.
4. What is critical section problem and explain two process solutions and multiple process
solutions?
5. Explain what semaphores are, their usage, implementation given to avoid busy waiting
and binary semaphores.
6. Explain about critical regions and monitors
unit 3
PART – B (16 MARKS)
1. Give a detailed description about deadlocks and its characterization
2. Explain about the methods used to prevent deadlocks
3. Explain the Banker’s algorithm for deadlock avoidance.
4. Explain about contiguous memory allocation.
5. Give the basic concepts about paging.
6. Explain about the techniques for structuring the page table.
7. Explain the basic concepts of segmentation
unit 4
1. Explain the various page replacement strategies.
2. What are files and explain the access methods for files?
3. Explain the schemes for defining the logical structure of a directory.
4. Write notes about the protection strategies provided for files
5. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming
one, two, three, four, five, six, or seven frames? Remember all frames are initially
empty, so your first unique pages will all cost one fault each.
• LRU replacement
• FIFO replacement
• Optimal replacement
6. A page-replacement algorithm should minimize the number of page faults. We can do
this minimization by distributing heavily used pages evenly over all of memory, rather
than having them compete for a small number of page frames. We can associate with each
page frame a counter of the number of pages that are associated with that frame. Then,
to replace a page, we search for the page frame with the smallest counter.
a. Define a page-replacement algorithm using this basic idea. Specifically address the
problems of (1) what the initial value of the counters is, (2) when counters are increased,
(3) when counters are decreased, and (4) how the page to be replaced is selected. (8)
b. How many page faults occur for your algorithm for the following reference string,
for four page frames?
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2. (4)
c. What is the minimum number of page faults for an optimal page-replacement
strategy for the reference string in part b with four page frames?
unit 5
PART – B (16 MARKS)
1. Write about the kernel I/O subsystem.
2. Explain the various disk scheduling techniques
3. Write notes about disk management and swap-space management.
4. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of
pending requests, in FIFO order, is
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance ((in cylinders) that the disk
arm moves to satisfy all the pending requests, for each of the following disk scheduling
CS1252 - Operating Systems
Kings College of Engineering - Punalkulam
a. FCFS
b. SSTF
c. SCAN
d. LOOK
e. C-SCAN
5. Compare the performance of C-SCAN and SCAN scheduling, assuming a uniform distribution
of requests. Consider the average response time (the time between the arrival of a request and
the completion of that request’s service), the variation in response time, and the effective
bandwidth. How does performance depend on the relative sizes of seek time and rotational
latency?
December 31st, 2009 at 6:56 am
unit 1
PART – B (16 MARKS)
1. Explain the various types of computer systems.
2. Explain how protection is provided for the hardware resources by the operating system.
3. What are the system components of an operating system and explain them?
4. What are the various process scheduling concepts?
5. Explain about inter process communication.
6. List five services provided by an operating system. Explain how each provides
convenience to the users. Explain also in which cases it would be impossible for userlevel
programs to provide these services.
unit 2
PART – B (16 MARKS)
1. Give an overview about threads.
2. Explain in detail about the threading issues.
3. Write about the various CPU scheduling algorithms.
4. What is critical section problem and explain two process solutions and multiple process
solutions?
5. Explain what semaphores are, their usage, implementation given to avoid busy waiting
and binary semaphores.
6. Explain about critical regions and monitors
unit 3
PART – B (16 MARKS)
1. Give a detailed description about deadlocks and its characterization
2. Explain about the methods used to prevent deadlocks
3. Explain the Banker’s algorithm for deadlock avoidance.
4. Explain about contiguous memory allocation.
5. Give the basic concepts about paging.
6. Explain about the techniques for structuring the page table.
7. Explain the basic concepts of segmentation
unit 4
1. Explain the various page replacement strategies.
2. What are files and explain the access methods for files?
3. Explain the schemes for defining the logical structure of a directory.
4. Write notes about the protection strategies provided for files
5. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming
one, two, three, four, five, six, or seven frames? Remember all frames are initially
empty, so your first unique pages will all cost one fault each.
• LRU replacement
• FIFO replacement
• Optimal replacement
6. A page-replacement algorithm should minimize the number of page faults. We can do
this minimization by distributing heavily used pages evenly over all of memory, rather
than having them compete for a small number of page frames. We can associate with each
page frame a counter of the number of pages that are associated with that frame. Then,
to replace a page, we search for the page frame with the smallest counter.
a. Define a page-replacement algorithm using this basic idea. Specifically address the
problems of (1) what the initial value of the counters is, (2) when counters are increased,
(3) when counters are decreased, and (4) how the page to be replaced is selected. (8)
b. How many page faults occur for your algorithm for the following reference string,
for four page frames?
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2. (4)
c. What is the minimum number of page faults for an optimal page-replacement
strategy for the reference string in part b with four page frames?
unit 5
PART – B (16 MARKS)
1. Write about the kernel I/O subsystem.
2. Explain the various disk scheduling techniques
3. Write notes about disk management and swap-space management.
4. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of
pending requests, in FIFO order, is
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from the current head position, what is the total distance ((in cylinders) that the disk
arm moves to satisfy all the pending requests, for each of the following disk scheduling
CS1252 - Operating Systems
Kings College of Engineering - Punalkulam
a. FCFS
b. SSTF
c. SCAN
d. LOOK
e. C-SCAN
5. Compare the performance of C-SCAN and SCAN scheduling, assuming a uniform distribution
of requests. Consider the average response time (the time between the arrival of a request and
the completion of that request’s service), the variation in response time, and the effective
bandwidth. How does performance depend on the relative sizes of seek time and rotational
latency?
References :
kings college of engg question bank..