Where can the Field Service Manual containing Critical Callout, Disassembly and Reassembly instructions be found?

A natural language processor reads the sentence The walk was tiring and mistakes the noun “walk” as a verb. What is such an erro

Ray Of Light [21]

Answer: Which of these is a compound morphology? (A. bookkeeper = book + keeper)

The software first uses (NLU) to map and analyze the input. It then creates the output using (NLG).

(It works by mapping input to representation and analyzing them.)

What type of morphology does this follow? (D. derivational morphology)

What is such an error called? (C. lexical ambiguity)

Explanation: Plato

4 0

2 years ago

Gloria needs to show in spreadsheet form the number of students in her class who speak different languages. Which type of graph

vaieri [72.5K]

I think the most suitable chart to be used is a pie chart. A pie chart is used to show percentages and the best way to show relative sizes of data in your set. It is a good way to show which language is spoken more in the classroom, which is least spoken and at a glance. I hope my answer helps.

4 0

2 years ago

Sang ayon kaba sa pahayag na walang sinuman ang nabubuhay para sa sarili lamang? bakit?

d1i1m1o1n [39]

What language is this?

7 0

2 years ago

On the planet Sigma, robots excavate chunks of a very precious cristaline. These chunks can be divided into smaller part only on

Rainbow [258]

Answer:

Start the algorithm and check the weight of the ship. Load the crystalline to the ship. Check to see if the ship weighs ship weight + k pound crystalline, if less, add more crystalline. If excess, remove the excess crystalline, but if the weight meets the condition, then take off with the loaded ship to planet sigma.

Explanation:

The algorithm continuously checks the weight of the ship on loading with the calculated sum of the ship and k pound crystalline weight. The ship is able to load the correct maximum amount of crystalline to the planet sigma.

7 0

2 years ago

Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that pac

Katarina [22]

Answer:

The Tp value 0.03 micro seconds as calculated in the explanation below is negligible. This would lead to a similar value of time delay for both persistent HTTP and non-persistent HTTP.

Thus, persistent HTTP is not faster than non-persistent HTTP with parallel downloads.

Explanation:

Given details are below:

Length of the link = 10 meters

Bandwidth = 150 bits/sec

Size of a data packet = 100,000 bits

Size of a control packet = 200 bits

Size of the downloaded object = 100Kbits

No. of referenced objects = 10

Ler Tp to be the propagation delay between the client and the server, dp be the propagation delay and dt be the transmission delay.

The formula below is used to calculate the total time delay for sending and receiving packets :

d = dp (propagation delay) + dt (transmission delay)

For Parallel downloads through parallel instances of non-persistent HTTP :

Bandwidth = 150 bits/sec

No. of referenced objects = 10

For each parallel download, the bandwith = 150/10

= 15 bits/sec

10 independent connections are established, during parallel downloads, and the objects are downloaded simultaneously on these networks. First, a request for the object was sent by a client . Then, the request was processed by the server and once the connection is set, the server sends the object in response.

Therefore, for parallel downloads, the total time required is calculated as:

(200/150 + Tp + 200/150 + Tp + 200/150 + Tp + 100,000/150 + Tp) + (200/15 + Tp + 200/15 + Tp + 200/150 + Tp + 100,000/15 + Tp)

= ((200+200+200+100,00)/150 + 4Tp) + ((200+200+200+100,00)/15 + 4Tp)

= ((100,600)/150 + 4Tp) + ((100,600)/15 + 4Tp)

= (670 + 4Tp) + (6706 + 4Tp)

= 7377 + 8 Tp seconds

Thus, parallel instances of non-persistent HTTP makes sense in this case.

Let the speed of propogation of the medium be 300*106 m/sec.

Then, Tp = 10/(300*106)

= 0.03 micro seconds

The Tp value 0.03 micro seconds as calculated above is negligible. This would lead to a similar value of time delay for both persistent HTTP and non-persistent HTTP. Thus, persistent HTTP is not faster than non-persistent HTTP with parallel downloads.

4 0

2 years ago