All categories

3 years ago

Host Y sends the first TCP ACK message for the transaction? a. true b. false

Computers and Technology

1 answer:

kupik [55]3 years ago

8 0

Answer: True

Explanation:

TCP is the transmission control protocol which and TCP ACK is the transmission control handshake method which are used by TCP. It basically indicates the next sequence number in the method when the flag is set.

Firstly, the ACK (Acknowledge) send by the each end for the initial sequence number itself but it does not contained any type of data. In the TCP segment header ACK contain 32 bit field.

The acknowledgement is just a proof to clients that ACK is a specific to the SYN when the clients initiate.

You might be interested in

Examine the exhibit above. "Device A" is an 8-port layer 2 managed switch and "Device C" is a 4-port hub. Which of the following

Harlamova29_29 [7]

Answer:

Device B is Router.

Explanation:

Router is the device that is used to connect different networks to communicate with each other to make possible for all devices of all networks to communicate with each other that are connected to that particular network.

In above case, Device A is 8 port switch that makes a network of 8 different computers. Device C is a 4 port hub that is connected with 4 computers. Both Device A and Device C are different Networks, router is used to connect both all devices of both networks so that they can communicate each other. So the Device B should be router.

6 0

2 years ago

Oxnard Casualty wants to ensure that their e-mail server has 99.98 percent reliability. They will use several independent server

sattari [20]

Answer:

The smallest number of servers required is 3 servers

<em />

Explanation:

Given

$Reliability = 99.98\%$

$Individual Servers = 95\%$

Required

Minimum number of servers needed

Let p represent the probability that a server is reliable and the probability that it wont be reliable be represented with q

Such that

$p = 95\%\\$

It should be noted that probabilities always add up to 1;

So,

$p + q = 1$ '

Subtract p from both sides

$p - p + q = 1 - p$

$q = 1 - p$

Substitute $p = 95\%\\$

$q = 1 - 95\%$

Convert % to fraction

$q = 1 - \frac{95}{100}$

Convert fraction to decimal

$q = 1 - 0.95$

$q = 0.05$

------------------------------------------------------------------------------------------------

<em>To get an expression for one server</em>

The probabilities of 1 servers having 99.98% reliability is as follows;

$p = 99.98\%$

Recall that probabilities always add up to 1;

So,

$p + q = 1$

Subtract q from both sides

$p + q - q = 1 - q$

$p = 1 - q$

So,

$p = 1 - q = 99.98\%$

$1 - q = 99.98\%$

Let the number of servers be represented with n

The above expression becomes

$1 - q^n = 99.98\%$

Convert percent to fraction

$1 - q^n = \frac{9998}{10000}$

Convert fraction to decimal

$1 - q^n = 0.9998$

Add $q^n$ to both sides

$1 - q^n + q^n= 0.9998 + q^n$

$1 = 0.9998 + q^n$

Subtract 0.9998 from both sides

$1 - 0.9998 = 0.9998 - 0.9998 + q^n$

$1 - 0.9998 = q^n$

$0.0002 = q^n$

Recall that $q = 0.05$

So, the expression becomes

$0.0002 = 0.05^n$

Take Log of both sides

$Log(0.0002) = Log(0.05^n)$

From laws of logarithm $Loga^b = bLoga$

So,

$Log(0.0002) = Log(0.05^n)$ becomes

$Log(0.0002) = nLog(0.05)$

Divide both sides by $Log0.05$

$\frac{Log(0.0002)}{Log(0.05)} = \frac{nLog(0.05)}{Log(0.05)}$

$\frac{Log(0.0002)}{Log(0.05)} = n$

$n = \frac{Log(0.0002)}{Log(0.05)}$

$n = \frac{-3.69897000434}{-1.30102999566}$

$n = 2.84310893421$

$n = 3 (Approximated)$

<em>Hence, the smallest number of servers required is 3 servers</em>

6 0

2 years ago

LAB: Parsing dates Complete main() to read dates from input, one date per line. Each date's format must be as follows: March 1,

Vladimir [108]

The python code which can be used to read dates from input, one date per line and each date's format must be as follows: March 1, 1990, is:

<h3>Python code</h3>

import datetime

inputs = []

result = []

#read the inputs

date = input()

inputs.append(date)

while not date == "-1":

date = input()

inputs.append(date)

#check if the input is in the correct format and convert it.

for date_text in inputs:

try:

date_text = datetime.datetime.strptime(date_text,"%d %B, %Y")

result.append(date_text.strftime("%d/%m/%Y"))

except ValueError:

pass

print(*result, sep = "\n")

The above code would parse the string and extract the date. The split() method was used to break the input into tokens.

Read more about python programming here:

brainly.com/question/27666303

#SPJ1

6 0

1 year ago

Which type of computer serves as the heart of the computing systems for many, perhaps most, major corporations and government ag

Nezavi [6.7K]

Answer:

Mainframes

Explanation:

Mainframes are utilized by many major corporations and government agencies. They are also used in banking, accounting, and healthcare to name a few.

4 0

2 years ago

You are given a list of n positive integers a1, a2, . . . an and a positive integer t. Use dynamic programming to design an algo

Anna11 [10]

Answer:

See explaination for the program code

Explanation:

The code below

Pseudo-code:

//each item ai is used at most once

isSubsetSum(A[],n,t)//takes array of items of size n, and sum t

{

boolean subset[n+1][t+1];//creating a boolean mtraix

for i=1 to n+1

subset[i][1] = true; //initially setting all first column values as true

for i = 2 to t+1

subset[1][i] = false; //initialy setting all first row values as false

for i=2 to n

{

for j=2 to t

{

if(j<A[i-1])

subset[i][j] = subset[i-1][j];

if (j >= A[i-1])

subset[i][j] = subset[i-1][j] ||

subset[i - 1][j-set[i-1]];

}

//returns true if there is a subset with given sum t

//other wise returns false

return subset[n][t];

}

Recurrence relation:

T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times

T(1)=1

solving recurrence:

T(n)=T(n-1)+t

T(n)=T(n-2)+t+t

T(n)=T(n-2)+2t

T(n)=T(n-3)+3t

T(n)=T(n-n-1)+(n-1)t

T(n)=T(1)+(n-1)t

T(n)=1+(n-1)t = O(nt)

//so complexity is :O(nt)//where n is number of element, t is given sum

6 0

2 years ago