All categories

3 years ago

True or False: Like the edges of a filled-in area, the endpoints of a polygon do not need to conform to snap points.

Mathematics

1 answer:

kirill [66]3 years ago

8 0

Answer:

The answer is "False."

Explanation:

An area is considered the amount of space that an object occupies. A filled-area subjects the object to be made up of lines. These lines connect with each other to form an "edge."

The connection of the lines in order to define the object's shape or area are considered "snap points." Remember that "polygons" are made of line segments, where their endpoints meet with each other in order to define its closed shaped. <u>Thus, it needs to conform to "snap points."</u>

This explains the answer.

You might be interested in

I NEED HELP WHAT IS 3÷4 1/2÷3 3/4=????

Alexxx [7]

Answer:

8/45

Step-by-step explanation:

4 0

3 years ago

The perimeter of a rectangle is 102 cm. If the length is 15 cm less than twice the width , what are the dimensions?

lianna [129]

Let the length be $\ell$ and the width be $w$ . Now, write the length in terms of the width. "The length is 15 cm. less than twice the width" in the form of an equation is

$\ell = 2w - 15 cm.$

Let's plug that into the equation for the perimeter now. The perimeter of a rectangle is $2 \ell + 2w$ , so the equation for the perimeter of this rectangle is

$2 \ell + 2w = 102 cm.$

Plugging in the length in terms of width and solving for the width, we get

$2(2w - 15 cm.) + 2w = 102 cm.$
$6w - 30 cm. = 102 cm.$
$6w = 132 cm.$
$\bf w = 22 cm.$

To find the length, we just have to plug in the width into the equation we wrote for the length in terms of the width:

$\ell = 2w + 15 cm.$
$\ell = 2(22 cm.) - 15 cm.$
$\bf \ell = 29 cm.$

7 0

3 years ago

Help!!!! What is the answer??????

ANTONII [103]

Answer:I think is A

Step-by-step explanation:

5 0

3 years ago

uppose that we have a function with a constant amount of work done in initialization, a call to a log-linearsorting algorithm, a

White raven [17]

Answer:

The running time is quadratic (O(n²) )

Step-by-step explanation:

For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is

C + T(n) + n*(a*n+b) = an²+bn + T + C

Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).

7 0

3 years ago

When the net is folded up, which sides will touch?

Tresset [83]

<h3>Answer: Choice C is correct</h3>

Explanation:

We can think of the square in the middle of the four others as the floor

The surrounding four squares are the walls that fold upward.

The square at the very right side will then form the ceiling.

Side E and side L join at the top left edge.

See the diagram below.

6 0

2 years ago