Math - Unit 2 Flashcards

1
Q

Perimeter of Square

A

4s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Perimeter of rectangle

A

2W + 2L

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Perimeter of triangle

A

a + b + c

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Perimeter of circle

A

2πr

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Area of square

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Area of rectangle

A

L x W

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Area of triangle

A

1/2bh

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Area of circle

A

πr²

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Area of trapezoid

A

1/2(a+b)h

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Area of parallel

A

b x h

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Volume of circle

A

4/3π r³

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Volume of rectangle

A

LWH

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Volume of cube

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Volume of cylinder

A

π r²h

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Volume of triangle

A

1/3Bh

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Volume of cone

17
Q

Surface are of circle

18
Q

Surface area of rectangle

19
Q

Surface area of square

20
Q

Surface area of cylinder

A

2πr² + 2πrh

21
Q

Open walk

A

starts and ends at different points

22
Q

Closed walk

A

start and end points are the same

23
Q

Hamilton Path

A

every vertex exactly once; doesn’t have to start or end on same point

24
Q

Cycle & Circuit

A

Cycle = closed walk, no vertices or edges are repeated.
Circuit = closed walk, no edges repeated but vertices can be

25
Hamilton Circuit
every vertex once with no repeats
26
Euler Path
every edge in graph with no repeats
27
Euler Circuit
every edge in graph with no repeats