SlideShare a Scribd company logo
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 obje cts 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: 
1. Location transparency 
Location transparency means that the name of an object should not reve al any hint as to the 
physical location of the object. 
2. 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

More Related Content

DOCX
Mi0035 computer networks
PPTX
SVM Based POS Tagger (copy)
DOCX
Mi0035 computer networks
DOCX
Mi0035 computer networks
DOCX
Mi0035 computer networks
DOCX
Mi0035 computer networks
DOCX
MC0085 – Advanced Operating Systems - Master of Computer Science - MCA - SMU DE
DOCX
Advance Operating Systems
Mi0035 computer networks
SVM Based POS Tagger (copy)
Mi0035 computer networks
Mi0035 computer networks
Mi0035 computer networks
Mi0035 computer networks
MC0085 – Advanced Operating Systems - Master of Computer Science - MCA - SMU DE
Advance Operating Systems

Similar to Mc0085 advanced operating systems (distributed (20)

PPTX
Applications of Distributed Systems
PPTX
Dos unit3
DOCX
Bsc it winter 2013 2nd sem
PPTX
Resource management
PPTX
Apos week 1 4
DOCX
Distributed system notes unit I
DOC
Semester ii
DOCX
SMU MCA FALL / SUMMER - 2013 SOLVED ASSIGNMENTS
DOCX
Mca2010 – operating system
PPTX
Data Analytics: HDFS with Big Data : Issues and Application
DOCX
smu msc it 2 sem spring 2018 july/aug 2018 exam solved assignment
PPTX
DFS PPT.pptx
PPTX
best presentation ever by tayyab.pptx
PPTX
Advanced Operating Systems- Distributed OS
DOC
Bt0070
PPTX
Dos unit 4
PPTX
Distributed operating system
DOC
Final Project IEEE format
Applications of Distributed Systems
Dos unit3
Bsc it winter 2013 2nd sem
Resource management
Apos week 1 4
Distributed system notes unit I
Semester ii
SMU MCA FALL / SUMMER - 2013 SOLVED ASSIGNMENTS
Mca2010 – operating system
Data Analytics: HDFS with Big Data : Issues and Application
smu msc it 2 sem spring 2018 july/aug 2018 exam solved assignment
DFS PPT.pptx
best presentation ever by tayyab.pptx
Advanced Operating Systems- Distributed OS
Bt0070
Dos unit 4
Distributed operating system
Final Project IEEE format
Ad

Mc0085 advanced operating systems (distributed

  • 1. 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 obje cts 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.
  • 2. 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: 1. Location transparency Location transparency means that the name of an object should not reve al any hint as to the physical location of the object. 2. Location independency Dear students get fully solved assignments Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or
  • 3. Call us at : 08263069601