Distributed Systems
Distributed Systems
(A) A network operating system, the users access remote resources in the same manner as local resource.
(B) In a distributed operating system, the user can access remote resources either by logging into the
appropriate remote machine or transferring data from the remote machine to their own machine. Which of the
statement is true?
a. A true, B false
b. B true, A false
a. Operating system
b. Computer Architecture
c. Computer Organization
Answer: (b).Computer Architecture
a. File Foundation
d. Networking image
b. Multiprocessors OS
c. desktop OS
Answer: (b).Multiprocessors OS
a. high security
b. better resource sharing
a. Reliability
b. Incremental growth
c. Resource sharing
Answer: (a).Reliability
7. Multiprogramming systems:
a. Are easier to develop than single programming systems
a. local memory
b. clock
a. server
Answer: (a).server
11. Which technique is based on compile-time program transformation for accessing remote data in a distributed-
memory parallel system.
b. computation migration
d. message passing
Answer: (b).computation migration
a. process migration
b. system migration
c. thread migration
d. data migration
View Answer Report Discuss Too Difficult!
Answer: (a).process migration
a. host ID
c. identifier
d. process ID
a. fixed routing
b. virtual routing
c. dynamic routing
a. polling
b. handshaking
c. token passing
16. The capability of a system to adapt the increased service load is called
a. scalability
b. tolerance
c. capacity
a. telnet
b. http
c. ftp
d. RPC
a. It is a collection of processor
a. Resource sharing
b. Computation speedup
c. Reliability
d. Simplicity
a. Workstation
b. Gateway
c. Laptop
a. Multiaccess bus
b. Ring
c. Star
b. Communication cost
c. Reliability
b. Routing strategies
c. Connection strategies
c. virtual circuit
d. message switching
34. What are routing strategies which is not used in distributed systems ?
a. Fixed routing
b. Token routing
c. Virtual circuit
d. Dynamic routing
Answer: (c).Virtual circuit
35. What are connection strategies not used in distributed systems ?
a. Circuit switching
b. Message switching
c. Token switching
d. Packet switching
Answer: (c).Token switching
c. Message slots
a. Process Synchronization
b. Communication synchronization
c. Deadlock problem
d. Power failure
Answer: (c).Deadlock problem
a. Three
b. Five
c. Seven
d. Eight
Answer: (c).Seven
39. Which layer is responsible for The process-to-process delivery ?
a. Network
b. Transport
c. Application
d. Physical
Answer: (b).Transport
a. Physical
b. Data link
c. Network
d. Transport
Answer: (a).Physical
41. Header are ______ when data packet moves from upper to the lower layers ?
a. Modified
b. Removed
c. Added
Answer: (c).Added
42. Which layer lies between transport layer and data link layer ?
a. Physical
b. Network
c. Application
d. Session
Answer: (b).Network
43. What are different ways distributed may suffer ?
a. Failure of a link
b. Failure of a site
c. Loss of message
a. Scaleability
b. Fault-tolerance
c. Clustering
a. Application
b. Presentation
c. Transport
d. Data Link
Answer: (b).Presentation
46. What are important step followed when recovery from failure happens ?
a. Post repairing integration with main system should happen smoothly and gracefully
Answer: (a).Post repairing integration with main system should happen smoothly and gracefully
47. What are the different ways in which clients and servers are dispersed across machines ?
c. No Multiplicity of users
d. No Multiplicity if files
a. Fault tolerance
b. Scaleability
d. Upgradation
Answer: (d).Upgradation
50. What are the different ways file accesses take place ?
a. sequential access
b. direct access
a. Directory service
b. Authorization service
c. Shadow service
d. System service
Answer: (c).Shadow service
a. boot mounting
b. auto mounting
c. explicit mounting
a. Caching
b. Segmentation
c. RAM disk
Answer: (a).Caching
55. What are examples of state information ?
a. Mounting information
c. Session keys
d. Lock status
a. Easier to implement
Answer: (a).Easier to implement
59. Implementation of a stateless file server must not follow ?
a. Idempotency requirement
b. Encryption of keys
d. Cache consistency
Answer: (b).Encryption of keys
b. Decreases performance
d. Improves speed
b. Data cached on a per process basis using write through case control
b. The users of this model are interested in the atomicity property for their transaction
Answer: (b).The users of this model are interested in the atomicity property for their transaction
b. When file is closed, the modified file is copied to the file server
a. immutable file
b. mutex file
c. mutable file
Answer: (a).immutable file
68. ______ of the distributed file system are dispersed among various machines of distributed system.
a. Clients
b. Servers
c. Storage devices
a. File replication
b. Migration
c. Client interface
d. Remote access
Answer: (b).Migration
70. Which one of the following hides the location where in the network the file is stored?
72. In distributed file system, _______ is mapping between logical and physical objects.
a. client interfacing
b. naming
c. migration
d. hetrogeneity
Answer: (b).naming
73. In distributed file system, a file is uniquely identified by
a. host name
b. local name
74. There is no need to establish and terminate a connection through open and close operation in
a. local name
c. novel network
a. each instruction
b. each process
c. each register
Answer: (b).each process
78. If timestamps of two events are same, then the events are
a. concurrent
b. non-concurrent
c. monotonic
d. non-monotonic
Answer: (a).concurrent
79. If a process is executing in its critical section
a. anytime
c. when it recieves a reply message from all other processes in the system
Answer: (c).when it recieves a reply message from all other processes in the system
81. For proper synchronization in distributed systems
82. In the token passing approach of distributed systems, processes are organized in a ring structure
a. logically
b. physically
Answer: (a).logically
83. In distributed systems, transaction coordinator
a. bully algorithm
b. ring algorithm
Answer: (a).a unique priority number is associated with each active process in system
a. bidirectional
b. unidirectional
Answer: (b).unidirectional
87. What are the characteristics of tightly coupled system ?
i) Different clock
ii) Use communication links
iii) Same clock
iv) Distributed systems
a. i
b. i and iv
c. i, ii and iii
88. What are the characteristics of mutual exclusion using centralized 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
a. i
b. i and ii
c. ii and iii
d. iii and iv
Answer: (b).i and ii
90. What are the advantages of token(with rings) passing approach ?
a. i
b. ii and iii
c. i, ii and iii
d. i, ii and iv
View Answer Report Discuss Too Difficult!
Answer: (d).i, ii and iv
91. What is the characteristics of atomicity ?
c. When responses are received from all processes, then process can enter its
Critical Section
a. Simple implementation
c. bottleneck
a. Bottleneck
b. Slow response
c. Deadlock
Answer: (a).Bottleneck
a. Complicated implementation
c. Bottleneck
Answer: (a).Complicated implementation
96. What are the parts of global unique identifier ?
c. Clock number
97. Which are the two complementary deadlock-prevention schemes using time stamps ?