Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(FALL 2014) ASSIGNMENT
| PROGRAM | MCA (Revised 2007) |
| SEMESTER | v |
| SUBJECT CODE & NAME | MC0085- ADVANCED OPERATING SYSTEMS (DISTRIBUTED
SYSTEM) |
| CREDIT | 4 |
| BK ID | B0967 |
| MAX.MARKS | 60 |
Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.
1 Differentiate between tightly coupled and loosely coupled systems
Answer : Loose Coupling means reducing dependencies of a class that use a different class directly. In tight coupling, classes and objects are dependent on one another. In general, tight coupling is usually bad because it reduces flexibility and re-usability of code and it makes changes much more difficult and impedes testability etc.
Tight Coupling
A Tightly Coupled Object is an object that needs to know quite a bit about other objects and are usually highly dependent on each other’s
2 Describe about Buffering. What are the four types of buffering strategies?
Answer : The transmission of message from one process to another can be done by copying the body of the message from the sender’s address space to the receiver’s address space. In some casses,the receiving process may not be ready to receive the message but if wants the oprating system to save that message for later reception.Transmitted message can be stored prior to receiving process executing specific code to receive the message.
3 Define DSM. Discuss any four design and implementation issues of DSM.
Answer : Distributed Shared Memory Systems (DSM)
This is also called DSVM (Distributed Shared Virtual Memory). It is a loosely coupled distributed-memory system that has implemented a software layer on top of the message passing system to provide a shared memory abstraction for the programmers. The software layer can be implemented in the OS kernel or in runtime library routines with proper kernel support. It is an abstraction that integrates local memory of different machines in a network environment into a single logical entity shared by cooperating processes
4 Discuss any five features of good global scheduling algorithm
Answer : The decisions that the scheduler makes concerning the sequence and length of time that processes may run is called the scheduling algorithm (or scheduling policy). These decisions are not easy ones, as the scheduler has only a limited amount of information about the processes that are ready to run. A good scheduling algorithm should:
- Be fair – give each process a fair share of the CPU, allow each process to run in a reasonable amount of time.
- Be efficient – keep the CPU busy all the
5 What is replication? Discuss the three replication approaches in DFS
Answer : DFS Replication is an efficient, multiple-master replication engine that you can use to keep folders synchronized between servers across limited bandwidth network connections. It replaces the File Replication Service (FRS) as the replication engine for DFS Namespaces, as well as for replicating the Active Directory Domain Services (AD DS) SYSVOL folder in domains that use the Windows Server 2008 domain functional level.
6 List and explain the desirable features of good naming system
Answer : A good naming system for a distributed system should have the feature described below:
- Location transparency
Location transparency means that the name of an object should not reveal any hint as to the physical location of the object.
- Location independency
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601