math 1029

In normal distribution, the z-score for the mean is

0

The number of edges that connect to a vertex is called the _______ of the vertex

degree

the difference between the highest and lowest values in a data set is called the

range

measures of dispersion get _______ as the spread of data decreases

smaller

measures of dispersion are used to describe the spread of data items in a data set

true

Every circuit is a path

true because a circuit is a path that begins and ends at the same vertex

When is a z-score negative

when the data item is less than the mean

If there is at least one edge connecting two vertices in a graph, the vertices are called _______. A sequence of such vertices and the edges connecting them is called a _______. If this sequence of vertices and connecting edged begins and ends at the same vertex it is called a ______.

Adjacent Path Circuit

A method that determines the solution to the traveling salesperson problem involves listing all Hamilton circuit and selecting the circuit with the minimum sum of weights. This method is caked the __________ Method

Brute Force

A circuit that travels through every edge of a graph exactly once is called a ______ circuit

Euler

a path that passes through each edge of a graph exactly one time is called a ________ path

Euler

A path that passes through each vetted of a graph exactly once is called a ______ path. Such a path begins and ends at the same vertex and passes through all other vertices exactly once is called a _______.

Hamilton Hamilton

A procedure that yields the minimum spanning tree of a graph is called a ____ Algorithm. The idea of the algorithm is to always pick the edge with the smallest available ________, but avoid creating any _______.

Kruskal's weight circuits

A method that approximated the solution to the salesperson problem is called the __________ Method. This method involves continually choosing an edge with the smallest _______.

Nearest Neighbor weight

If an edge is removed from a connected graph and leaves behind a disconnected graph such an edge is called a _________.

bridge

The mean, median, and mode of a normal distribution are

egual

Two graphs that have the same number of vertices connected to each other in the same way are called

equivalent

Every path is a circuit

false not every path ends at the same vertex where it starts

A finite set of points connected by line segments or curves is called _____. The points are called ______. The line segments or curves are called ________. Such a line segment or curve that starts and ends at the same point is called a _________.

graph vertices edges loop

A z-score describes how many standard deviations a data item in a normal distribution lies above or below the ________

mean

A score in the 50th percentile on a standardized test is the

median

What is a symmetric histogram?

moving out from the mean value, the heights of the bars are the same to the left and right

A connected graph has atleast one Euler circuit, which by definition, is also a Euler path, if the graph has ______ odd vertices. An Euler circuit can start and end at ______ vertex.

no any

A connected graph has no Euler paths and no euler circuits if the graph has more than two ______ vertices

odd

If the n% of the items in a distribution are less than a particular data item, we say that the data item is in the nth ___________ of the distribution

percentile

A tree that is created from another connected graph and that contains all of the connected graph's vertices, is connected, and contains no circuits is called a ______ tree.

spanning

What does a z-score measure?

the number of standard deviations above or below the mean of a specified data item

A graph that is connected and has no circuits is called a _______. For such graph, every edge is a/an _______, and if there are n vertices there must be ________ edges

tree bridge n-1

An edge can be part of a path only once

true because a path is a sequence of adjacent vertices snd the edges connecting them

A connected graph has at least one Euler path, but no Euler circuit, if the graph has exactly _____ odd vertices/vertex.

two

A graph whose edges have numbers attached to them is called a ______ graph. The numbers shown along the edges of such graphs is called the _____ of the edges. The sum of the minimum is called the ______ salesperson problem. Such Hamilton circuit is called the ______ solution.

weighted weights traveling optimal

the sum of deviations from the mean for the data set is always

zero