Tula’s Institute

Dhoolkot, Dehradun 5. An RPC (remote procedure call) is initiated by the:

(a) server
2nd Sessional Test (b) client
(c) both (a) and (b)
Course: B.Tech SEMESTER- VIII (d) neither (a) nor (b)
Branch: Computer Science & Engineering 6. What is not true about distributed system ?
Subject with Code – TCS 801 DISTRIBUTED COMPUTING (a) It is a collection of processor
Session: 2019-20 Roll No. --------------------------------------- (b) All processors are synchronized
Date: 14th May 2020 Time :10 AM (c) They do not share memory
Answer sheet must be submit: atul.bhandari@tulas.edu.in & (d) None of the mentioned
cse.hod@tulas.edu.in (within 1 hour of 7. Which of the following is a Token based distributed mutual
exam start) exclusion algorithm?
(a) Lamport (b) Ricart-Agrawala
Time: 90 Mints. Max Marks: 30
(c)Maekawa (d)Suzuki-Kasami
Section A (Objective Type) (1 X 18= 18) 8. Algorithm that use Vector clocks are
Note: Attempt all question: (a)Birman-Schiper-Stephenson
(b)Schiper-Eggli-Sandoz
1. For proper synchronization in distributed systems ____________
(a) Prevention from the deadlock is must (c)All of the above
(b) Prevention from the starvation is must (d)None of the above
(c) Prevention from the deadlock & starvation is must 9. What things are transaction coordinator is responsible for ?
(d) None of the mentioned (a) Starting the execution of the transaction
2. In the token passing approach of distributed systems, processes are (b) Breaking transaction into a number of sub transactions
organized in a ring structure ____________ (c) Coordinating the termination of the transaction
(a) logically
(d) All of the mentioned
(b) physically
(c) both logically and physically 10. If timestamps of two events are same, then the events are
(d) none of the mentioned (a) concurrent
3. What is not true about distributed system ? (b) non-concurrent
(a) It is a collection of processor (c) monotonic
(b) All processors are synchronized (d) non-monotonic
(c) They do not share memory 11.To reach Byzantine agreement where m is no. of faulty processors,
(d) None of the mentioned
number of rounds necessary are
4. In distributed system mutual exclusion can be implemented through
(a) Semaphores (a) 2*m
(b) local kernel (b) m+1
(c) message passing (c) m-1
(d) None of the above. (d) None of the above
12. In the token passing approach of distributed systems, processes are d) none of the mentioned
organized in a ring structure logically
(a) logically (b) physically
(c) both logically and physically (d) none of the mentioned
13. What are types of distributed operating system ? Section B (Subjective Type) (4 X 3 = 12)
(a) Network Operating system
Note: Attempt any Three
(b) Zone based Operating system
(c) Level based Operating system Q.1 What is a Distributed System? Describe the various challenges and issues
(d) All of the mentioned in a distributed system.
Q.2 What are Agreement Protocols? Describe the classification of Agreement
14. Distributed systems should have?
Problems with examples..
(a) high security Q.3 Describe Ho and Ramamoorthy two phase centralized deadlock detection
(b) have better resource sharing algorithm.
(c) better system utilization Q.4 What are non-token based algorithms in distributed mutual exclusion
(d) low system overhead systems. Describe Lamport’s algorithm with example.
15. In a peer-to-peer architecture, peers can serve as
(a) Clients
(b) Servers
(c) Middle-system
(d) Both A and B
16. The transparency that enables accessing local and remote resources
using identical operations is called
(a) Concurrency transparency
(b) Access transparency
(c) Performance transparency
(d) Scaling transparency
17. Peer machines are built over
(a) 1 Server machine
(b) 1 Client machine
(c) Many Client machines
(d) Many Server machines
18. If one site fails in distributed system
(a) the remaining sites can continue operating
(b) all the sites will stop working
(c) directly connected sites will stop working