MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 228 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
Which mutual exclusion algorithm is useful when the membership of the group is unknown? |
| A. | centralized |
| B. | lamport’s. |
| C. | token ring |
| D. | decentralized algorithm |
| Answer» B. lamport’s. | |
| 102. |
Which event is concurrent with the vector clock (2, 8, 4)? |
| A. | (3,9,5) |
| B. | (3,8,4) |
| C. | (1,7,3) |
| D. | (4,8,2) |
| Answer» E. | |
| 103. |
A client gets a timestamp of 4:12:30.500 from a time server. The elapsed time between the request and response was 20 msec (0.020 sec). The current time on the client is 4:12:30.510. Using Cristian’s algorithm, what is the time set to on the client? |
| A. | 1970-01-01 04:12:30 |
| B. | 1970-01-01 04:12:30 |
| C. | 1970-01-01 04:12:32 |
| D. | 1970-01-01 04:12:32 |
| Answer» D. 1970-01-01 04:12:32 | |
| 104. |
Absolute time synchronization can be achieved using |
| A. | vector time stamping method |
| B. | christian’s method |
| C. | lamport’s method |
| D. | ricart-agrawala algorithm |
| Answer» C. lamport’s method | |
| 105. |
Which of the following is an example of election algorithm. |
| A. | berkley algorithm: |
| B. | bully algorithm. |
| C. | cristian’s algorithm |
| D. | lamport’s |
| Answer» C. cristian’s algorithm | |
| 106. |
For each critical section (CS) execution, Ricart-Agrawala algorithm requires                         messages per CS execution and the Synchronization delay in the algorithm is                          . |
| A. | 3(n − 1), t |
| B. | 2(n − 1), t |
| C. | (n − 1), 2t |
| D. | (n − 1), t |
| Answer» C. (n − 1), 2t | |
| 107. |
NTP is                      layer protocol. |
| A. | application |
| B. | session |
| C. | transport |
| D. | physical |
| Answer» B. session | |
| 108. |
For each critical section (CS) execution, maekawa’s algorithm requires                         messages per CS execution and the Synchronization delay in the algorithm is                          . |
| A. | √n , t |
| B. | 2√n , t |
| C. | 3√n , t |
| D. | 3√n , 2t |
| Answer» E. | |
| 109. |
RAYMOND'S TREE BASED ALGORITHM is an |
| A. | non- token based algorithm. |
| B. | token based algorithm. |
| C. | centralized based algorithm |
| D. | physical clock synchronization algorithm. |
| Answer» C. centralized based algorithm | |
| 110. |
Which algorithm requires "1 to ∞" messages to enter and leave a critical region? |
| A. | token ring algorithm |
| B. | centralized algorithm |
| C. | decentralized algorithm |
| D. | distributed algorithm |
| Answer» B. centralized algorithm | |
| 111. |
Pretransfering also known as |
| A. | premigrating |
| B. | precopying |
| C. | prefiltering |
| D. | postcopying |
| Answer» C. prefiltering | |
| 112. |
Full form of NTP is: |
| A. | network time protocol |
| B. | new time protocol |
| C. | new timestamp protocol |
| D. | network timestamp protocol |
| Answer» B. new time protocol | |
| 113. |
change the state of thread from suspe |
| A. | run() |
| B. | yield() |
| C. | destroy() |
| D. | start() |
| Answer» E. | |
| 114. |
Suzuki-Kasami's Broadcast Algorithm is an |
| A. | non- token based algorithm. |
| B. | token based algorithm. |
| C. | centralized based algorithm |
| D. | physical clock synchronization algorithm. |
| Answer» C. centralized based algorithm | |
| 115. |
Distributed syatem consists of set of resour |
| A. | printer |
| B. | processor |
| C. | cd |
| D. | processes |
| Answer» C. cd | |
| 116. |
This is not feature of cooperative algorithm |
| A. | complex |
| B. | larger overhead |
| C. | worst stability |
| D. | better stability |
| Answer» D. better stability | |
| 117. |
What are the 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 |
| D. | execute an entire process or parts of it at same site |
| Answer» B. transfer the computation rather than the data | |
| 118. |
How is 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 |
| D. | ftp is used |
| Answer» B. zone are configured for automatic access | |
| 119. |
What are the characteristics of computation 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 |
| D. | execute an entire process or parts of it at same site |
| Answer» C. execute an entire process or parts of it at different sites | |
| 120. |
What are the characteristics of process migr |
| 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 |
| D. | execute an entire process or parts of it at same site |
| Answer» D. execute an entire process or parts of it at same site | |
| 121. |
Absolute time ordering of all shared accesses matters in |
| A. | sequential consistency |
| B. | casual consistency |
| C. | strict consistency |
| D. | weak consistency |
| Answer» D. weak consistency | |
| 122. |
In which of the following consistency model all writes become perceptible to all processes |
| A. | strict |
| B. | weak |
| C. | casual |
| D. | sequential |
| Answer» B. weak | |
| 123. |
Any successive write operation by a process on a data item x will be performed on a copy of x that is up to date with the value most recently read by that process. |
| A. | monotonic-write |
| B. | writes follows reads |
| C. | read your writes |
| D. | monotonic-read |
| Answer» C. read your writes | |
| 124. |
In Casual consistency model all processes shared accesses in |
| A. | random order |
| B. | same order |
| C. | sequential order |
| D. | specific order |
| Answer» C. sequential order | |
| 125. |
replicas are used only to improve access time on data |
| A. | client initiated |
| B. | server initiated |
| C. | permanent |
| D. | dynamic |
| Answer» B. server initiated | |
| 126. |
In                                  receivers never acknowledge the successful delivery of multicast message but instead report only when missing the message. |
| A. | basic reliable multicasting |
| B. | non-hierarchical feedback control |
| C. | hierarchical feedback control |
| D. | atomic multicast |
| Answer» C. hierarchical feedback control | |
| 127. |
                 consistency is that write operations by the same process are performed in the correct order everywhere. |
| A. | weak |
| B. | strict |
| C. | eventual |
| D. | fifo |
| Answer» E. | |
| 128. |
A problem with the                  protocol is that when the coordinator has crashed, participants may not be able to reach a final decision. |
| A. | one-phase commit |
| B. | three-phase commit |
| C. | two-phase commit |
| D. | virtual synchrony |
| Answer» D. virtual synchrony | |
| 129. |
Optimistic logging protocols need to keep track of |
| A. | independencies |
| B. | checking points |
| C. | dependencies |
| D. | erroneous state |
| Answer» D. erroneous state | |
| 130. |
Processor Consistency model guarantees and conforms that |
| A. | all write accomplished on identical memory location in identical sequence. |
| B. | all write accomplished on random memory location in random sequence |
| C. | all write accomplished on random memory location in identical sequence |
| D. | all write accomplished on identical memory location in random order |
| Answer» B. all write accomplished on random memory location in random sequence | |
| 131. |
Staleness deviations relate to the a replica was updated. |
| A. | first time |
| B. | most recent time |
| C. | last time |
| D. | previous time |
| Answer» D. previous time | |
| 132. |
The dynamic replication algorithm takes into account |
| A. | to reduce load on server |
| B. | files on server can be migrated anywhere |
| C. | schedule process migration |
| D. | resource sharing |
| Answer» B. files on server can be migrated anywhere | |
| 133. |
To improve performance, many distributed systems |
| A. | combine check pointing with recovery oriented computing |
| B. | combine check pointing with message logging |
| C. | combine check pointing with distributed commit |
| D. | combine distributed commit with message logging. |
| Answer» C. combine check pointing with distributed commit | |
| 134. |
File Replication is done to |
| A. | increase complexity |
| B. | increase cost |
| C. | increase reliability |
| D. | increase data |
| Answer» D. increase data | |
| 135. |
in NFS which funtion is used for creating new file? |
| A. | open() |
| B. | create() |
| C. | develope() |
| D. | null() |
| Answer» C. develope() | |
| 136. |
which command is used to create a directory |
| A. | rmdir |
| B. | symlink |
| C. | mkdir |
| D. | open |
| Answer» D. open | |
| 137. |
datanodes and namenode are two elements of which file system? |
| A. | afs |
| B. | hdfs |
| C. | nfs |
| D. | none of the above |
| Answer» C. nfs | |
| 138. |
In distributed file system, DNS stands for? |
| A. | domain name system |
| B. | domain name server |
| C. | directory name service |
| D. | disk name system |
| Answer» B. domain name server | |
| 139. |
NFS file System uses Mechanism |
| A. | rpc |
| B. | corba |
| C. | rmi |
| D. | none of the above |
| Answer» B. corba | |
| 140. |
In which file system mapreduce function is used? |
| A. | afs |
| B. | nfs |
| C. | hdfs |
| D. | none of the above |
| Answer» D. none of the above | |
| 141. |
map and reduce are |
| A. | libraries |
| B. | functions |
| C. | file system |
| D. | os |
| Answer» C. file system | |
| 142. |
In HDFS file System, A Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â serves as the master and there is only one NameNode per cluster |
| A. | data node |
| B. | namenode |
| C. | replication |
| D. | data block |
| Answer» C. replication | |
| 143. |
HDFS works in a fashion. |
| A. | master-master |
| B. | master-slave |
| C. | slave-slave |
| D. | none of the above |
| Answer» C. slave-slave | |
| 144. |
In HDFS file System, Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â NameNode is used when the Primary NameNode goes down. |
| A. | rack |
| B. | data |
| C. | secondary |
| D. | primary |
| Answer» D. primary | |
| 145. |
In context of HDFS file system, Point out the wrong statement. |
| A. | replication factor can be configured at a cluster level (default is set to 3) and also at a file level |
| B. | block report from each datanode contains a list of all the blocks that are stored on that datanode |
| C. | user data is stored on the local file system of datanodes |
| D. | datanode is aware of the files to which the blocks stored on it belong to |
| Answer» E. | |
| 146. |
In distributed file system,XDR stands for? |
| A. | external data request |
| B. | external device request |
| C. | external data recovery |
| D. | external data representation |
| Answer» E. | |
| 147. |
In HDFS, . Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â is the slave/worker node and holds the user data in the form of Data Blocks. |
| A. | datanode |
| B. | namenode |
| C. | data block |
| D. | replication |
| Answer» B. namenode | |
| 148. |
Session file sharing semantics are suitable for caching |
| A. | complete folder |
| B. | complete file |
| C. | one byte |
| D. | one block |
| Answer» C. one byte | |
| 149. |
If file system is growing without affecting performance of the system then this feature is called as? |
| A. | union |
| B. | portable |
| C. | robust |
| D. | scalability |
| Answer» E. | |
| 150. |
Storing file in                 makes it permanently available |
| A. | secondary memory |
| B. | ram |
| C. | register |
| D. | dram |
| Answer» B. ram | |