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
fall 2015 ASSIGNMENT
PROGRAM MCA(REVISED FALL 2012)
SEMESTER
- 2
CREDIT – 4 BK ID - B1405, MAX. MARKS -
60
Q1. Differentiate between Simple
Batch Operating Systems and Timesharing Operating Systems. 5+5= 10
Answer:
Simple Batch
Operating Systems
In
the earliest days digital computers usually run from a console. I/O devices
consisted of card readers, tape drives and line printers. Direct user
interaction with the system did not exist. Users made a job consisting of
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
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
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
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 determine the priorities of other
events which may occur simultaneously, like interrupts. They rely on the use of
at least two signals (bus_request and bus_grant), used in a
manner similar to the two-wire handshake.
Q6.
Explain LRU page replacement algorithms with an example 4+6= 10
Answer:
LRU
page replacement algorithm
The main
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