Roll
No…………..
Total
No. of Questions : 13]
D-32
[2037]
B.Sc.(IT)
(Semester -1st)
OPERATING
SYSTEM (B.Sc .(IT) -103)
(DCA
– 204 (B.Sc.(IT) -302/201) (Semester -2nd &3rd )
Time
: 03 Hours Max
Marks : 75
Instruction
to Candidates :
1)
Section –A is Compulsory .
2) Attempt any
Nine questions from Section – B.
Section
–A
Q1)
a)
Name hardware features designed to explicitly assist the operating system.
b)
What characteristic is common to traps,
supervisor calls and subroutine calls but different in interrupts
?
c)
What is the principle disadvantage of
too much multiprogramming ?
d) In
what way is shortest job first scheduling just a particular from of priority
scheduling.
e)
What is a semaphore ?
f) Is
it possible to have a deadlock power for only a single
process ?
g)
Why the page size are always power of 2
?
h) What
are the two major differences between
segmentation and paging ?
i) The second chance algorithm rejects pages
that have their reference bit set to
one .What happens if all pages have their
reference bit set to one ?
j)
What is pre- paging ?
k) What
is convoy effect ?
l) What
is belady `s anomaly problem ?
m) Explain the purpose of the open and closed operations .
n) Why must the bit map for the file
allocation be kept on mass storage rather than in main memory ?
o) State three advantages of placing
functionality in a device controller rather than in the kernel .
Section-B
Q2)
Show how the Bakery`s algorithm satisfies the
requirements of a mechanism to control access to a critical section.
Q3)
What is CPU scheduling ? Explain FCFS,SJF and
priority Scheduling with their advantage and disadvantages
.
Q4) What
is scheduler ? Explain different types of schedulers .
Q5) What
are the four necessary conditions to occur a deadlock ? How we can
prevent from a deadlock ?
Q6) What
is difference between fixed partition
and variable partition and explain
the need of compaction ?
Q7) Explain
the following allocation algorithms:
(a) First Fit
(b) Best Fit
(c) Worst Fit
Q8) Explain
LRU page replacement algorithm in virtual memory.
Q9) What
is thrashing ? What is its cause and how it can be minimized ?
Q10) Explain different access methods in a file
system .
Q11) Explain
different methods to implement the free space in file system
with their advantage and disadvantages ?
Q12) What is DMA ? How does DMA increase system concurrency
?
Q13) What is the difference between process and
thread ? Explain kernel level and user level threads .
0 comments:
Post a Comment
North India Campus