APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY Previous Years Question Paper & Answer

Course : B.Tech

Semester : SEMESTER 7

Year : 2019

Term : DECEMBER

Scheme : 2015 Full Time

Course Code : CS 407

Page:1





PDF Text (Beta):

D G192078 Pages: 3

Reg No.:_ Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION(R&S), DECEMBER 2019

Course Code: CS407
Course Name: DISTRIBUTED COMPUTING

Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions, each carries 4 marks. Marks
1 Explain network transparency. The e-mail addresses ensures network (4)
transparency, justify.
2 Compare tightly coupled and loosely coupled systems with neat diagrams. (4)
3 Illustrate the following placement strategies used in a distributed system. (4)
i. mapping of services to multiple servers / proxy servers
11. mobile code
4 What impact does the introduction of overlay networks have on the traditional (4)

Internet architecture, and in particular on the programmer’s conceptual view of

the Internet?

5 Explain the directory service and its interface operations in a file service (4)
architecture.
6 Illustrate the iterative navigation process in name resolution with a neat diagram. (4)

The operation create inserts a new bank account at a branch. The transactions T (4)
and U are defined as follows:

T: aBranch.create("Z");

U: z.deposit(10); z.deposit(20).
Assume that Z does not yet exist. Assume also that the deposit operation does
nothing if the account given as the argument does not exist. Consider the
following interleaving of transactions T and U:

if U

zdeposit( 10);
aBranch.create(Z);

zdeposit(20);

State the balance of Z after their execution in this order. Are these consistent
with serially equivalent executions of T and U?

8 What is a deadlock? Illustrate the various ways of detecting deadlock in 8 (4)

Page lof 3

Similar Question Papers