Fall 2014 ASSIGNMENT
PROGRAM M.Sc IT
SEMESTER - 2
SUBJECT CODE & NAME – MIT201
CREDIT – 4 BK ID - B1405, MAX. MARKS - 60
Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges for mba rs 125/subject and rs 700/semester only.
For other rs 125/subject only
if urgent then call us on 08791490301, 08273413412
our website is www.smuassignment.in
Q1. Differentiate between Distributed Systems and Real-time Systems. 5+5
Answer:
Distributed Systems
In this type of system all the computations are distributed among several processors. Distributed
systems are also referred as loosely coupled systems because here the processors do not share
memory or a clock.
Instead, each processor has its own local memory. The processors communicate with one another
through various communication lines, such as high speed buses or telephone lines. The processors
in distributed system vary in size, function and are referred as sites, nodes, and computers and so
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 section and the contents of the stack that is used for subroutine
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 resource is
said to be blocked.
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 files.
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. Let’s see them.
Q6 Differentiate between encryption and decryption. What are the two basic methods for
encryption? 5+5
Answer.
Encryption and Decryption
Encryption is an important tool in protection, security and authentication. The process involves
two steps (as in Fig 6.a): :
 Encryption: the original message is changed to some other form
 Decryption: the encrypted message is restored back to the original
Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges for mba rs 125/subject and rs 700/semester only.
For other rs 125/subject only
if urgent then call us on 08791490301, 08273413412
our website is www.smuassignment.in