— &Elsemvits (OBOE) [nteqeoze [Cone (4 330%) University of Mumb; Examinations - Summer 2022 2e|s{22 Program: Computer Engineering t 8 Curriculum Scheme: Rev 2016 Examination: BE Semester VIIL 3 Course Code: CSC802 and Course Name: Distributed Computing ; ‘Time: 2 hour 30 minutes Max. Marks: 80°, Qi Choose the correct option for following questions. All the Questions are * | compulsory and carry equal marks 1. | Resources and clients transparency that allows movernent within a system fs called” Option Az_| Mobility transparency (“Option B: ency transpareng ‘Option C-[ Porformance tansparen ‘Option D:| Replication wansparency 2. | tn Data centric model : = Option Ar [results of only read Operations can be. replicated To” various stores Tocated nearby immediately e Option Bi [results of only Write operations ean be Feplcaed to various stores Toated nearby immediate! ‘Opiion Gr | results of read and wae operations Gan be Fepliated to various sores Toeated neaby immediate! ‘Option D: | results of read and write operations can be replicated to all stores Following is a type of failure that Usually can occur in RPC systems- ‘The server erashes after receiving a request and client cannot locate the server Client Cannot Locate the Server Onion (Cx |The server erashes afer receiving a request ‘Option D: | Server erashes "| Which of the following algorithm Is Token Based Algorithm for Mutval Exclusion’ ‘Option A: ‘Option B: Option C: Option ‘S| What is task assignment approach? ‘Option Ar{ in which each process is viewed as an individual task ‘Option B:_[ in which each process is viewed as a collection of related tasks Option €:."|'in which each process is viewed as a collection of distinct tasks ‘Option D: {in which each process is viewed as a coordinator of other's tasks ina distributed file system, mapping between logical and physieal objects i- “Transparency Client interfacing Migration Naming 7 1| Page 64A6ABG6403A4A6CB48000E13379598D2Tn distributed file system, when a file's physical storage location changes file name nced fo be changed file name need not to be changed file's host name need to be changed aaa file’s local name need to be changed Which of the following is concurrency transparency 5 ; Hide differences in data representation and how a resource i accessed Hide that a resource may be shared by several competitive users Hide that a resource may be moved to another Jocation while in use Hides that the resource has multiple copies 9. Tn the Bully algorithm, process which is elected asthe coordinator is the one having =f S ‘Option Az_| Lowest Timestamp value E = as ‘Option B: | Lowest process ID : 5 ‘Option C:__| Highest timestamp value ‘Option D: | Highest process ID aK z 5 10. ‘Which of the following is the Passive Serer Physical Clock Synshronization algorithm Option A:_| Berkley’s Algorithm ‘Option B:_| Cristian's Algorithm: Option C:| Lampor's Algorithm = Option D:_| Bully Algorithm =< Soy zl Q. Ss A Fs SSS" Solve any Two (5 marks each) Discuss in brief the different architectural models in Distributed System? |: What is coordinator process? Explain algorithms used for the selection of coordinator. <2 SS SS Explain desirable features of Global Scheduling Algorithm - Solve ‘any One (10 marks each) What is the need for Code Migration? Explain the role of Process to resource and Resource to Machine binding in Code Migration, “| Write short note on File eaching schemes. Solve any Two 5 marks each Discuss the different issues and steps involved in a good Load Balancing algorithm. 2 | Page (64A6AB6403A4A6CB48000E13379598D22s ii. ‘What are different Data Consistency Models? (Any 5) iii, ‘What are physical clocks? Explain any one Physical Clock Synebronization Algorithm. Solve any One (10 marks cach) Explain Hadoop distributed file system: © '<* Explain Different issues and goals felated to design of Distr nae | System Explain Transparency in detail. , Q4. ee A Solve any Two (5 marks each) i Describe different types. of failure models, $ ii Differentiate between NOS, DOS and Middleware inthe design of a distributed systems? =<" £ iii. Explain how Monotonic Read consistency model is different from Read your Write consistenéy model, Support your answer with suitable example. B Solve any, Qne (10 marks each) detail. Define remote Brocedure call REO Deserit the working of RPC in Differentiate between Tokeii-based algorithm and Non-Token-based algorithm: Explain in detail Raymond’s Tree-Based algorithm, 3 | Page ‘64A6AB6403A4A6CB48000E13379598D2