We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
For More Question Papers Visit - [Link] 15CS654
Sixth Semester B.E. Degree Examination, Dec.2019/Jan.2020
tributed Computing System
Time: 3 hrs. Max. Marks: 80
Note: Answer any FIVE full questions, choosing
ONE full question from each module.
Modul
1a. Define web-briefly. Explain three main standard technological components of web.
(10 Marks)
b. List out the challenges of distributed system. Explain any three of them. (06 Marks)
OR
2 a. Briefly explain system architectures in distributed system designing. (10 Marks)
b, Define failure model. Explain omission failures, (06 Marks)
Modul
3a. Briefly explain the characteristics of inter-process-communication. (06 Marks)
b, With neat sketch, explain request reply protocol and also discuss HTTP methods in client —
server communication, (10 Marks)
OR
4 a. Derive middleware. With neat diagram explain middle ware layer. (06 Marks)
b. Explain R.M1I invocation semantics. (05 Marks)
c. With a schematic diagram, explain role of client and server stub procedures in RPC in the
context of a procedural language (OS Marks)
Module-3
Sa. Draw a neat diagram and explain the core operating system functionality. (04 Marks)
b. Compare process and thread in distributed system. (03 Marks)
cc. With schematic diagram, explain monolithic kernel and microkernel. And also differentiate
between monolithic kernel and microkemel. (09 Marks)
OR
6 a, Whatare the requirements of distributed file system? Explain any five of them. (06 Marks)
b. With neat sketch, explain architecture of Sun NFS. (10 Marks)
Module-4
7 a. Define NTP. With neat diagram, discuss the synchronization subnet in an NTP
implementation. And also explain different modes of NTP servers synchranization
(07 Marks)
b. Briefly explain the logical time and logical clocks. (09 Marks)
OR
8 With respect to mutual exclusion, discuss essential requirements and evaluating the
performance of algorithm and also draw the diagram of server managing a mutual exclusion
token for a set processes. (09 Marks)
What is an election algorithm’? Explain ring based election algorithm (07 Marks)
For More Question Papers Visit - [Link] 10
a
For More Question Papers Visit - [Link]
Modi
With neat diagram, explain distributed transaction and nested banking transaction. (08 Marks)
Discuss voting phase and a completion phase of two-phase commit protocol. (04 Marks)
Discuss the operating in coordinator for nested transactions. (04 Marks)
oR
Mlustrate locking in distributed transaction and also explain timestamp ordering currency
control and optimistic concurrency control. (10 Marks)
Define deadlock. With a schematic figure, explain local and global wait-for graphs.
(06 Marks)
For More Question Papers Visit - [Link]