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

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. What are the parts of a global unique identifier?

  • (A) local unique timestamp
  • (B) remote timestamp
  • (C) clock number
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. In distributed systems, a logical clock is associated with ______________

  • (A) each instruction
  • (B) each process
  • (C) each register
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. If timestamps of two events are same, then the events are ____________

  • (A) concurrent
  • (B) non-concurrent
  • (C) monotonic
  • (D) non-monotonic

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. A process can enter into its critical section ____________

  • (A) anytime
  • (B) when it receives a reply message from its parent process
  • (C) when it receives a reply message from all other processes in the system
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. In the token passing approach of distributed systems, processes are organized in a ring structure ____________

  • (A) logically
  • (B) physically
  • (C) both logically and physically
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. In distributed systems, what will the transaction coordinator do?

  • (A) starts the execution of transaction
  • (B) breaks the transaction into number of sub transactions
  • (C) coordinates the termination of the transaction
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. In case of failure, a new transaction coordinator can be elected by ____________

  • (A) bully algorithm
  • (B) ring algorithm
  • (C) both bully and ring algorithm
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

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

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.