Ask question

Ask question

All categories

3 years ago

10

_____ braking is when you squeeze the brake pedal until just before the wheels lock, then ease off the pedal, then squeeze again

, repeating until you've reduced your speed enough.
A. Traditional
B. Power
C. ABS
D. Threshold

2 answers:

grin007 [14]3 years ago

6 0

The answer should be d) threshold

frozen [14]3 years ago

6 0

Answer:

abs

Explanation:

i took the class

You might be interested in

Find the thickness of the material that will allow heat transfer of 6706.8 *10^6 kcal during the 5 months through the rectangle

Vinvika [58]

Answer:

The thickness of the material is 6.23 cm

Explanation:

Given;

quantity of heat, Q = 6706.8 *10⁶ kcal

duration of the heat transfer, t = 5 months

thermal conductivity of copper, k = 385 W/mk

outside temperature of the heater, T₁ = 30° C

inside temperature of the heater, T₂ = 50° C

dimension of the rectangular heater = 450 cm by 384 cm

1 kcal = 1.163000 Watt-hour

6706.8 *10⁶ kcal = 7800008400 watt-hour

I month = 730 hours

5 months = 3650 hours

Rate of heat transfer, P = $\frac{7800008400 \ Watt-Hour}{3650 \ Hours} = 2136988.6 \ W$

Rate of heat transfer, $P = \frac{K*A *\delta T}{L}$

where;

P is the rate of heat transfer (W)

k si the thermal conductivity (W/mk)

ΔT is change in temperature (K)

A is area of the heater (m²)

L is thickness of the heater (m)

$P = \frac{KA(T_2-T_1)}{L} \\\\L = \frac{KA(T_2-T_1)}{P}\\\\L = \frac{385(4.5*3.84)(50-30)}{2136988.6}\\\\L = 0.0623 \ m$

L = 6.23 cm

Therefore, the thickness of the material is 6.23 cm

8 0

3 years ago

With 64 KB of memory and 8 bits in each memory location, how wide should the address bus be to access all 64 KB of memory? (k =

marishachu [46]

Answer:

16-bit wide

Explanation:

In order to find the width of the address bus, we need first to know how many memory cells it is needed to address.

If the size memory is 64 KB, this means that the memory size, in bytes, is equal to the following quantity:

64 KB = 2⁶ * 2¹⁰ bytes = 2¹⁶ bytes.

In order to address this quantity of cell positions, the address bus must be able to address 2¹⁶ bytes, so it must have 16-bit wide.

3 0

3 years ago

You are in charge of ordering the concrete for a basement wall concrete pour. The wall forms are all set up and ready. The wall

choli [55]

Answer:

189.15cy

Explanation:

To understand this problem we need to understand as well the form.

It is clear that there is four wall, two short and two long.

The two long are $\rightarrow 120ft5in+2(10ft)$

The two long are $\rightarrow 122ft1in=122.08ft$

The two shors are $\rightarrow 86ft4.5in = 86.375ft$

The height and the thickness are 14ft and 0.83ft respectively.

So we only calculate the Quantity of concrete,

$Q_c = [(2*122.08)+(2*86-375)]*14*0.833\\Q_c=4864.02ft^3$

That in cubic yards is equal to $180.15 (1cy=27ft^3)$

Hence, we need order 5% plus that represent with the quantity

$Q_{ordered}=1.05*180.15=189.15cy$

8 0

3 years ago

Say you have a random, unordered list containing 4096 four-digit numbers. Describe the most efficient way to: sort the list and

Debora [2.8K]

Answer:

Answer explained below

Explanation:

It is given that numbers are four-digit so maximum value of a number in this list could be 9999.

So we need to sort a list of integers, where each integer lies between [0,9999].

For these given constraints we can use counting sort which will run in linear time i.e. O(n).

--------------------------------------------------------------------------------

Psuedo Code:

countSort(int numList[]) {

int count[10000];

count[i] = 0; for all i;

for(int num in numList){

count[num]+= 1;

}

return count;

}

--------------------------------------------------------------------------------

Searching in this count array will be just O(1).

E.g. Lets say we want to search if 3 was present in the original list.

Case 1: it was present in the original list:

Then the count[3] would have been incremented by our sorting algorithm. so in case element exists then count value of that element will be greater than 0.

Case 2: it was not present:

In this case count[3] will remain at 0. so in case element does not exist then count of that element will be 0.

So to search for an element, say x, we just need to check if count[x]>0.

So search is O(1).

Run times:

Sorting: O(n)

Search: O(1)

6 0

3 years ago

Outline the process used to test the following hypothesis: Titanium cages are stronger than steel cages for hockey goalie masks.

son4ous [18]

Answer:

true

Explanation:

8 0

3 years ago