Wednesday, 28 March 2018

MCA211 – OPERATING SYSTEM


Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
help.mbaassignments@gmail.com
or
call us at : 08263069601

DRIVE
fall – 2017
PROGRAM
MASTER OF COMPUTER APPLICATION
SEMESTER
II
SUBJECT CODE & NAME
MCA211 – OPERATING SYSTEM


Set 1
Q1 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


Q2 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




Q3. 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

Set 2
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 system software



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



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

Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
help.mbaassignments@gmail.com
or
call us at : 08263069601



No comments:

Post a Comment