All categories

2 years ago

Pointttttttttttttssssssssssss

Engineering

1 answer:

ArbitrLikvidat [17]2 years ago

7 0

Answer:

Explanation:

You might be interested in

Linus is using a calculator to multiply 5,426 and 30. He enters 5,426 x 300 by mistake. What can Linus do to correct his mistake

Alexxx [7]

Answer:

<em>Linus needs to take one of the zero out and it should be 30 instead 300.</em>

Explanation:

It is because Linus put three zero instead two zero.

4 0

2 years ago

a motor has torque of 200 nm if i motors attached to an arm with a length of 25 cm and a string is too attached to the end appro

kogti [31]

Answer:

noescompa

Explanation:

puntos

8 0

2 years ago

What’s the answer???

Zanzabum

D IS THE ANSWER ❤︎❤︎❤︎spread love and share knowledge

3 0

2 years ago

I) A sag vertical curve is to be designed to join a 4% grade to a 2% grade. If the design

Burka [1]

Answer:

=4/5 because I'm not going to go back in a year meaning that they are you are

4 0

1 year ago

The Ethernet (CSMA/CD) alternates between contention intervals and successful transmissions. Assume a 100 Mbps Ethernet over 1 k

Vesnalui [34]

<h3><u>CSMA/CD Protocol: </u></h3>

Carrier sensing can transmit the data at anytime only the condition is before sending the data sense carrier if the carrier is free then send the data.

But the problem is the standing at one end of channel, we can’t send the entire carrier. Because of this 2 stations can transmit the data (use the channel) at the same time resulting in collisions.

There are no acknowledgement to detect collisions, It's stations responsibility to detect whether its data is falling into collisions or not.

<u>Example: </u>

$T_{P}=1 H r$ , at time t = 10.00 AM, A starts, 10:59:59 AM B starts at time 11:00 AM collision starts.

12:00 AM A will see collisions

Pocket Size to detect the collision.

$\begin{aligned}&T_{t} \geq 2 T_{P}\\&\frac{L}{B} \geq 2 T_{P}\\&L \geq 2 \times T_{P} \times B\end{aligned}$

CSMA/CD is widely used in Ethernet.

<u>Efficiency of CSMA/CD:</u>

In the previous example we have seen that in worst case $2 T_{P}$ time require to detect a collision.

There could be many collisions may happen before a successful completion of transmission of a packet.

We are given number of collisions (contentions slots)=4.

$\text { Propagation day }=\frac{\text {distance}}{\text {speed}}$

Distance = 1km = 1000m

$\begin{aligned}&\text { Speed }=2 \times 10^{8} \mathrm{m} / \mathrm{sec}\\ &T_{P}=\frac{1000}{2 \times 10^{8}}=(0.5) \times 10^{-5}=5 \times 10^{-6}\\ &T_{t}=5 \mu \mathrm{sec}\end{aligned}$

7 0

2 years ago