Scribd
Upload
62 views2 pages

Answer ALL Questions: Part A - (10 X 2 20)

This document contains a model examination for an Operating Systems course, including multiple choice and long answer questions. It covers topics like: - The role of the operating system as a resource allocator and controller. - Protection of memory and hardware resources through system calls and permissions. - Scheduling algorithms like FCFS, Round Robin, and Priority scheduling. - Paging and virtual memory management including page replacement policies. - File system structures like directories and protection strategies for files. - Disk management topics such as allocation methods, scheduling techniques, and swap space.

Uploaded by

BIBIN CHIDAMBARANATHAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
62 views2 pages

Answer ALL Questions: Part A - (10 X 2 20)

This document contains a model examination for an Operating Systems course, including multiple choice and long answer questions. It covers topics like: - The role of the operating system as a resource allocator and controller. - Protection of memory and hardware resources through system calls and permissions. - Scheduling algorithms like FCFS, Round Robin, and Priority scheduling. - Paging and virtual memory management including page replacement policies. - File system structures like directories and protection strategies for files. - Disk management topics such as allocation methods, scheduling techniques, and swap space.

Uploaded by

BIBIN CHIDAMBARANATHAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

B.E. / B.Tech. DEGREE MODEL EXAMINATION, APRIL 2013


DATE : 20.04.2013

Fourth Semester
Computer Science and Engineering
(Common to Information Technology)
CS2254 OPERATING SYSTEMS
Time : Three hours

Maximum : 100 marks


Answer ALL questions
Part A - (10 x 2 = 20)

1. Why is the Operating System viewed as a resource allocator & control program?
2. How is the protection for memory provided?
3. What are the benefits of multithreaded programming?
4. What is Dispatcher and dispatch latency?
5. What is semaphores?
6. What are overlays?
7. Define lazy swapper.
8. What is the basic approach of page replacement?
9. What are the various layers of a file system?
10. Define seek time and latency time.
Part B (5*16= 80 Marks)
11. a) i)Explain how protection is provided for the hardware resources by the operating system.(10)
ii) Write about the various system calls. (6)
(or)
b) Explain in detail about different types of computer system in detail. (16)
12) a) Assume the following processes arrive for execution at the time indicated and also the
length of the CPU burst time given in ms. (16)
Job
A
B
C
D
E

Burst time (ms)


10
6
7
4
5

Priority
5
2
4
1
3

Arrival time (ms)


0
0
1
1
2

a) Give a Gantt chart illustrating the execution of these processes using FCFS, Round Robin
(Q=5) and Priority (preemptive and Non-Preemptive) scheduling.
b) Calculate the average waiting time and average turnaround time for each of the above
scheduling algorithm.
(or)

b) Explain the Banker's algorithm for deadlock avoidance. (16)

13. a) i) Give the basic concepts about paging. (10)


ii) Consider the following page reference string: 1,2,3,4,1,2,6,5,2,1,2,7,3,6,1,2,3,2,3,6 How
many page faults would occur for the LRU replacement and optimal replacement algorithm,
assuming four frames? (6)
(or)
b) i) what is demand paging and explain the steps involved in handling a page fault.(8)
ii) Explain the structure of the page table. (8)

14. a) i) Explain the schemes for defining the logical structure of a directory. (8)
ii) Write notes about the protection strategies provided for files. (8)
(or)
b) i) .Explain the allocation methods for disk space. (8)
ii) What are the various methods for free space management? (8)

15. a) (i). Explain briefly various disk scheduling techniques. (6)


(ii) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently
serving are quest 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 algorithms? (10)
a) SSTF b)SCAN c) C-LOOK
(or)
b) Write notes about disk management and swap-space management. (16)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy