Scribd
Upload
29 views3 pages

Ds Qpaper 2008p

This document is an exam for a distributed systems course. It contains 12 questions across two sections. The first section deals with distributed system concepts like heterogeneity, message passing, and clock synchronization. The second section covers distributed file systems, distributed shared memory, and consistency models. Students must answer 1 of 2 questions from each section. Questions involve defining terms, explaining concepts, analyzing problems, and comparing approaches. Diagrams and assumptions can be used where needed.

Uploaded by

Swapnil Shinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views3 pages

Ds Qpaper 2008p

This document is an exam for a distributed systems course. It contains 12 questions across two sections. The first section deals with distributed system concepts like heterogeneity, message passing, and clock synchronization. The second section covers distributed file systems, distributed shared memory, and consistency models. Students must answer 1 of 2 questions from each section. Questions involve defining terms, explaining concepts, analyzing problems, and comparing approaches. Diagrams and assumptions can be used where needed.

Uploaded by

Swapnil Shinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

www.sppuonline.

com

Total No. of Questions : 12] SEAT No. :


P1908
[Total No. of Pages : 3
[5059] - 231
B.E. (Information Technology)
DISTRIBUTED SYSTEM
(2008 Pattern) (Semester - II)
Time : 3 Hours] [Max. Marks : 100
Instructions to the candidates:
1) Answers to the two sections should be written in separate answer books.
2) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6 from section - I and Q7 or Q8, Q9 or Q10,
Q11 or Q12 from section- II.
3) Neat diagrams must be drawn wherever necessary.
4) Figures to the right side indicate full marks.
5) Use of Calculator is allowed.
6) Assume Suitable data if necessary.

SECTION - I
Q1) a) Define Distributed Systems? Give Two examples and explain each in
details. [8]
b) How do you handle heterogeneity in distributed systems? [8]
OR
Q2) a) Discuss the challenge of heterogeneity and scalability while designing
distributed systems. [8]
b) Which system is a better system? Distributed or Parallel processing.[8]

Q3) a) What are the main issues related to the correctness of the IPC protocols
of a message-passing system? Describe a suitable mechanism for handling
each of these issues. [10]
b) Why are transport-level communication services often inappropriate for
building distributed applications? [8]
OR
Q4) a) Suggest a suitable mechanism for implementing each of the following
types of IPC semantics. [10]
i) Last one
ii) At least once
iii) Exactly once.
b) Discuss the techniques that makes LRPC more efficient that RPC. [8]

P.T.O.
www.sppuonline.com

Q5) a) How do clock synchronization issues differ in centralized and distributed


systems? [8]
b) What will happen if in a bully algorithm for electing a coordinator when
two or more processes almost simultaneously discover that the
coordinator has crashed? [8]
OR
Q6) a) Solve following timing diagram using Lamport’s Logical Clock algorithm
and Vector Time-stamp method both. [10]

b) Differentiate between internal and external synchronization of clocks in a


distributed systems. [6]

SECTION - II

Q7) a) In what aspects the distributed file systems differ from centralized file
system? [8]
b) Describe file sharing mechanism in CODA file system. [8]

OR

Q8) a) Discuss following properties of distributed file systems. [8]


i) High degree of availability.
ii) High degree of security.
iii) High degree of performance.
b) Discuss security implementations in Network File System. [8]

Q9) a) What is Distributed Shared memory? What are the design issues in
implementation of DSM? [8]
b) What will happen if we prefer page size of virtual memory implementation
as the block size of the DSM system? [8]

[5059]-231 2
www.sppuonline.com

OR

Q10)a) Explain and compare Strict Consistency model with Sequential


Consistency model with one example each. [8]
b) What is the data centric consistency model? Explain in detail. [8]

Q11)a) What is the relationship among reliability, availability and maintainability.[8]


b) Write and explain Two phase commit and Three phase Commit Protocols
in details. [10]
OR

Q12)a) How failure is masked using redundancy? What is k fault tolerant


system? [8]
b) What is triple modular redundancy? Explain with one example. [10]

mmm

www.sppuonline.com

[5059]-231 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy