All categories

4 years ago

If you had a match and a lantern and a candle in the dark which one would you choose to light.

Engineering

2 answers:

zalisa [80]4 years ago

8 0

Answer:

the match 100% XD

Explanation:

PSYCHO15rus [73]4 years ago

5 0

Answer:

The match

Explanation:

You can light both the lantern and the candle if you light the match first.

I don't know of this is a homework question, but I answered it anyway :)

You might be interested in

What is the tolerance of number 4?

Kamila [148]

Answer:

Answer: ±0.02 units or 20±0.02 units or 19.98-20.02 units depending on how they prefer its written (typically the first or second one)

Explanation:

says on the sheet. Unless otherwise stated 0.XX = ±0.02 tolerance

(based on image sent in other post)

5 0

3 years ago

Describe the cycle that purifies drinking water. 40 points

Sunny_sXe [5.5K]

Umm the Water cycle sorry I’m trying

5 0

4 years ago

Read 2 more answers

50 for brainliest HELP ASAP<br> absurd answers will be recorded

s2008m [1.1K]

Answer:

1) This is because too much fuel is needed to get a payload from the surface to orbital altitude an accelerated to orbital speed.

2) This is because space travel present extreme environment that affect machines operations and survival.

Explanation:

Hope it helps

3 0

3 years ago

A capillary tube is immersed vertically in a water container. Knowing that water starts to evaporate when the pressure drops bel

Anuta_ua [19.1K]

Answer:

$d=0.414\times 10^{-4}\ m$

Explanation:

Given that

P = 4 KPa

Contact angle = 6°

Surface tension = 1 N/m

Lets assume that atmospheric pressure = 100 KPa

Lets take that density of water = $1000\ kg/m^3$

So the capillarity rise h

$h=\dfrac{\Delta P}{\rho g}$

$h=\dfrac{100\times 1000-4\times 1000}{1000\times 10}$

h= 9.61 m

We know that for capillarity rise h

$h=\dfrac{2\sigma cos\theta }{r\rho g}$

$r=\dfrac{2\sigma cos\theta }{h\rho g}$

$r=\dfrac{2\times 1 cos4^{\circ} }{9.61\times 1000\times 10}$

$r=0.207\times 10^{-4}\ m$

$d=0.414\times 10^{-4}\ m$

3 0

3 years ago

Time complexity of merge sort

vovangra [49]

Answer:

The correct answer is " $O (n\times Log n)$ ". A further explanation is given below.

Explanation:

Throughout all the three instances (worst, average as well as best), the time complexity including its Merge sort seems to be $O (n\times Log n)$ as the merge form often splits the array into two halves together tends to linear time to combine multiple halves.
As an unsorted array, it needs an equivalent amount of unnecessary capacity. Therefore, large unsorted arrays are not appropriate for having to search.

6 0

3 years ago