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!

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

View this question

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

View this question

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.

View this question

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.

View this question

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.

View this question

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

View this question

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.

View this question

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

Message Queue

Address Space

File Descriptor Table

View this question

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

View this question

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

View this question

Previous
1
7
8
9
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