All categories

3 years ago

Following the car in front of you at a closer distance _____.

Computers and Technology

2 answers:

tiny-mole [99]3 years ago

6 0

Answer:

B. Doesn’t get you to your location faster.

Explanation:

Following the car in front of you at a closer distance doesn’t get you to your location faster.

kolezko [41]3 years ago

6 0

Answer:

doesnt get you to your location faster so B

You might be interested in

2. A body is thrown vertically 100 m/s Theme taken to retum

kondaur [170]

Answer:dead man lol roffle

Explanation:Not a gamer moment

6 0

3 years ago

A. Calculate the diffusion coefficient for magnesium in aluminum at 450°C.

SIZIF [17.4K]

Answer:

a) D = 4.88 * 10^(-14) m^2 / s

b) t = 1.1 hr

Solution:

a) Magnesium in Aluminum diffusion:

D = Do * exp(-Qd / RT)

= (1.2 * 10^(-4) m^2 / s) * exp ( - 130,000 / 8.31 * 723.15)

= 4.88 * 10^(-14) m^2 / s

D = 4.88 * 10^(-14) m^2 / s

b) The composition remains same at say the distance Xo:

(Cx - Co) / (Cs - Co) = Constant

Xo^2 / D_{550} * t = Xo^2 / D_{450} * 15

D_{550} * t = D_{450} * 15

(1.2 * 10^(-4) m^2 / s) * exp ( - 130,000 / 8.31 * 723.15) * t

(4.88 * 10^(-14) m^2 / s) * 15

by, solving for t we get:

t = 1.1 hr

So, the time required is 1.1 hr.

5 0

3 years ago

burger hut is trying to decide if it can receive money from the government for providing employees with insurance .

lawyer [7]

Answer:

A cell grows to its full size, The cell copies its DNA

have a great weekends, hopefully it was the right answer!

8 0

3 years ago

Given an input array of strings (characters) s, pick out the second column of data and convert it into a column vector of data.

hodyreva [135]

Answer:

Consider the following code.

Explanation:

save the following code in read_and_interp.m

function X = read_and_interp(s)

[m, n] = size(s);

X = zeros(m, 1);

for i = 1:m

if(str2num(s(i, 2:5)) == 9999)

% compute value based on previous and next entries in s array

% s(i, 2:5) retrieves columns 2-5 in ith row

X(i,1) = (str2num(s(i-1 ,2:5)) + str2num(s(i+1,2:5)))/2;

else

X(i,1) = str2num(s(i,2:5));

end

======================

Now you can use teh function as shown below

s = [ 'A' '0096' ; 'B' '0114' ; 'C' '9999' ; 'D' '0105' ; 'E' '0112' ];

read_and_interp(s)

output

ans =

96.000

114.000

109.500

105.000

112.000

7 0

3 years ago

Using Sequential Search on an array of size n, the search key is definitely present in the array. The probability of matching th

MissTica

Answer:

(11n-5) / 12 is correct answer.

Explanation:

The Probability that key will match to nth term = 1/2

The Probability that key will match to n-1th term = 1/3

As all other probabilities are equal

The Total Probability that key matches to any of 1 to n-2 index = 1 - 1/2 - 1/3 = 1/6

The Probability that key matches to any of 1 to n-2 index = (1/6) / n-2 = (1/6)* (n-2))

Let P(i) = Probability that key matches to ith index.

The Average time complexity = 22 i=1 P(i) * i

The Average time complexity = 1/(6(n-2) * ( sum of 1 to n-2 ) + (n-1) / 3 + n/2

The Average time complexity = 1/(6(n-2) * ( n-2)*(n-1) / 2 + ( n-1) / 3 + n/2

The Average time complexity = 1/6 * (n-1)/2 + (n-1)/3 + n/2

The Average time complexity = (n-1)/12 + (n-1)/3 + n/2

The Average time complexity = (n-1 + 4 * n - 4 * 1 +6 * n)/12

The Average time complexity = 11n-5 / 12

so (11n-5) / 12 is correct answer.

7 0

3 years ago