Distributed Systems

1. 1) Consider the two statements.
(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
c. Both A and B false
d. Both A and B true
View Answer Report Discuss Too Difficult!

Answer: (c).Both A and B false
2. Number of CPU registers in a system depends on ____________.
a. Operating system
b. Computer Architecture
c. Computer Organization
d. None of the above
Answer: (b).Computer Architecture
3. Distributed OS works on the ________ principle.
a. File Foundation
b. Single system image

c. Multi system image
d. Networking image
Answer: (b).Single system image
4. Super computers typically employ _______.
a. Real time Operating system
b. Multiprocessors OS
c. desktop OS
Answer: (b).Multiprocessors OS
5. Distributed systems have ?
a. high security
b. better resource sharing
c. better system utilization
d. low system overhead
Answer: (b).better resource sharing
6. Which amongst the following is not an advantage of Distributed systems?
a. Reliability
b. Incremental growth
c. Resource sharing
Answer: (a).Reliability
7. Multiprogramming systems:
a. Are easier to develop than single programming systems
b. Execute each job faster
c. Execute more jobs in the same time period
d. Are used only one large mainframe computers
Answer: (c).Execute more jobs in the same time period
8. In distributed system each processor has its own
a. local memory
b. clock
c. both local memory and clock
d. none of the mentioned
Answer: (c).both local memory and clock

9. 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
Answer: (a).the remaining sites can continue operating
10. Network operating system runs on
a. server
b. every system in the network
c. both server and every system in the network
Answer: (a).server
11. Which technique is based on compile-time program transformation for accessing remote data in a distributed-
memory parallel system.
a. cache coherence scheme
b. computation migration
c. remote procedure call
d. message passing
Answer: (b).computation migration
12. Logical extension of computation migration is
a. process migration
b. system migration
c. thread migration
d. data migration
Answer: (a).process migration
13. Processes on the remote systems are identified by
a. host ID
b. host name and identifier
c. identifier
d. process ID

Answer: (b).host name and identifier
14. Which routing technique is used in distributed system?
a. fixed routing
b. virtual routing
c. dynamic routing
d. all of the mentioned

Answer: (d).all of the mentioned
15. In distributed systems, link and site failure is detected by
a. polling
b. handshaking
c. token passing

Answer: (b).handshaking
16. The capability of a system to adapt the increased service load is called
a. scalability
b. tolerance
c. capacity

Answer: (a).scalability
17. Internet provides _______ for remote login.
a. telnet
b. http
c. ftp
d. RPC

Answer: (a).telnet
18. What is not true about distributed system ?
a. It is a collection of processor
b. All processors are synchronized
c. They do not share memory
d. None of the mentioned

Answer: (b).All processors are synchronized
19. What are characteristics of processor in distributed system ?
a. They vary in size and function
b. They are same in size and function
c. They are manufactured with single purpose
d. They are real-time devices

Answer: (a).They vary in size and function
20. What are characteristics of distributed file system ?
a. Its users, servers and storage devices are dispersed
b. Service activity is not carried out across the network
c. They have single centralized data repository
d. There are multiple dependent storage devices
Answer: (a).Its users, servers and storage devices are dispersed
21. What is not a major reason for building distributed systems ?
a. Resource sharing
b. Computation speedup
c. Reliability
d. Simplicity

Answer: (d).Simplicity
22. What are types of distributed operating system ?
a. Network Operating system
b. Zone based Operating system
c. Level based Operating system
d. All of the mentioned
Answer: (a).Network Operating system
23. What are characteristic of Network Operating Systems ?
a. Users are aware of multiplicity of machines
b. They are transparent
c. They are simple to use

Answer: (a).Users are aware of multiplicity of machines
24. How are access to resources of various machines is done ?
a. Remote logging using ssh or telnet
b. Zone are configured for automatic access
c. FTP is not used
Answer: (a).Remote logging using ssh or telnet
25. What are characteristics of Distributed Operating system ?
a. Users are aware of multiplicity of machines
b. Access is done like local resources
c. Users are aware of multiplicity of machines

d. They have multiple zones to access files
Answer: (b).Access is done like local resources
26. What are characteristics of data migration ?
a. transfer data by entire file or immediate portion required
b. transfer the computation rather than the data
c. execute an entire process or parts of it at different sites
Answer: (a).transfer data by entire file or immediate portion required
27. What are characteristics of computation migration ?

Answer: (b).transfer the computation rather than the data
28. What are characteristics of process migration ?
Answer: (c).execute an entire process or parts of it at different sites
29. What are parts of network structure ?
a. Workstation
b. Gateway
c. Laptop
Answer: (d).All of the mentioned
30. What are valid network topology ?
a. Multiaccess bus
b. Ring
c. Star
31. What are sites in network topology compared ?

a. Basic cost
b. Communication cost
c. Reliability
32. Which design features of a communication network are important ?
a. Naming and name resolution
b. Routing strategies
c. Connection strategies

33. What are characteristics of Naming and Name resolution ?
a. name systems in the network
b. address messages with the process-id
c. virtual circuit
d. message switching
Answer: (b).address messages with the process-id
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
36. How is are collisions avoided in network ?
a. Carrier sense with multiple access (CSMA); collision detection (CD)
b. Carrier sense multiple access with collision avoidance
c. Message slots

37. What is common problem found in distributed system ?
a. Process Synchronization
b. Communication synchronization
c. Deadlock problem
d. Power failure
Answer: (c).Deadlock problem
38. How many layers does Internet model ISO consists of ?
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
40. Which layer is the layer closest to the transmission medium ?
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
44. What are design issues in distributed system structure ?
a. Scaleability
b. Fault-tolerance
c. Clustering

45. In which OSI layer encryption and decryption happens ?
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
b. Upon link failure both parties at end must not be notified
c. Fault recovery system must me adjusted
d. Failures are logged systematically
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 ?
a. Servers may not run on dedicated machines
b. Servers and clients can be on same machines
c. Distribution cannot be interposed between a OS and the file system
d. OS cannot be distributed with the file system a part of that distribution
Answer: (b).Servers and clients can be on same machines
48. What are not the characteristics of a DFS ?
a. login transparency and access transparency
b. Files need not contain information about their physical location
c. No Multiplicity of users
d. No Multiplicity if files
Answer: (c).No Multiplicity of users

49. What are characteristic of a DFS ?
a. Fault tolerance
b. Scaleability
c. Heterogeneity of the system
d. Upgradation
Answer: (d).Upgradation
50. What are the different ways file accesses take place ?
a. sequential access
b. direct access
c. indexed sequential access

51. Which is not a major components of file system ?
a. Directory service
b. Authorization service
c. Shadow service
d. System service
Answer: (c).Shadow service
52. What are the different ways mounting of file system ?
a. boot mounting
b. auto mounting
c. explicit mounting

53. What is the advantage of caching in remote file access ?
a. Reduced network traffic by retaining recently accessed disk blocks
b. Faster network access
c. Copies of data creates backup automatically
Answer: (a).Reduced network traffic by retaining recently accessed disk blocks
54. What is networked virtual memory ?
a. Caching
b. Segmentation
c. RAM disk
Answer: (a).Caching
55. What are examples of state information ?
a. opened files and their clients
b. file descriptors and file handles
c. current file position pointers
56. Which is not an examples of state information ?
a. Mounting information
b. Description of HDD space
c. Session keys
d. Lock status
Answer: (b).Description of HDD space

57. What is a stateless file server ?
a. It keeps tracks of states of different objects
b. It maintains internally no state information at all
c. It maintains some information in them
Answer: (b).It maintains internally no state information at all
58. What are the characteristics of stateless server ?
a. Easier to implement
b. They are not fault-tolerant upon client or server failures
c. They store all information file server
d. They are redundant to keep data safe
Answer: (a).Easier to implement
59. Implementation of a stateless file server must not follow ?
a. Idempotency requirement
b. Encryption of keys
c. File locking mechanism
d. Cache consistency
Answer: (b).Encryption of keys
60. What are the advantages of file replication ?
a. Improves availability &performance
b. Decreases performance
c. They are consistent
d. Improves speed
Answer: (a).Improves availability &performance

61. What are characteristic of NFS protocol ?
a. Search for file withing directory
b. Read a set of directory entries
c. Manipulate links and directories
62. What is coherency of replicated data ?
a. All replicas are identical at all times
b. Replicas are perceived as identical only at some points in time
c. Users always read the most recent data in the replicas

63. What are the three popular semantic modes ?
a. Unix, Coherent & Session semantics
b. Unix, Transaction & Session semantics
c. Coherent, Transaction & Session semantics
d. Session, Coherent semantics
Answer: (b).Unix, Transaction & Session semantics
64. What are the characteristics of Unix semantics ?
a. Easy to implement in a single processor system
b. Data cached on a per process basis using write through case control
c. Write-back enhances access performance

65. What are the characteristics of transaction semantics ?
a. Suitable for applications that are concerned about coherence of data
b. The users of this model are interested in the atomicity property for their transaction
c. Easy to implement in a single processor system
d. Write-back enhances access performance
Answer: (b).The users of this model are interested in the atomicity property for their transaction
66. What are non characteristics of session semantics ?
a. Each client obtains a working copy from the server
b. When file is closed, the modified file is copied to the file server
c. The burden of coordinating file sharing is ignored by the system
d. Easy to implement in a single processor system
Answer: (d).Easy to implement in a single processor system

67. The file once created can not be changed is called
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

69. _______ is not possible in distributed file system.
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?
a. transparent distributed file system
b. hidden distributed file system
c. escaped distribution file system
d. spy distributed file system
Answer: (a).transparent distributed file system

71. In distributed file system, when a file’s physical storage location changes
a. file name need to be changed
b. file name need not to be changed
c. file’s host name need to be changed
d. file’s local name need to be changed
Answer: (b).file name need not to be changed
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
c. the combination of host name and local name
Answer: (c).the combination of host name and local name
74. There is no need to establish and terminate a connection through open and close operation in
a. stateless file service
b. stateful file service
c. both stateless and stateful file service
Answer: (a).stateless file service

75. In distributed file system, file name does not reveal the file’s
a. local name
b. physical storage location
c. both local name and physical storage location
Answer: (b).physical storage location
76. Which one of the following is a distributed file system?
a. andrew file system
b. network file system
c. novel network

77. In distributed systems, a logical clock is associated with
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. any other process can also execute in its critical section
b. no other process can execute in its critical section
c. one more process can execute in its critical section
Answer: (b).no other process can execute in its critical section
80. A process can enter into its critical section
a. anytime
b. when it recieves a reply message from its parent process
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
a. prevention from the deadlock is must
b. prevention from the starvation is must
c. prevention from the deadlock & starvation is must
Answer: (c).prevention from the deadlock & starvation is must
82. In the token passing approach of distributed systems, processes are organized in a ring structure
a. logically
b. physically
c. both logically and physically
Answer: (a).logically
83. In distributed systems, transaction coordinator
a. starts the execution of transaction
b. breaks the transaction into number of sub transactions
c. coordinates the termination of the transaction
84. In case of failure, a new transaction coordinator can be elected by
a. bully algorithm
b. ring algorithm
c. both bully and ring algorithm
Answer: (c).both bully and ring algorithm

85. In distributed systems, election algorithms assumes that
a. a unique priority number is associated with each active process in system
b. there is no priority number associated with any process
c. priority of the processes is not required
Answer: (a).a unique priority number is associated with each active process in system
86. According to the ring algorithm, links between processes are
a. bidirectional
b. unidirectional
c. both bidirectional and 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
d. ii, iii and iv

Answer: (d).ii, iii and iv
88. What are the characteristics of mutual exclusion using centralized approach ?
a. One processor as coordinator which handles all requests
b. It requires request,reply and release per critical section entry
c. The method is free from starvation

89. 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
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 ?
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
a. i
b. ii and iii
c. i, ii and iii
d. i, ii and iv
Answer: (d).i, ii and iv
91. What is the characteristics of atomicity ?
a. All operations associated are executed to completion or none are performed
b. One processor as coordinator which handles all requests
c. When responses are received from all processes, then process can enter its
Critical Section
d. Use communication links
Answer: (a).All operations associated are executed to completion or none are performed

92. What things are transaction coordinator is responsible for ?
a. Starting the execution of the transaction
b. Breaking transaction into a number of subtransactions
c. Coordinating the termination of the transaction
93. Single coordinator approach has the following advantages :
a. Simple implementation
b. Simple deadlock handling
c. bottleneck

94. Single coordinator approach has the following disadvantages :
a. Bottleneck
b. Slow response
c. Deadlock
d. One request per second
Answer: (a).Bottleneck
95. What are the disadvantages of majority protocol ?
a. Complicated implementation
b. Deadlock cannot occur easily
c. Bottleneck
Answer: (a).Complicated implementation
96. What are the parts of global unique identifier ?
a. Local unique time stamp
b. Remote time stamp
c. Clock number
Answer: (a).Local unique time stamp
97. Which are the two complementary deadlock-prevention schemes using time stamps ?
a. The wait-die & wound-wait scheme
b. The wait-n-watch scheme
c. The wound-wait scheme
d. The wait-wound & wound-wait scheme
Answer: (a).The wait-die & wound-wait scheme

Distributed Systems

Uploaded by

Copyright:

Available Formats

Distributed Systems

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Distributed Systems

Uploaded by

Copyright:

Available Formats

1. 1) Consider the two statements.

c. Both A and B false

d. Both A and B true

View Answer Report Discuss Too Difficult!

2. Number of CPU registers in a system depends on ____________.

d. None of the above

View Answer Report Discuss Too Difficult!

3. Distributed OS works on the ________ principle.

b. Single system image

View Answer Report Discuss Too Difficult!

Answer: (b).Single system image

4. Super computers typically employ _______.

a. Real time Operating system

d. None of the above

View Answer Report Discuss Too Difficult!

5. Distributed systems have ?

c. better system utilization

d. low system overhead

View Answer Report Discuss Too Difficult!

Answer: (b).better resource sharing

6. Which amongst the following is not an advantage of Distributed systems?

d. None of the above

View Answer Report Discuss Too Difficult!

b. Execute each job faster

c. Execute more jobs in the same time period

d. Are used only one large mainframe computers

View Answer Report Discuss Too Difficult!

Answer: (c).Execute more jobs in the same time period

8. In distributed system each processor has its own

c. both local memory and clock

d. none of the mentioned

View Answer Report Discuss Too Difficult!

Answer: (c).both local memory and clock

a. the remaining sites can continue operating

b. all the sites will stop working

c. directly connected sites will stop working

d. none of the mentioned

View Answer Report Discuss Too Difficult!

Answer: (a).the remaining sites can continue operating

10. Network operating system runs on

b. every system in the network

c. both server and every system in the network

d. none of the mentioned

View Answer Report Discuss Too Difficult!

a. cache coherence scheme

c. remote procedure call

View Answer Report Discuss Too Difficult!

12. Logical extension of computation migration is

13. Processes on the remote systems are identified by

b. host name and identifier

View Answer Report Discuss Too Difficult!

14. Which routing technique is used in distributed system?

d. all of the mentioned

View Answer Report Discuss Too Difficult!

15. In distributed systems, link and site failure is detected by

d. none of the mentioned

View Answer Report Discuss Too Difficult!

d. none of the mentioned

View Answer Report Discuss Too Difficult!