MATH-105 – CONTEMPORARY MATHEMATICS
YEAR ONE LATEST VERSION 3 QUESTIONS AND
ANSWERS GUARANTEED PASS ALREADY
GRADED A PLUS 2025-2026
1. Which method is used to find the minimum spanning
tree in a network?
A) Brute force method
B) Traveling salesman method
✔️ C) Kruskal’s algorithm
D) Dijkstra’s algorithm
2. In graph theory, what is a Hamiltonian circuit?
A) A circuit that visits each edge exactly once
✔️ B) A circuit that visits each vertex exactly once and
returns to the start
C) A path crossing the minimum edges
D) Path that does not cycle
3. What is the primary difference between an Euler
path and an Euler circuit?
A) Euler path visits each vertex once
, ✔️ B) Euler circuit starts and ends at the same vertex,
visiting each edge once
C) Euler path cannot revisit edges
D) Euler circuit only applies to weighted graphs
4. How is a weighted graph different from an
unweighted graph?
A) Weighted graphs have only vertices
B) Unweighted graphs have no edges
✔️ C) Weighted graphs’ edges have assigned values or
costs
D) Unweighted graphs have directional edges
5. What is the purpose of using graph coloring in
mathematics?
A) To add decorative color
B) Represent graph weights
✔️ C) Assign colors so adjacent vertices differ, used in
scheduling problems
D) Identify bridges
6. Which data arrangement best describes a histogram?
A) List of numbers
, B) Pie chart
✔️ C) Graph showing frequency distribution of data in
intervals
D) Table of averages
7. What is the mode in a data set?
A) Arithmetic mean
✔️ B) Most frequently occurring value
C) Middle value in sorted data
D) Range of data
8. What does the median represent?
A) Most frequent number
✔️ B) Middle value when data is ordered
C) Average of all values
D) Difference between highest and lowest value
9. Which measure represents the average value in a
data set?
✔️ A) Mean
B) Mode
C) Median
YEAR ONE LATEST VERSION 3 QUESTIONS AND
ANSWERS GUARANTEED PASS ALREADY
GRADED A PLUS 2025-2026
1. Which method is used to find the minimum spanning
tree in a network?
A) Brute force method
B) Traveling salesman method
✔️ C) Kruskal’s algorithm
D) Dijkstra’s algorithm
2. In graph theory, what is a Hamiltonian circuit?
A) A circuit that visits each edge exactly once
✔️ B) A circuit that visits each vertex exactly once and
returns to the start
C) A path crossing the minimum edges
D) Path that does not cycle
3. What is the primary difference between an Euler
path and an Euler circuit?
A) Euler path visits each vertex once
, ✔️ B) Euler circuit starts and ends at the same vertex,
visiting each edge once
C) Euler path cannot revisit edges
D) Euler circuit only applies to weighted graphs
4. How is a weighted graph different from an
unweighted graph?
A) Weighted graphs have only vertices
B) Unweighted graphs have no edges
✔️ C) Weighted graphs’ edges have assigned values or
costs
D) Unweighted graphs have directional edges
5. What is the purpose of using graph coloring in
mathematics?
A) To add decorative color
B) Represent graph weights
✔️ C) Assign colors so adjacent vertices differ, used in
scheduling problems
D) Identify bridges
6. Which data arrangement best describes a histogram?
A) List of numbers
, B) Pie chart
✔️ C) Graph showing frequency distribution of data in
intervals
D) Table of averages
7. What is the mode in a data set?
A) Arithmetic mean
✔️ B) Most frequently occurring value
C) Middle value in sorted data
D) Range of data
8. What does the median represent?
A) Most frequent number
✔️ B) Middle value when data is ordered
C) Average of all values
D) Difference between highest and lowest value
9. Which measure represents the average value in a
data set?
✔️ A) Mean
B) Mode
C) Median
