Ask question

Ask question

All categories

3 years ago

14

Doris paid $316.80 for wallpaper to cover a 24 foot by 12 foot wall. She used all the wallpaper she purchased, with no waste or

overlap.
What was the cost of the wallpaper per square foot?

1 answer:

tatiyna3 years ago

4 0

The answer is $1.10 because if you divide and multiply by the other answers this answer is the only one that makes sense

You might be interested in

What rate represents the situation? Need help!

Ahat [919]

Answer:

B

Step-by-step explanation:

i want brainly

5 0

3 years ago

Sherry has a package in the shape of a rectangular prism. What is the volume, in cubic inches (in.), of the rectangular prism? (

Rudiy27

Answer:

See Explanation

Step-by-step explanation:

The question is incomplete as the dimension of the prism is not given. However, the following steps can serve as a guide for you.

The volume of a rectangular prism is calculated as thus:

$Volume = Length * Width * Height$

So, Take for instance

$Length = 2\ in$

$Width = 3\ in$

$Height = 4\ in$

The Volume would be:

$Volume = 2\ in * 3\ in * 4\ in$

$Volume = 24\ in^3$

7 0

3 years ago

The sum of one and the product of one and a number x

Annette [7]

1 + 1x

OR

1 + x

They mean the same thing! Hope this helps!

7 0

3 years ago

Read 2 more answers

"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim

iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0

3 years ago

Divide these polynomials. (8x³ + 2x² - 7x + 2) ÷ (2x - 1)

Novay_Z [31]

Answer:

The answer is letter A.

(8x³ + 2x² - 7x + 2) ÷ (2x - 1)

8x³ + 2x² - 7x + 2 ÷ 2x - 1

(2x-1)(4x²+3x-2)÷2x-1

cancel 2x-1 so that the answer is 4x²+3x-2.

6 0

3 years ago