If timestamps of two events are same, then the events are _______
1.concurrent
2.non-concurrent
3.monotonic
4.non-monotonic
In case of failure, a new transaction coordinator can be elected by _______
1.bully algorithm
2. ring algorithm
3. both bully and ring algorithm
4.None of the mentioned
In distributed systems, what will the transaction coordinator do?
1.starts the execution of transaction
2.breaks the transaction into number of sub transactions
3. coordinates the termination of the transaction
4. All of the mentioned
In the token passing approach of distributed systems, processes are organized in a ring structure ________
1.logically
2.physically
3.both logically and physically
4.None of the mentioned
In which OSI layer encryption and decryption happens?
1.Application
2.Presentation
3.Transport
4.Data Link
A process can enter into its critical section _______
1.anytime
2.when it receives a reply message from its parent process
3.when it receives a reply message from all other processes in the system
4.None of the mentioned
According to the ring algorithm, links between processes are ________
1.bidirectional
2. unidirectional
3. both bidirectional and unidirectional
4.None of the mentioned
For proper synchronization in distributed systems ______
1. prevention from the deadlock is must
2.prevention from the starvation is must
3.prevention from the deadlock & starvation is must
4.None of the mentioned
Header are ______ when data packet moves from upper to the lower layers?
1. Modified
2.Removed
3.Added
4.All of the Mentioned
How is are collisions avoided in network?
1.Carrier sense with multiple access (CSMA); collision detection (CD)
2.Carrier sense multiple access with collision avoidance
3.Message slots
4.All of the Mentioned
How many layers does the Internet model ISO consist of?
1.Three
2.Five
3. Seven
4. Eight
If a process is executing in its critical section ______
1.any other process can also execute in its critical section
2.no other process can execute in its critical section
3.one more process can execute in its critical section
4.None of the mentioned
In a distributed file system, a file is uniquely identified by ______
1. host name
2.local name
3.the combination of host name and local name
4. none of the mentioned
In a distributed file system, when a file’s physical storage location changes _______
1.file name need to be changed
2.file name need not to be changed
3.file’s host name need to be changed
4. file’s local name need to be changed
In a distributed file system, _______ is mapping between logical and physical objects.
1. client interfacing
2.naming
3.migration
4.heterogeneity
In distributed file system, file name does not reveal the file’s _____
1. local name
2.physical storage location
3.both local name and physical storage location
4.None of the mentioned
In distributed systems, a logical clock is associated with ______
1.each instruction
2.each process
3. each register
4.None of the mentioned
In distributed systems, election algorithms assumes that _______
1. a unique priority number is associated with each active process in system
2.there is no priority number associated with any process
3. priority of the processes is not required
4.None of the mentioned
The file once created can not be changed is called _____
1.immutable file
2.mutex file
3. mutable file
4.None of the mentioned
There is no need to establish and terminate a connection through open and close operation in _______
1.stateless file service
2.stateful file service
3.both stateless and stateful file service
4.None of the mentioned
What are design issues in distributed system structure?
1.Scalability
2.Fault-tolerance
3.Clustering
4. All of the mentioned
What are routing strategies which is not used in distributed systems?
1.Fixed routing
2.Token routing
3.Virtual circuit
4.dynamic routing
What are sites in network topology compared?
1.Basic cost
2.Communication cost
3.Reliability
4.All of the Mentioned
What are the advantages of token(with rings) passing approach? i) One processor as coordinator which handles all requests ii) No starvation if the ring is unidirectional iii) There are many messages passed per section entered if few users want to get in section iv) One processor as coordinator which handles all requests v) Only one message/entry if everyone wants to get in
1. i
2. ii and iii
3. i, ii and iii
4. i, ii and iv
What are the characteristics of atomicity?
1. All operations associated are executed to completion or none are performed
2.One processor as coordinator which handles all requests
3.When responses are received from all processes, then the process can enter its Critical Section
4.Use communication links
What are the characteristics of fully distributed approach? i) When responses are received from all processes, then process can enter its Critical Section ii) When process exits its critical section, the process sends reply messages to all its deferred requests. iii) It requires request,reply and release per critical section entry iv) One processor as coordinator which handles all requests
1. i
2. i and ii
3. ii and iii
4.iii and iv
What are the characteristics of mutual exclusion using centralized approach?
1. One processor as coordinator which handles all requests
2. It requires request,reply and release per critical section entry
3.The method is free from starvation
4.All of the Mentioned
What are the characteristics of Naming and Name resolution?
1.name systems in the network
2.address messages with the process-id
3.virtual circuit
4.Message Switching
What are the characteristics of tightly coupled system? i) Different clock ii) Use communication links iii) Same clock iv) Distributed systems
1.i
2.i and iv
3. i, ii and iii
4.ii, iii and iv
What are the characteristics of tightly coupled system? i) Same clock, usually shared memory ii) Communication is via this shared memory iii) Multiprocessors iv) Different clock
1. i
2. i, ii and ii
3.ii and iii
4.i, iii and iv
What are the connection strategies not used in distributed systems?
1.Circuit switching
2.Message switching
3.Token switching
4.Packet switching
What are the different ways distributed may suffer?
1. Failure of a link
2.Failure of a site
3. Loss of message
4.All of the Mentioned
What are the disadvantages of majority protocol?
1.Complicated implementation
2.Deadlock cannot occur easily
3. Bottleneck
4.All of the Mentioned
What are the important steps followed when recovery from failure happens?
1.Post repairing integration with main system should happen smoothly and gracefully
2.Upon link failure both parties at end must not be notified
3.Fault recovery system must me adjusted
4.Failures are logged systematically
What are the parts of a global unique identifier?
1.Local unique timestamp
2.Remote timestamp
3.Clock number
4.All of the Mentioned
What are the parts of network structure?
1.Workstation
2. Gateway
3.Laptop
4.All of the Mentioned
What is a common problem found in distributed system?
1.Process Synchronization
2. Communication synchronization
3.Deadlock problem
4.Power failure
What is a valid network topology?
1.Multiaccess bus
2.Ring
3.Star
4.All of the Mentioned
What things are the transaction coordinator is responsible for?
1.Starting the execution of the transaction
2.Breaking transaction into a number of subtransactions
3.Coordinating the termination of the transaction
4.All of the Mentioned
Which are the two complementary deadlock-prevention schemes using timestamps?
1.The wait-die & wound-wait scheme
2.The wait-n-watch scheme
3.The wound-wait scheme
4.The wait-wound & wound-wait scheme
Which design features of a communication network are important?
1.Naming and name resolution
2. Routing strategies
3.Connection strategies
4.All of the Mentioned
Which layer is responsible for The process-to-process delivery?
1.Network
2.Transport
3. Application
4.Physical
Which layer is the layer closest to the transmission medium?
1.Physical
2.Data link
3.Network
4. Transport
Which layer lies between the transport layer and data link layer?
1.Physical
2.Network
3.Application
4.Session
Which of the following advantages follows the single coordinator approach?
1.Simple implementation
2. Simple deadlock handling
3.bottleneck
4.All of the Mentioned
Which of the following disadvantages follows the single coordinator approach?
1.Bottleneck
2.Slow response
3.Deadlock
4.One request per second
Which one of the following hides the location where in the network the file is stored?
1.transparent distributed file system
2. hidden distributed file system
3.escaped distribution file system
4.spy distributed file system
Which one of the following is a distributed file system?
1. andrew file system
2.network file system
3.novel network
4.All of the Mentioned
______ of the distributed file system are dispersed among various machines of distributed system.
1.Clients
2.Servers
3. Storage devices
4.All of the Mentioned
_______ is not possible in distributed file system.
1.File replication
2.Migration
3.Client interface
4.Remote access