dfs Archives

Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Ask A Question

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

According to the ring algorithm, links between processes are ____________ a) bidirectional b) unidirectional c) both bidirectional and unidirectional d) none of the mentioned

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

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

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

If timestamps of two events are same, then the events are ____________ a) concurrent b) non-concurrent c) monotonic d) non-monotonic

VARISHA PARVEZ

Asked: May 10, 2023In: Data Structures & Algorithms

In distributed systems, a logical clock is associated with ______________ a) each instruction b) each process c) each register d) none of the mentioned

Load More Questions

According to the ring algorithm, links between processes are ____________ a) bidirectional b) unidirectional c) both bidirectional and unidirectional d) none of the mentioned

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

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

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

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

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

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

If timestamps of two events are same, then the events are ____________ a) concurrent b) non-concurrent c) monotonic d) non-monotonic

In distributed systems, a logical clock is associated with ______________ a) each instruction b) each process c) each register d) none of the mentioned

Point out the wrong statement. A. The standard instances are ...

Point out the correct statement. A. A volume is mounted ...

Which type of e‐commerce focuses on consumers dealing with ...

jafri

Namita

Sohail hossain

Sign Up

Sign In

Forgot Password

Quearn Latest Questions