Summer 2015 ASSIGNMENT
PROGRAM MCA(REVISED FALL 2012)
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 625/semester only.
if urgent then call us on 08791490301, 08273413412
Q1. Define Operating system. List any four
functions of operating system 4+6= 10
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 manager which
allocates and manages various resources like processor(s), main memory, input/
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.
Example: a file on the disk. A
process on the other hand is an active entity. In addition to program code, it
includes the values of the program counter, the contents of the CPU registers,
the global variables in the data
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...
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
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
Q6.
Explain LRU page replacement algorithms with an example 4+6= 10
Answer:
LRU
page replacement algorithm
The main distinction
between FIFO and optimal algorithm is that the FIFO algorithm uses the time
when a page was brought into memory (looks back) whereas the optimal algorithm
uses the time when a page is to be used in future (looks ahead). If the recent
past is used as an approximation of the near
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 625/semester only.
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment