Distributed Computer System (DCS) MCQs with answers Page - 6

Here, you will find a collection of MCQ questions on Distributed Computer System (DCS). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. In a distributed file system, a file is uniquely identified by ___________

  • (A) host name
  • (B) local name
  • (C) the combination of host name and local name
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. 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
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. 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
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. Which one of the following is a distributed file system?

  • (A) andrew file system
  • (B) network file system
  • (C) novel network
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. 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
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. 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

A

Admin • 833.24K Points
Coach

Q. What are 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 the process can enter its critical section
  • (D) use communication links

A

Admin • 833.24K Points
Coach

Q. What things are the 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
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. Which of the following advantages follows the single coordinator approach?

  • (A) simple implementation
  • (B) simple deadlock handling
  • (C) bottleneck
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. Which of the following disadvantages follows the single coordinator approach?

  • (A) bottleneck
  • (B) slow response
  • (C) deadlock
  • (D) one request per second

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.