Professional Documents
Culture Documents
Distributed Computing
Time : 3 Hours}
[Max. Marks : 100
Note : Answer any TEN questions from Part-A and ONE full question from
each Unit in Part-B.
PART-A
(1) List the four well knov?n toolkits for distributed object systems.
1
P.T.O.
BCACA C 315 l'lillll lil !H!l~l~[I
PART-B
UNIT- I
(a) \\"rite a note on Collabora tive applicati on paradigm . Explain its two
types.
(b) \Vrite a note on trade-off s of distribut ed computin g paradigm s.
(c) £:\.-plain the network service paradigm and mobile agent paradigm
"ith neat diagrams . (6 + 6 + 8)
2
1111111111111■11
Note : Answer any ten questions from Part - A and any one full
PART-A
c) Define threads. ·
I) List the four well known toolkits for distributed project systems.
P.T.O.
111111111111 llll lUI 1a111u11 lMI 11111 1111111111111
BCACAC315 -2-
PAR T-B
Uni t- I
Unit - II
4. a) Explain :
Unit -111
c) What are stateful servers? Briefly explain the two states of information. (8+6+6)
Unit- IV
b) Write the algorithm for developing the server-side software when building an
ess ?
c} Wha t is the diffe renc e betw een program and proc
appl icatio ns.
d) Write the diag ram of arch itect ure of distrlbuted
Expl ain.
e) Wha t do yo!-! mea n by Obje ct R~qu§St Brok er?
f) Expl ain socke'f¼P-1. .. ,- ~..:~..
secure .f -- -~ · : ·- ,. -,.To~
, • , •., •
g). Wfla t are itera tive ~nd cbnc urren fserv ers ? .
;" j i
·
h) Write the toolk its of Distributed O~je ct System.
i) Write the diffe reht ty~s "
1
6f ienable ~u1t1~asti~,g systems._
ure of java RMI ?
j) Wha t are the layer s used in clien t side arch itect
k) Wha t do you mea n by polling and call back ?
I) Why RMI secu rity man ager is used -? ,..
t , \
P.T.O.
BCACAC315 1111111 ii11D 11111111 IIIU Ml !ml ~DI IW IIU
3. a) With an example explain Event Diagram and Sequence Diagram.
b) Explain the four operations of an Archetypal IPC Program Interface.
c) What are the strengths and weakness of distributed computing ? Explain. (7+6+7)
Unit- II
~
6. a) Explain client-server distributed computing paradigm with a neat diagram.
~
b) With a neat diagram explain-· th~ software architecture for a client server
~
application. · ·
\J
c) Explain the differer}t operations involved in an archetypal multicast APL (7+7+6)
~
7. a) Explain the followmg :
i) FIFO Multicasting
ii) Casual-Ordering Multicasting -i
Unit-IV
I111111111111111111111111111111111111111111111111111111 .
BCACAC 315
Credit Based Fifth Semester B.C.A. Degree Examination, Nov./Dec. 2018
(Common to All Batches)
DISTRIBUTED COMPUTING
Time : 3 Hours
Total Marks: 100
Note : Answer any ten questions from Part - A and any one full
question from each Unit in Part - B.
PART-A
PART-8
Unit - I
2. a) What are the different forms of computing ? Explain any three.
b) Explain with diagram IPV4 address scheme.
P.T.O.
BCACAC 315
11111111111111111 am 1111111n 1111111n1 m1 YI
3. a) Write the architecture of distributed applications and explain briefly.
b) What do you mean by concurrent programming ? Explain its types.
c) With an example, explain Event diagram and Sequence diagram. (5+8+7)
Unit - II
4. a) What ?oyou mean by distributed object paradigms? Explain the RM I
Paradigm and ORB Paradigm.
b) What are connectionless and connection oriented datagram sockets ? Explain
with diagrams.
c) Write a note on secure socket API. (8+7+5)
Reg. No. I II I I II I I I
Illlllll lllll lllll 1111111111111111111111111111111111111
BCACAC 315
Credit Based Fifth Semester B.C.A. Degree Examination,
September/October 2020
DISTRIBUTED COMPUTING
(Common to all Batches) (Repeaters)
Time : 3 Hours Total. Marks : 100
Note : Answer any ten questions from Part - A and one full
question from each Unit in Part - B.
PART-A
(2x10=20)
1. a) Define distributed computing.
b) What are the two ways of creating threads in Java?
c) What is event diagram and sequence diagram ?
d) What is message passing ?
e) What are TCP and UDP? Why they are used?
f) Expand JSSE, RPC.
g) What is meant by unreliable multicasting ?
h) Define echo protocol.
i) What are the packages that provide reliable multicast API ?
j) What are stubs and skeletons ?
k) What is local procedure ?
I) Define polling.
PART-B
Unit- I
2. a) List and explain different forms of computing .
b) What do you mean by concurrent programming ? Explain its types.
c) Explain with block diagram.
i) Synchronous send and Synchronous receive.
ii) Asynchronous send and Synchronous receive. (6+6+8)
P.T.O.
.,
5. a) With a neat diagram, explain object request broker paradigm and object
space paradigm.
b) With neat diagram explain remote procedure call.
c) With diagram explain connectionless datagram socket. (8+7+5)
Unit - Ill
PART-A
(2x10=20)
PART-8
Unit - I
\ P.T.O.
BCACAC 315 ■I I ■11111
3. a) Explain strengths and weaknesses of distributed computing.
b) What do you mean by concurrent programming? Explain ,ts types.
c) Explain simplified state transition diagram of a process (7+8+5)
Unit - II
5. a) With a neat diagram, explain object request broker paradigm and object
space paradigm.
b) With neat diagram explain remote procedure call.
c) With diagram explain connectionless datagram socket. (8+7+5)
Unit - Ill
Reg. No. I II I I II I I I
1111111 mi11111 mmi m11m 1m11111 BCACA C302
Credit Based Fifth Semester B.C.A. Degree Examination1
October/N ovember 2012
DISTRIBUTED COMPUTIN G
Note : Answer any ten questions from Part -A and any one full
question from each Unit in Part- B.
PART-A (2x10=20)
c) Define deadlock. What are the two types of deadlock in distributed system ?
e) What is the difference between casually related event and concurrent event ?
P.T.O.
BCACAC 302 ·2·
' 11111m11111m111111
PART -B
UNIT -I
UNIT - II
UNIT - Ill
UNIT-IV