www.vidyarthiplus.

com

*SLRPK279* SLR-PK – 279

Set P
S e a t

N o .

B.E. (Computer Science and Engg.) (Part – I) (New) Examination, 2016

DISTRIBUTED SYSTEMS
Day and Date : Tuesday, 26-4-2016 Max. Marks : 100
Time : 3.00 p.m. to 6.00 p.m.
Instructions : 1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Q. No. 1 is compulsory. It should be solved in first 30 minutes in
Answer Book Page No. 3. Each question carries one mark.
4) Answer MCQ/Objective type questions on Page No. 3 only. Don’t
forget to mention, Q.P. Set (P/Q/R/S) on Top of Page.

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 20

I. Choose the correct alternative : (20×1=20)

1) The performance metrics of distributed computing systems are
a) Response time and Throughput of user processes
b) Space complexity and Response time
c) Throughput of user processes and space complexity
d) Response time, Throughput of user processes and Space complexity
2) If the system is to be designed to tolerate k byzantine failures, a minimum of __________
replicas are needed.
a) k b) k + 1 c) k + 2 d) 2k + 1
3) In primitive Receive_any (process_id, message), the process_id belongs to
a) A specific sender process
b) Any sender process
c) Receiver process that initiates this primitive
d) Any receiver process
4) __________ feature of message-passing system ensures that messages will be delivered
correctly despite partial failure of processes, machines or communication links.
a) Correctness b) Reliability c) Efficiency d) Flexibility
5) __________ is an idempotent operation.
a) Read_record (filename, rec_num) b) Read_next_record (filename)
c) Increment (varname) d) Append_record (filename, record)
6) __________ Semantics should be used for application making a request to a booking
server to cancel an already booked seat.
a) At-least-once b) Exactly-once c) Last-One d) None of the above

P.T.O.

www.vidyarthiplus.com
 www.vidyarthiplus.com

SLR-PK – 279 -2- *SLRPK279*

7) Indirect call method is used in
a) Binding at compile time b) Binding at link time
c) Binding at call time d) All the above
8) Happened-before relation is
a) Reflexive b) Irreflexive c) Not transitive d) Commutative
9) Process address space is transferred while the process is still running on the source node in
a) Total Freezing b) Pre transferring
c) Transfer on reference d) Partial freezing
10) Threads of a single process share
a) Semaphores b) Open files c) Address space d) All the above
11) ___________ uses minimalistic approach which implies that it provides very few functions
in the node while the other functions are available a t various servers.
a) Microlevel b) Monolithic
12) VMTP can identify ___________ operations.
a) Non-idempotent b) Idempotent c) Both a) and b) d) None of the above
13) Which of the following calls is not used for sending messages in FLIP ?
a) flip_unicast b) flip_multicast c) flip_broadcast d) flip_bicast
14) In case of RPC, a server receives an unintelligible call message, because the call message
has violated the RPC Protocol. The server response to this is
a) Return reply unsuccessful
b) RPC is successful and server returns the result
c) Return reply unsuccessful and does not execute RPC
d) Rejects the call
15) ___________ consistency is the strongest form of consistency model.
a) Strict b) Processor c) Pipelined RAM d) None of the above
16) Thrashing leads to false sharing
a) True b) False
17) The grid-specific protocols that can transmit many diverse types of data in a reliable manner are
a) GridFTP b) GARP c) GARA d) None of the above
18) ___________ is a data grid.
a) European Grid b) World Wide Grid (WWG)
c) NSF TeraGrid d) None of the above
19) The basic categories of Grids are
a) Information grid, data grid and service grid
b) Information grid, computational grid and data grid
c) Information grid, resource grid and service grid
d) None of the above
20) DSM systems take the ________ feature of multicomputer systems and _________ feature
of multiprocessor systems.
a) Easier to build, harder to program b) Harder to program, complex to build
c) Easier to build, simpler to programs d) Simpler to program and easy to build
______________ Set P

www.vidyarthiplus.com
 www.vidyarthiplus.com

*SLRPK279* -3- SLR-PK – 279

S e a t

N o .

B.E. (Computer Science and Engg.) (Part – I) (New) Examination, 2016

DISTRIBUTED SYSTEMS
Day and Date : Tuesday, 26-4-2016 Marks : 80
Time : 3.00 p.m. to 6.00 p.m.
Instructions : 1) All questions are compulsory.
2) Figures to the right indicate full marks.

SECTION – I

II. Answer any four : (4×5=20)

1) Differentiate between monolithic and microkernel models used for designing a distributed
operating system.
2) Why are conventional communication protocols for network systems generally considered
to be unsuitable for distributed systems ?
3) What is an idempotent operation ? Which of the fol lowing operations are idempotent. Give
justification for each.
a) Read_record (filename, record_num)
b) Read_next_rec (filename)
c) Seek (filename, position)
d) Add (int1, int2)
4) Explain RPC mechanism with diagram.
5) List the steps of process migration with diagram.

III. Answer any one : 10

1) Explain the mechanism used in the VMTP protocol for each of the following :
a) Handling of lost messages b) Group communication
c) Flow control d) Transparent communication
2) Suggest a suitable mechanism for implementing each of the following types of
IPC semantics
a) Last one b) At least once c) Exactly once

IV. With diagram explain the workstation model and workstation-server model along with their
advantages and disadvantages. 10

Set P

www.vidyarthiplus.com
 www.vidyarthiplus.com

SLR-PK – 279 -4- *SLRPK279*

SECTION – II

V. Answer any four : (4×5=20)

1) Illustrate CMH algorithm with example for deadlock detection ?
2) Explain design issues of DSM.
3) What is grid computing ? List the functions of grid middleware.
4) Explain the following consistency models :
a) Strict consistency
b) Sequential consistency
5) What is SOA ? Define the terms architecture and service in SOA.

VI. Answer any one : 10

1) With diagram explain the general architecture of DSM systems.
2) Draw the diagram of grid protocol architecture and explain the layers, service providers
and users of grid.

VII. With example illustrate richart agarwala’s distributed algorithm for mutual exclusion and also
list its disadvantages. 10

______________

Set P

www.vidyarthiplus.com