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.

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

In distributed systems, mutual exclusion ensures:

Only one process ever executes

Processes execute in strict sequential order

No two processes execute in their critical section concurrently

All processes enter critical section simultaneously

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

Which of the following ensures ordering of critical section execution in request timestamp order?

Ricart–Agrawala Algorithm

Suzuki–Kasami Algorithm

Centralized Coordinator Algorithm

Token Ring Algorithm

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

In distributed mutual exclusion, which of the following statements correctly differentiates token-based and non-token-based algorithms?

Non-token-based algorithms use fewer messages than token-based ones.

Token-based algorithms guarantee fairness, non-token-based do not.

In token-based algorithms, the critical section is granted using a circulating token; in non-token-based, it is based on permission from other nodes.

Token-based algorithms require acknowledgment messages; non-token-based do not.

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

Clock drift rate of a clock is defined as:

The maximum rate at which the clock’s time can deviate from real time.

The absolute difference in clock readings.

The difference in synchronization interval.

The maximum permissible offset.

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

In the Bully algorithm, which of the following statements is TRUE?

The process with the smallest ID becomes coordinator.

The process with the highest ID always wins the election.

A process can become coordinator only if it initiates the election.

Every process always starts an election when it detects a failure.

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

A client updates `x=5` on replica R1 and immediately reads `x` from replica R2, which has not yet received the update. What model is violated?

Session Consistency

Read-Your-Writes Consistency

Eventual Consistency

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

Which of the following best describes the multi-threaded architecture of a distributed file server?

Each thread has its own file system cache and metadata.

Each thread runs on a separate physical machine.

Threads are not suitable for distributed file servers.

Each thread handles requests independently but shares access to cached data structures.

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

Which one of the following is NOT shared by the threads of the same process ?

Message Queue

Address Space

File Descriptor Table

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

Which migration model describes the movement of both code and execution state, possibly resulting in remote cloning of a process?

Sender-initiated migration

Strong mobility

Resource migration

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

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is deterministic

context-free

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is not

accepted by any deterministic PDA

L

= {aⁿbⁿ | n ≥ 0} and is not accepted by any finite automata

L is not accepted by

any Turing machine that halts on every input

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

Попередня
1
7
8
9
27
Наступна

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.spit.ac.in?

Отримайте необмежений доступ до відповідей на екзаменаційні питання - встановіть розширення Crowdly зараз!

Додати до Chrome

Telegram Instagram TikTok Question Bank

Умови використання Зв'яжіться з нами

Додати до Chrome

Додати до Chrome