Winter 2014 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. Explain any four major functions of operating system
2+8 = 10
Answer:
Operating System is a System Software (Set of system programs) which provides
an environment to help the user to execute the programs. An operating system
(OS) is a software program that manages the hardware and software resources of
a computer. A key component 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 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
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
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
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
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
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