Scribd
Upload
54 views2 pages

Operating Systems

This document contains instructions for a test on operating systems. It has 3 sections with a total of 9 questions. Section A is compulsory and contains short answer questions. Section B contains 4 long answer questions requiring explanation and examples. Section C contains 2 long, in-depth questions comparing and contrasting different memory management and CPU scheduling techniques. The test covers topics like processes, memory management, CPU scheduling, deadlocks, and file systems.

Uploaded by

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

Operating Systems

This document contains instructions for a test on operating systems. It has 3 sections with a total of 9 questions. Section A is compulsory and contains short answer questions. Section B contains 4 long answer questions requiring explanation and examples. Section C contains 2 long, in-depth questions comparing and contrasting different memory management and CPU scheduling techniques. The test covers topics like processes, memory management, CPU scheduling, deadlocks, and file systems.

Uploaded by

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

Roll No. Total No.

of Pages: 02
Total No. of Questions: 09
B.Tech.(IT/CSE) (Sem.-4th)
OPERATING SYSTEMS
Subject Code: BTCS-401
Paper ID: [A1183]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATE:
1) Section-A is Compulsory.
o m
.r c
2) Attempt any Tour questions from Section-B.
3) Attempt any Two questions from Section-C.

Q1. Write briefly:


a) What is dispatcher?
p e SECTION–A
(10x2=20)

b)

p a
Define turn-around time?
c)

b r
What are the techniques available for Managing and Allocating devices.

o m
d)
e)

w
f)
. What is a semaphore?

.r c
State the difference between logical address space and physical address space?
What do you mean by internal fragmentation?

w g) Give an example of a deadlock involving only a single process?

p e
w h) Give any three File system functions?

a
i)

p
State True/False: Hash table is one of the data structure used for secondary storage
management
r
j)
.b
What are the three main parts of the linux system?

Q2.
SECTION-B

w w (4x5=20)

What is deadlock? State four necessary conditions for a deadlock situation to arise?

Q3.

Q4.
w
What is PCB and its significance in scheduling? Give its contents.

Discuss the various mechanisms used for protecting software resources?

Q5. Compare and contrast Multiprogramming, Multitasking and Multiprocessing.

Q6. Describe in brief various Page replacement algorithms.

M-56604 Page: 1
SECTION-C
(2x10=20)

Q7. What are the major advantages of partitioned allocation? Name various memory
management policies. How address calculation is done in segmentation? Give memory
partition of 100k, 500k, 200k, 300k and 600k ( in order). How would each of the first fit,
best fit and worst fit algorithm place process of 212k, 417k, 112k, and 426 k ( in order)?
Which algorithm makes the most efficient use of memory?

Q8.
o m
Compare and contrast contiguous linked and indexed methods of allocating secondary

.r c
storage space? Also Discuss the role of I/O Traffic Controller in device management.

Q9. A scheduling mechanism should consider various scheduling criteria to realize the

p e
scheduling objectives. State various criteria used for selection of any CPU scheduling
algorithm, Discuss in detail any three pre-emptive CPU scheduling methods.

p a
b r ---:END:---

o m
w . .r c
w p e
w a
r p
.b
w w
w

M-56604 Page: 2

You might also like