(I|HEEEEELP)At the city museum, child admission is

Can someone please help me with this question.

Ber [7]

Answer:

square root of 2

Step-by-step explanation:

Sides are 1 and 1 and the hypotenuse is the longest side (opposite the right angle)

We can use pythagerouses theorem : a^2+b^2=c^2

this means that 1^2+1^2=c^2

1+1=c^2

2=c^2

c=2/sqrt

c is the square root of 2

the hypotenuse is the square root of 2

4 0

3 years ago

8th GRADE QUESTION GOOD EXPLAIN WILL MARK AS CROWN

Aloiza [94]

Answer:

43.5

Step-by-step explanation:

Hope

7 0

3 years ago

For the last drop down answer is FG<br> BC

Alisiya [41]

I believe the answer would be DE is parallel to line segment FG

5 0

3 years ago

Which product is negative?

Elden [556K]

Answer:

Second answer

Step-by-step explanation:

first answer: 4 negative numbers multiplied = 2 postive numbers multipled = 1 positive number

second answer: 3 negative numbers multiplied = 1 positive number multiplied by 1 negative number = 1 negative number

third answer: Negative and positive numbers multiplied by zero = 0

fourth answer: 2 negative numbers multiplied by 2 positive numbers = 1 positive number multiplied by 1 positive number = positive number.

8 0

3 years ago

Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. A seek takes 6 msec per cyli

m_a_m_a [10]

Answer:

a) 876 ms

b) 360 ms

c) 348 ms

Step-by-step explanation:

a) When using the First-come, first serve order, the starts at the initial cylinder and is served in the same order as it arrives.

For First-come, first serve, the order is served from (20), 10, 22, 20, 2, 40, 6, and 38.

Seek time = 10 + 12 + 2+ 18 + 38 + 34 + 32 = 146 cylinder

The request uses 146 cylinders, therefore the seek time = 146 cylinder * 6 ms/cylinder = 876 ms

b) When using the Closest cylinder next the request starts at the initial cylinder and is served using the shortest movement from current position.

For Elevator algorithm, the order is served from (20), 20, 22, 10, 6, 2, 38, 40

Seek time = 0 + 2 + 12+ 4 + 4 + 36 + 2 = 60 cylinder

The request uses 146 cylinders, therefore the seek time = 60 cylinder * 6 ms/cylinder = 360 ms

c) When using the Elevator algorithm the request starts at the initial cylinder and moves upwards, then reverses direction.

For Closest cylinder next, the order is served from (20), 20, 22, 38, 40, 10, 6, 2

Seek time = 0 + 2 + 16+ 2 + 30 + 4 + 4 = 58 cylinder

The request uses 146 cylinders, therefore the seek time = 58 cylinder * 6 ms/cylinder = 348 msa) When using the First-come, first serve order, the starts at the initial cylinder and is served in the same order as it arrives.

For First-come, first serve, the order is served from (20), 10, 22, 20, 2, 40, 6, and 38.

Seek time = 10 + 12 + 2+ 18 + 38 + 34 + 32 = 146 cylinder

The request uses 146 cylinders, therefore the seek time = 146 cylinder * 6 ms/cylinder = 876 ms

b) When using the Closest cylinder next the request starts at the initial cylinder and is served using the shortest movement from current position.

For Elevator algorithm, the order is served from (20), 20, 22, 10, 6, 2, 38, 40

Seek time = 0 + 2 + 12+ 4 + 4 + 36 + 2 = 60 cylinder

The request uses 146 cylinders, therefore the seek time = 60 cylinder * 6 ms/cylinder = 360 ms

c) When using the Elevator algorithm the request starts at the initial cylinder and moves upwards, then reverses direction.

For Closest cylinder next, the order is served from (20), 20, 22, 38, 40, 10, 6, 2

Seek time = 0 + 2 + 16+ 2 + 30 + 4 + 4 = 58 cylinder

The request uses 146 cylinders, therefore the seek time = 58 cylinder * 6 ms/cylinder = 348 ms

3 0

3 years ago