Winter 2014 ASSIGNMENT
PROGRAM M.Sc IT
SEMESTER
- 2
CREDIT
– 4 BK ID - B1405, MAX. MARKS - 60
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs 125/subject
and rs 500/semester only.
if urgent then call us
on 08791490301, 08273413412
Q1. Define operating system. Explain any four major
functions of Operating system.
Answer:
Operating System – Definition
Operating System is a System Software (Set of system
programs) which provides an environment to help the user to execute the
programs. The Operating System is a resource
Q2 Explain the different process
states. 5*2
Answer.
Different
process states
A program in execution is a
process. A process is executed sequentially, one instruction at a time. A
program is a passive entity.
Q3 Define Deadlock. Explain
necessary conditions for deadlock. 2+(2*4)
Answer.
Deadlock
Deadlock occurs when we
have a set of processes [not necessarily all the processes in the system], each
holding some resources, each requesting some resources, and none of them is
able to obtain what it needs, i.e. to make progress. We will usually reason in terms
of resources R1, R2... Rm and processes P1, P2... Pn. A process Pi that is
waiting for some currently unavailable
Q4 Differentiate between
Sequential access and Direct access methods. 5+5
Answer.
Sequential
access and Direct access methods
Sequential access
In this simple
access method, information in a file is accessed sequentially one record after
another. To process the ith record all the i-1 records previous to i must be
accessed. Sequential access is based on the tape model that is inherently a
sequential access device. Sequential access is best suited where most of the
records in a file are to be processed. For example, transaction
Q5 Differentiate between Daisy
chain bus arbitration and Priority encoded bus arbitration. 5+5
Answer.
Daisy chain bus arbitration and Priority
encoded bus arbitration
There are many
ways of addressing the “bus arbitration” problem; three techniques which are
often implemented in processor systems are the following: Daisy chain
arbitration, priority encoded arbitration and distributed arbitration by
self-section. These are also often used to
Q6.
Explain LRU page replacement algorithm with example.
Answer:
The
least recently used page (LRU) replacement algorithm, though similar in name to
NRU, differs in the fact that LRU keeps track of page usage over a short period
of time, while NRU just looks at the usage in the last clock interval. LRU
works on the idea that pages that have been most heavily used in the past few
instructions are most likely to be used heavily in the next few instructions
too. While LRU can provide near-optimal performance in theory (almost as good
as Adaptive Replacement Cache), it is rather expensive to implement in
practice. There are a few implementation methods for this algorithm that try to
reduce the cost yet keep as much of
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 500/semester only.
if urgent then call us
on 08791490301, 08273413412
No comments:
Post a Comment