All categories

3 years ago

OKAY I GOING HAVE MEATEL BREAK DOWN IF SOMEONE DOES NOT HELP ME THID DUE TODAY AT 11:59PM AND I SO STRESS.

Mathematics

2 answers:

quester [9]3 years ago

4 0

Answer:

A. ?

B. ?

C. ?

1. Different

2. Same

3. Not always

4. multiplying, same, different

5. Don't know

6. and 7. don't have any students or anything so I can't answer that

Step-by-step explanation:

I kinda went off what I knew

Hey at least I tried

Maru [420]3 years ago

3 0

Answer:

6 and 7

-(1/2) and -1/2 is correct

because those students answer equals to -0.5

Step-by-step explanation:

You might be interested in

Which answer is the slope-intercept form for the given equation? 13x+2y=43

yanalaym [24]

Y=-13/2x+43/2 I hope this helped :3

3 0

3 years ago

Read 2 more answers

Expresión factorizada 12abxyz - 3xyz - 4 ab + 1

BARSIC [14]

Answer:

12+3-4+1=12

Step-by-step explanation:

5 0

2 years ago

A triangle has side lengths of (2t + 2) centimeters, (6t – 7) centimeters,

Scorpion4ik [409]

A triangle is a three-sided polygon. The sum of angles in a triangle is 180 degrees.

Types of triangles

An equilateral triangle : the three sides are equal in length.
An isosceles triangle : two sides are equal in length
A right angled triangle : an angle measures 90 degrees

The perimeter of a triangle is (8t -7 + u) centimeters

The perimeter of a triangle is the sum of the three lengths of the triangle

2t +2 + 6t - 7 + u -2

Combine similar terms

(2t + 6t) + (2 - 7 - 2) + u

Add combined similar terms

8t -7 + u

To learn more about the perimeter of a triangle, please check: brainly.com/question/11681906?referrer=searchResults

3 0

2 years ago

Consider the graph of f(x) given below.

In-s [12.5K]

The answer to this equation is C. g(x) Hope this helps!

3 0

2 years ago

Read 2 more answers

Give a big-O estimate for the number of operations, where an operation is a comparison or a multiplication, used in this segment

kap26 [50]

Answer:

O(n2)

Step-by-step explanation:

the first iteration algorithm of the i-for loop (the outer loop), the j-for loop (the inner loop) will run 2 to

n times which is represented as

(n − 1 times).

the second iteration algorithm of the i-for loop, the j-for loop will run 3 to n times represented as

(n − 2 times).

the third to the last iteration algorithm of the i-for loop, the j-for loop will run n − 1 to n times (2 times).

And the second to the last iteration of the i-for loop, the j-for loop will run from n to n times (1 time)

For the last iteration of the i-for loop, the j-for loop will run 0 times because i + 1 > n.

Now we know that the number of times the loops are run is

1 + 2 + 3 + . . . + (n − 2) + (n − 1) = n(n − 1)/2

So we can express the number of total iterations as n(n − 1)/2.

Since we have two operations per loop (one comparison and one multiplication), we have

2 ·n(n−1)/2 = n

2 − n operations.

So f(n) = n2 − n

f(n) ≤ n2

for n > 1.

Therefore, the algorithm is O(n2) with

C = 1 and k = 1.

8 0

3 years ago