Multiple choice Quiz Flashcards

1
Q

q3. Which of these are abstractions that will be covered in the course?

A

Shared memory
Consensus
Reliable broadcast

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

q3. Communication between components in our programming model can be done by:

A

Sending and receiving messages (only)

The event-based programming model can only communicate using events/messages, and doesn’t have shared variables.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

q3. Events in our model can be:

A

Messages
Timers
Conditions (e.g. x == 5 && y < 9)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

q3. The interface for a channel component have the following events:

A

A deliver indication event
A send request event
The events need to have the correct type (request or indication).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

q3. Which of the following should be part of a service specifications?

A
Service interface (API)
The required system model
Correctness properties

The specification only describes “what”, not “how”.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

q3. The service API describes

A

Responses (indication events)

Requests (request events)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

q3. A safety property states that

A

Nothing bad ever happens

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

q3. A liveness property states that

A

Something good eventually happens

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

q3. Is it the case that any property can be described as a conjunction of a safety property and a liveness property?

A

True

This has been proven formally

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

q3. Safety can only be satisfied in infinite time

Safety can be violated in finite time

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

q3. Liveness can only be violated in infinite time

Liveness can be satisfied in finite time

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

q3. If it doesn’t fail in the (entire) execution

A correct process is one which never fails at any point in the execution.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

q3. In the crash-stop model, processes are not allowed to recover

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

q3. In the crash-recovery model, a process is faulty if

A

It crashes and never recovers

It crashes and recovers infinitely often

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

q3. Which of the following models are special cases of the crash-recovery model?

A

Omission

Crash-stop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

q3. The channel model…

A

Describes characteristics/guarantees of the network

17
Q

q3. When using a fair-loss link, if a message m is sent infinitely often by pi to pj, and neither crash, what is guaranteed to happen?

A

m is delivered an infinite number of times by pj

18
Q

q3. When using a fair-loss link, if a message m is sent 10 times by pi to pj, how many times may the message be delivered?

A

A message cannot be duplicated infinitely many times.

19
Q

q3. When using a fair-loss link, if a message m has not been sent by any process to pj, is pj allowed to deliver m?

A

No message is delivered unless it was sent.

20
Q

q3. When using stubborn links,if a node pi sends a message m to a correct node pj, and pi does not crash, how many times does pj deliver m?

A

An infinite number of times

21
Q

q3. Is it possible to implement the stubborn linkserviceusing the fair-loss link service?

A

True

22
Q

q3. When using perfect links, if a message m is sent by pi to pj, andneither pi nor pj crashes, is pj guaranteed to deliver m?

A

Yes, eventually (unbounded time)

23
Q

q3. When using perfect links, if a message m is sent by pi to pj, how many times is the message allowed to be delivered?

A

At most once

24
Q

q3. Which kind of system is described by the following statement: my server always processes requests within one week.

A

Synchronous system

There is a known bound on node processing delay.

25
Q

q3. Which kind of system is described by the following statement: my server processes requests within one week when it is running, and it will eventually be running for at least a week, I just don’t know when that will be.

A

Partially synchronous system

26
Q

q3. Safety in distributed systems describes:

A

a property that states that the system is robust to malicious behavior
a property that states that an event that is applicable is immediately applied
a property that holds for every execution in some configuration
a property that holds in every reachable configuration

27
Q

q3. Liveness in distributed systems describes:

A

a property that ensures low time complexity
a property that states that an event that is applicable infinitely many times is eventually applied
a property that holds for every execution in some configuration
a property that states that an event that is applicable infinitely many times is applied infinitely many times

28
Q

Select all cases when process p is correct, assuming the crash-recovery model. CORRECT

A

p crashes and recovers once every minute for the first year but after that never crashes again
p never crashes

29
Q

A new and highly advanced computer system has been installed and is running. The system guarantees that processes can send messages to each other in less than 10 microseconds. But the system needs to run an automatic tuning procedure before this 10 microsecond-guarantee starts to hold, and during this procedure the communication delays are unbounded. No one knows how long time the tuning procedure will take.
Which model best describes this system?

A

Partially synchronous