Side panel

CAT $2$

Time left $0$:$13$:$33$

Question $1$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

The signal operation of the semaphore basically works on the basic $\_\_\_\_\_\_\_$ system call.

Question $1$Answer

a$.$

getup$()$

b$.$

start$()$

c$.$

wakeup$()$

d$.$

continue$()$

Question $2$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$411.$ In distributed system, each processor has its own $\_\_\_\_\_\_\_\_\_\_\_$

Question $2$Answer

a$.$

both local memory and clock

b$.$

none of the mentioned

c$.$

clock

d$.$

local memory

Question $3$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$409.$ In distributed systems, election algorithms assumes that $\_\_\_\_\_\_\_\_\_\_\_\_$

Question $3$Answer

a$.$

priority of the processes is not required

b$.$

none of the mentioned

c$.$

there is no priority number associated with any process

d$.$

a unique priority number is associated with each active process in system

Question $4$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$16.$ Some Content Delivery Networks $($CDNs$)$ use DNS responses to direct clients to the closest CDN cache

Question $4$Answer

a$.$

TRUE

b$.$

FALSE

Question $5$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$406.$ In the token passing approach of distributed systems, processes are organized in a ring structure $\_\_\_\_\_\_\_\_\_\_\_\_$

Question $5$Answer

a$.$

physically

b$.$

none of the mentioned

c$.$

both logically and physically

d$.$

logically

Question $6$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

In case of failure, a new transaction coordinator can be elected by $\_\_\_\_\_\_\_\_\_\_\_\_$

Question $6$Answer

a$.$

both bully and ring algorithm

b$.$

none of the mentioned

c$.$

bully algorithm

d$.$

ring algorithm

Question $7$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

In distributed systems, a logical clock is associated with

Question $7$Answer

a$.$

each instruction

b$.$

each register

c$.$

each node

d$.$

each process

Question $8$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$83.$ What are characteristic of a DFS$?$

Question $8$Answer

a$.$

Upgradation

b$.$

Fault tolerance

c$.$

Heterogeneity of the system

d$.$

Scalability

Question $9$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

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

Question $9$Answer

a$.$

coordinates the termination of the transaction

b$.$

all of the mentioned

c$.$

breaks the transaction into number of sub transactions

d$.$

starts the execution of transaction

Question $10$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$13.$ Domain Name System $($DNS$)$ resolvers use Paxos and invalidation messages to maintain the consistency of cached records

Question $10$Answer

a$.$

FALSE

b$.$

TRUE

Question $11$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$96.$ What is the coherency of replicated data?

Question $11$Answer

a$.$

Replicas are perceived as identical only at some points in time

b$.$

All replicas are identical at all times

c$.$

Users always read the most recent data in the replicas

d$.$

All of the mentioned

Question $12$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

A process can enter into its critical section

Question $12$Answer

a$.$

anytime

b$.$

when it receives a reply message from all other processes in the system

c$.$

none of the mentioned

d$.$

when it receives a reply message from its parent process

Question $13$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$408.$ In case of failure, a new transaction coordinator can be elected by $\_\_\_\_\_\_\_\_\_\_\_\_$

Question $13$Answer

a$.$

ring algorithm

b$.$

both bully and ring algorithm

c$.$

bully algorithm

d$.$

none of the mentioned

Question $14$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

$410.$ According to the ring algorithm, links between processes are $\_\_\_\_\_\_\_\_\_\_\_\_$

Question $14$Answer

a$.$

both bidirectional and unidirectional

b$.$

none of the mentioned

c$.$

bidirectional

d$.$

unidirectional

Question $15$

Not yet answered

Marked out of $1\mathrm{.}00$

Flag question

Question text

Which one of the following is the deadlock avoidance algorithm?

Question $15$Answer

a$.$

bankers algorithm

b$.$

round$-$robin algorithm

c$.$

elevator algorithm

d$.$

karns algorithm