Crowdly

Add to Chrome

Universities
moodle.spit.ac.in
TE ISE Computer Engineering

TE ISE Computer Engineering

Looking for TE ISE Computer Engineering test answers and solutions? Browse our comprehensive collection of verified answers for TE ISE Computer Engineering at moodle.spit.ac.in.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

If a system using Berkeley’s algorithm experiences an average round-trip variation of ±4 ms, what is the minimum achievable synchronization precision (best case)?

View this question

If a process uses a device that cannot move (e.g., a local printer), this resource is considered:

View this question

T1. Token-based algorithms perform better than non-token-based ones when the critical section requests are frequent.

T2. Non-token-based algorithms are more efficient when failures and message losses are frequent.

Both T1 and T2 True

Both T1 and T2 False

View this question

In a system with three replicas of variable `X`, a write by P1 at time `t = 2ms` is seen by P2 at `t = 10ms` and by P3 at `t = 15ms`.

Which of the following statements is correct?

System provides causal consistency.

System is sequentially consistent.

System is strictly consistent.

System violates strict consistency.

View this question

In distributed systems, can a thread migrate from one machine to another to continue execution seamlessly?

Yes, if using kernel-level threads

Yes, but only if the OS uses a global scheduler

No, threads cannot migrate between address spaces

Yes, threads migrate automatically with their state

View this question

Which client-centric model session consistency subsumes?

Eventual consistency only

Read-your-writes and monotonic-read

Strict consistency

Sequential consistency

View this question

A client reads value `x=1` at replica R1, and later reads from R2 which still stores `x=0`. Which consistency model is violated?

Read-Your-Writes

Eventual Consistency

Monotonic Write

View this question

A distributed database ensures that all replicas will eventually contain the same value if no new updates occur.

Which of the following is not guaranteed in eventual consistency?

System tolerates temporary inconsistency

Reads always return the latest value

Conflicting updates must be resolved

Replicas converge in the absence of updates

View this question

In Ricart–Agrawala, if a process crashes after sending REPLY but before entering its CS, what happens?

Token duplication

No issue — mutual exclusion preserved

View this question

Suppose the master clock time is 10:00:00, and three slave clocks report 9:59:56, 10:00:03, and 9:59:58 respectively. Ignoring message delays, what will be the average time in Berkeley’s algorithm?

View this question

Previous
1
5
6
7
27
Next

Want instant access to all verified answers on moodle.spit.ac.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome

Telegram Instagram TikTok Question Bank

Terms of Use Contact Us

Add to Chrome

Add to Chrome