Earth's mass is approximately 81 times.

The _____ process is a noncompetitive application process.

Irina18 [472]

B. Open admission. hope this helps

5 0

3 years ago

I fell asleep last night and was unable to finish my book. Yesterday I read from page 211 to page 275. How many pages did I read

zhuklara [117]

Answer:

64?

Explanation:

5 0

3 years ago

Dean collected data on the favorite sports of the students of two grades. The table shows the relative frequencies of rows for t

rodikova [14]

The statement that is most correct is (b) In Grade 8, 17% of students liked running.

<h3>How to interpret the two-way frequency table</h3>

<u>The students that like swimming</u>

From the table, we have the following highlights

24% students like swimming in grade 8
18% students like swimming in grade 9

<u>The students that like running</u>

From the table, we have the following highlights

17% students like running in grade 8
14% students like running in grade 9

<u>The students that like volleyball</u>

From the table, we have the following highlights

5% students like volleyball in grade 8
54% students like volleyball in grade 9

When the above highlights are compared to the given options, the correct statement is (b) In Grade 8, 17% of students liked running.

Read more about two-way frequency table at:

brainly.com/question/26313274

4 0

2 years ago

One fragment of a given integer n can be selected and its digits reversed (replaced with a right to left version of themselves).

andrew11 [14]

Integers are numbers without decimal points. The number could be positive, negative or zero

<h3>How to determine the maximum number from the integer</h3>

The maximum number from integer N can be determined using the following program written in Python, where comments are used to explain each line

#This prompts the user for input

num = input("Number: ")

#This iterates from 0 to 9

kount = [0 for x in range(10)]

# This iterates through the input, and updates the kount variable

for i in range(len(num)):

kount[int(num[i])] = kount[int(num[i])] + 1

# This next two lines initialize the greatest number

greatestNum = 0

multiplier = 1

# This iterates through the kount array

for i in range(10):

#The following is repeated while the current element is greater than 0

while kount[i] > 0:

#This generates the greatest number

greatestNum = greatestNum + ( i * multiplier )

kount[i] = kount[i] - 1

multiplier = multiplier * 10

#This prints the greatest number

print(greatestNum)

Read more about similar programs at:

brainly.com/question/26426553

7 0

2 years ago

The interaction between Miss Spivey and Ralphord serves mainly to

ivolga24 [154]

Can you give us more info?

6 0

3 years ago