Crowdly

Додати до Chrome

Університети
moodle.spit.ac.in
TE ISE Computer Engineering

TE ISE Computer Engineering

Шукаєте відповіді та рішення тестів для TE ISE Computer Engineering? Перегляньте нашу велику колекцію перевірених відповідей для TE ISE Computer Engineering в moodle.spit.ac.in.

Отримайте миттєвий доступ до точних відповідей та детальних пояснень для питань вашого курсу. Наша платформа, створена спільнотою, допомагає студентам досягати успіху!

How

many elements are in GF(2³)?

100%

Переглянути це питання

Apply

the Euclidean Algorithm to compute gcd(252, 198)

100%

Переглянути це питання

Which of the following polynomials is reducible

over GF(2)?

x³

+ x + 1

x²

+ 1

x³

+ x² + 1

x²

+ x + 1

Переглянути це питання

In Christian’s algorithm, the client sends a request at T₁, the server receives it at T₂, sends a reply at T₃, and the client receives it at T₄.

The best estimate of server time when client receives the reply is:

Переглянути це питання

Which statement correctly relates synchronization delay and throughput?

Token-based algorithms have lower synchronization delay than non-token-based ones.

Both have equal synchronization delay for large N.

Synchronization delay is independent of algorithm type.

Non-token-based algorithms have higher throughput than token-based.

Переглянути це питання

The token ring algorithm assumes that:

Processes know only their neighbors’ addresses

Communication channels are unreliable

Processes are arranged in a logical ring and message passing is FIFO

Every process maintains a request queue

Переглянути це питання

In strict consistency, a read operation returns the value of the most recent write in real time, while in sequential consistency, it returns the value of the most recent write in the same sequential order seen by all processes. If network latency causes delayed propagation of writes, which model will fail?

Causal consistency

Sequential consistency

100%

Monotonic consistency

Strict consistency

Переглянути це питання

If there are 5 processes, how many messages are exchanged in one critical section entry using the Suzuki–Kasami broadcast algorithm?

67%

33%

Переглянути це питання

Which of the following is not a typical motivation for migrating code in distributed systems?

Load distribution