EA review

EA review

12th Grade

20 Qs

Similar activities

Faces Vertices And Edges

Faces Vertices And Edges

6th Grade - University

20 Qs

Simple Interest

Simple Interest

12th Grade

20 Qs

Chapter 7 Review

Chapter 7 Review

9th - 12th Grade

22 Qs

Networks Intro Quiz

Networks Intro Quiz

12th Grade

20 Qs

How Many Vertices, Faces, and Edges of 3D Shapes

How Many Vertices, Faces, and Edges of 3D Shapes

5th Grade - University

20 Qs

Identify Vertices, Faces

Identify Vertices, Faces

6th Grade - University

20 Qs

Solids and Polyhedra

Solids and Polyhedra

6th Grade - University

20 Qs

Rule of 72

Rule of 72

10th - 12th Grade

20 Qs

EA review

EA review

Assessment

Quiz

Created by

Sonya Formilan

Mathematics

12th Grade

2 plays

Medium

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The process of removing seasonal fluctuations to make trends more visible

Seasonalising Data

Finding the line of Best Fit

Finding the moving average

Deseasonalising Data

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A sequence where a common ratio can be found between consecutive terms

Geometric Sequence

Arithmetic Sequence

Downward Trend

Upward Trend

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

An edge is connecting each vertex to all other vertices

Simple

Complete

Connected

Complex

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Explanatory

Association

Causation

Confounding

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The maximum time that an activity can be delayed without delaying the entire project

Critical Path

Float Time

GMT

Time Series

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The co-ordinates of town A are  . The latitude coordinate is

 70°70\degree  

  70°S70\degree S  

 150°150\degree  

  150°E150\degree E  

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Perth is GMT +8 while Cape Town is GMT +1. When it is 11 am in Cape Town, what is the time in Perth?

6pm

4pm

4am

8pm

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

15 hours

13 hrs

10 hours

6 hrs

9.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If a graph has a path that includes every vertex exactly once while ending at the initial vertex, it is called

Eulerian

Bipartite

Hamiltonian

Planar

10.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

This network/graph has pairs of vertices are connected by one edge at most

Simple

Complex

Planar

Hamiltonian

Explore all questions with a free account

or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?