Distributed System Question Paper 2023 | Distributed System Question Paper BCA

 B.C.A. 6^th Sem End-Term Examination

Distributed Systems

                   Full Marks: 70                

 Time: Three hours

 

 

Answer question No. 1 and any four from the rest.

1.   Choose the correct answer:    (10x1=10)                                       

(i) Which of the following is a requirement of a Mutual Exclusion algorithm?

        (a)  Safety

        (b) Liveness

        (c) Fairness

        (d)All of the above

(ii) Which event is concurrent with vector clock (2, 8, 4)?

        (a)  (3, 9, 5)

        (b) (3, 8, 4)

        (c)  (1, 7, 3)

        (d) (4, 8, 2)

 

(iii) If timestamps of two events are same, then the events are

        (a)  concurrent

        (b) non-concurrent

        (c)  monotonic

        (d)non-monotonic

 

(iv) Synchronizing the process clock time with UTC time is an example of

        (a)  Internal synchronization

        (b) External synchronization

        (c)  Direct Synchronization

        (d)None of the above

 

(v) The instantaneous difference in reading between two clock is known as

        (a)  Clock drift

        (b) Clock skew

        (c)  Clock cycle

        (d) None of the above

 

(vi) Java applet is an example of

        (a)  Mobile agent

        (b) Mobile code

        (c)  Mobile node

        (d) None of the above

 

(vii) The ability to hide that a resource can be moved from one location to another is known as

        (a)  Location Transparency

        (b) Migration Transparency

        (c)  Relocation transparency

        (d) Access Transparency

 

(viii) Which of the following is a variation of client server architecture?

        (a)  Proxy server

        (b) Mobile code

        (c)  Mobile agent

        (d) All of the above

 

(ix) If a process is executing in its critical section

        (a)  Any other process can also execute in its critical section

        (b) No other process can also execute in its critical section

        (c)  One more process can also execute in its critical section

        (d) None of the above

(x) For n processes, critical section invocation using Ricart Agarwala algorithm requires

        (a)  n-1 messages

        (b) 2(n-1) messages

        (c)  n+1 messages

        (d) None of the above

 

2.    2.    a.   Define distributed system? How it is different from computer network.    (2+2=4)                                                 

            b.   What is computer clock? Differentiate between hardware clock and software clock.    (2+2=4)                                       

            c.   Define clock skew and clock drift.    (2+2=4)            

            d.   What is heterogeneity of a distributed system?    (3) 

3. 

     3.    a.   Define logical clock. How it is used to timestamp events? What are the shortcomings of logical clock?    (2+2+2=6)      

            b.   What are the different matrices used to measure the performance of a mutual exclusion algorithm?    (5) 

            c.   What is vector clock? How it overcomes the limitations of Lamport clock?    (2+2=4)                                                           

      4.    a.   What is distribution transparency? What are the different types of distribution transparency?   (2+5=7)                        

            b.   What is clock synchronization? Why it is required? Differentiate between internal and external synchronization.    (3+2+3=8) 

 

5.  5.    a.   Explain Huang’s termination detection algorithm with an example.    (8)                                                                        

            b.   What is an election algorithm? What are the requirements of an election algorithm? Explain Bully algorithm with an example.    (3+4=7)               

     

6.  6.    a.   What is distributed mutual exclusion? What are the requirements of distributed mutual exclusion? Explain Maekawa’s voting algorithm for mutual exclusion. Show how it satisfies the requirement of mutual exclusion.    (2+3+5=10)                       

            b.   What is happened before relationship? What are its different rules?    (5)                                                                                         

 

7.    7.    a.   What is distributed transaction? Differentiate between flat and nested transaction.    (2+3=5)                                             

                b.   What is distributed deadlock? Explain edge chasing algorithm with the help of an example.    (2+6=8)                               

                c.   Define what is meant by a scalable system.    (2)