Finite Math Semester One 2021

Front

What is a Hamilton Path?

Back

A Hamilton Path is a path in a graph that visits each vertex exactly once.

Front

How do you evaluate the determinant of a matrix?

Back

To evaluate the determinant of a matrix, use methods such as row reduction, cofactor expansion, or specific formulas for 2x2 and 3x3 matrices.

Front

What is the difference between a simple statement and a compound statement?

Back

A simple statement contains one idea, while a compound statement combines two or more simple statements using logical connectors like 'and' or 'or'.

Front

What does A' represent in set theory?

Back

A' represents the complement of set A, which includes all elements not in A.

Front

How do you find the union of two sets?

Back

The union of two sets A and B, denoted A ∪ B, includes all elements that are in A, in B, or in both.

Front

What is a complete graph?

Back

A complete graph is a graph in which every pair of distinct vertices is connected by a unique edge.

Front

How many edges are in a complete graph with n vertices?

Back

The number of edges in a complete graph with n vertices is given by the formula n(n-1)/2.

Front

What is a circuit in graph theory?

Back

A circuit is a closed path in a graph where no edges are repeated.

Front

How do you determine if a graph has a Hamiltonian circuit?

Back

A graph has a Hamiltonian circuit if there exists a cycle that visits every vertex exactly once and returns to the starting vertex.

Front

What is the principle of inclusion-exclusion in set theory?

Back

The principle of inclusion-exclusion is a formula used to calculate the size of the union of multiple sets by including the sizes of individual sets and excluding the sizes of their intersections.