All categories

3 years ago

Which statement about synchronous communication is true?

1 answer:

3 0

In general, synchronous communication means you have to wait for the answer all the time. The programming logic is simpler, but the cost that you spend a lot of time waiting.

If the options are:

<span>a. The people communicating don't need to be online at the same time.
b. There is lag time in the communication.
c. The communication occurs in real time.

a is false, you do need to be online to receive the message
b is true, typically you continue only after an acknowledgement
c is true, you wait for acknowledgement that occurs in real time (not necessarily fast though)</span>

You might be interested in

Have you ever been presented to someone else's home page of a given website?

worty [1.4K]

Answer: No, is this the question?

Explanation: Have a stupendous day! <3

6 0

3 years ago

List any two features of this computer

zaharov [31]

Answer:

John Mauchy 1. designed to be a stored-program computer 2. it was binary rather than decimal

3 0

3 years ago

A program executes 15 billion instructions. You are running this program in two systems: System A: has a processor with 3 GHz an

katrin2010 [14]

Answer:

CPU clock cycles = Instruction count x CPI.

CPU execution time =

= CPU clock cycles x Clock cycle.

= Instruction count x CPI x Clock cycle.

T =

x CPI x C

Explanation:

i'm guessing

7 0

3 years ago

A common approach for managing the issuance of asymmetric keys is based on the _____________________________ mechanism, which ex

Nady [450]

Answer: RSA infrastructure

Explanation:

Using this infrastructure we can implement asymmetric cryptography using a pair of public key and private key. It works on the mechanism that if one of the key is used for encryption the other key is used to decrypt the message.

3 0

4 years ago

Which of the following functions grows at a faster rate than the rest? (Points : 6)

ehidna [41]

Answer:

n2.

Explanation:

The function with the time complexity of n2 is the fastest growing function is in terms of square.As n increases the time complexity will grow very rapidly.

n=1 n2=1

n=2 n2=4

n=3 n2=9

n=4 n2=16

n=5 n2=25.

The slowest growing function among them is log n then n and then n log n.

n log n is better than n2.

4 0

3 years ago