All categories

2 years ago

Need help, I will give cake :)) + branliest

Engineering

2 answers:

Dominik [7]2 years ago

6 0

The answer is a. lol!

Talja [164]2 years ago

3 0

Answer:

Explanation:

it goes good with it.

You might be interested in

A force is a push or pull in A.a circle B.an arc C.a straight line

Bingel [31]

Answer:

I think it is B: an arc

Explanation:

hope this helps mark as brainiest

4 0

2 years ago

4.68 Steam enters a turbine in a vapor power plant operating at steady state at 560°C, 80 bar, and exits as a saturated vapor at

garik1379 [7]

Answer:

please mark me as a brainleast

Explanation:

hahahahhahaahhahahahahahahahahahahahahahahahaahhhahhhahaahahhaahhhahahaah

3 0

2 years ago

A 3.52 kg steel ball is tossed upward from a height of 6.93 meters above the floor with a vertical velocity of 2.99 m/s. What is

Dafna1 [17]

Answer : The final velocity of the ball is, 12.03 m/s

Explanation :

By the 3rd equation of motion,

$v^2-u^2=2as$

where,

s = distance covered by the object = 6.93 m

u = initial velocity = 2.99 m/s

v = final velocity = ?

a = acceleration = $9.8m/s^2$

Now put all the given values in the above equation, we get the final velocity of the ball.

$v^2-(2.99m/s)^2=2\times (9.8m/s^2)\times (6.93m)$

$v=12.03m/s$

Thus, the final velocity of the ball is, 12.03 m/s

7 0

3 years ago

Consider two different versions of algorithm for finding gcd of two numbers (as given below), Estimate how many times faster it

juin [17]

Answer:

Explanation:

Step 1:

a) The formula for compute greatest advisor is

gcd(m,n) = gcd (n,m mod n)

the gcd(31415,14142) by applying Euclid's algorithm is

gcd(31,415,14,142) =gcd(14,142,3,131)

=gcd=(3,131, 1,618)

=gcd(1,618, 1,513)

=gcd(1,513, 105)

=gcd(105, 43)

=gcd(43, 19)

=gcd(19, 5)

=gcd(5, 4)

=gcd(4, 1)

=gcd(1, 0)

STEP 2

b) The number of comparison of given input with the algorithm based on checking consecutive integers and Euclid's algorithm is

The number of division using Euclid's algorithm =10 from part (a)

The consecutive integer checking algorithm:

The number of iterations =14,142 and 1 or 2 division of iteration.

14,142 ∠= number of division∠ = 2*14,142

Euclid's algorithm is faster by at least 14,142/10 =1400 times

At most 2*14,142/10 =2800 times.

5 0

3 years ago

Which of the following conditions were present in over 80% of paddling fatalities from 1995-2000?

Minchanka [31]

Answer:

80% of the people that were killed weren't wearing a safety flotation device ( in correct terminology Personal Flotation Device, or PFD )

Explanation:

Hence they drowned due to the lack of safety.

3 0

3 years ago