All categories

3 years ago

Can you guys please help me solve this

Mathematics

1 answer:

Delicious77 [7]3 years ago

6 0

Answer:

it didnt load the picture, it doesnt show my guy

Step-by-step explanation:

You might be interested in

The measure of a square wall is 9 feet 7 inches on each side. Estimate the square feet a painter would have to cover to the near

Nookie1986 [14]

First, convert those inches to feet.
7in =ish 0.5833333
(you find this by dividing 7/12 on a calculator)
Now you just square 9.583333333
9.583333333^2
9.583333333 * 9.583333333
91.84027777ish
Rounded to the nearest foot, means the answer is 92ft.

5 0

3 years ago

Can you solve : 7x - 4 = 2

Zolol [24]

7x-4=2
add 4 to both sides
7x=2+4
7x=6
divide 7 to both sides
x=6/7

8 0

3 years ago

Read 2 more answers

The function C (t) = StartFraction 4 t Over t squared + 2 EndFraction models the cost per student of a field trip when x student

choli [55]

Answer:

C. It is vertically stretched by a factor of 200 and shifted 10 units up.

Step-by-step explanation:

7 0

3 years ago

"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

EASY- 50 PTS<br> ALGEBRA/ FUNCTION/ GRAPH MATH

alekssr [168]

9514 1404 393

Answer:

B. Up 1 and 2 to the left

Step-by-step explanation:

The second graph (blue) is up 1 and 2 left of the first graph (red).

You can compare the given equations to the form ...

y = a(x -h)^2 +k

For the first graph, we have (h, k) = (6, -1).

For the second graph, we have (h, k) = (4, 0).

Then the amount added to the first to make the second is ..

(4, 0) -(6, -1) = (-2, 1) . . . . . . a translation 2 left and 1 up

3 0

3 years ago

Read 2 more answers