Ask question

Ask question

All categories

3 years ago

6

Zona intermedia de pozos Y Efecto de inavasion

1 answer:

dlinn [17]3 years ago

5 0

so the answer is f because your a faliure so get out of here you fatty

You might be interested in

Valorant Or Csgo? which is best in your opinion?

SashulF [63]

Answer:

valorant valorant valorant is the best

7 0

2 years ago

Read 2 more answers

Which of the following is used in the electrical field?

weeeeeb [17]

Answer:

pliers

Explanation:

because that makes the most sense

6 0

2 years ago

Here, we want to become proficient at changing units so that we can perform calculations as needed. The basic heat transfer equa

netineya [11]

Answer:

9500 kJ; 9000 Btu

Explanation:

Data:

m = 100 lb

T₁ = 25 °C

T₂ = 75 °C

Calculations:

1. Energy in kilojoules

ΔT = 75 °C - 25 °C = 50 °C = 50 K

$m = \text{100 lb} \times \dfrac{\text{1 kg}}{\text{2.205 lb}} \times \dfrac{\text{1000 g}}{\text{1 kg}}= 4.54 \times 10^{4}\text{ g}\\\\\begin{array}{rcl}q & = & mC_{\text{p}}\Delta T\\& = & 4.54 \times 10^{4}\text{ g} \times 4.18 \text{ J$\cdot$K$^{-1}$g$^{-1}$} \times 50 \text{ K}\\ & = & 9.5 \times 10^{6}\text{ J}\\ & = & \textbf{9500 kJ}\\\end{array}$

2. Energy in British thermal units

$\text{Energy} = \text{9500 kJ} \times \dfrac{\text{1 Btu}}{\text{1.055 kJ}} = \text{9000 Btu}$

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)

=1

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

A program is seeded with 30 faults. During testing, 21 faults are detected, 15 of which are seeded faults and 6 of which are ind

Vesna [10]

Answer:

Estimated number of indigenous faults remaining undetected is 6

Explanation:

The maximum likelihood estimate of indigenous faults is given by,

$N_F=n_F\times \frac{N_S}{n_S}$ here,

$n_F$ = the number of unseeded faults = 6

$N_S$ = number of seeded faults = 30

$n_s$ = number of seeded faults found = 15

So NF will be calculated as,

$N_F=6\times \frac{30}{15}=12$

And the estimate of faults remaining is $N_F-n_F$ = 12 - 6 = 6

8 0

2 years ago