MATH 1100 - Everyday Mathematics

Credit Hours: 4.00

Objectives:

1. Identify and model Euler circuit and Euler path problems.
2. Define basic graph terminology.
3. Use Euler’s Theorem to classify which graphs have Euler circuits and paths.
4. Find an Euler circuit on a graph.
5. Eulerize graphs when necessary.
6. Identify and model Hamiltonian circuit and Hamiltonian path problems.
7. Apply Method of Trees to find the optimal Hamiltonian circuit on a complete graph.
8. Use Nearest-Neighbor Algorithm and Sorted-Edges Algorithm to find greedy solutions on a complete graph.
9. Find minimum-cost spanning trees using Kruskal’s algorithm.
10. Resolve scheduling conflicts using the chromatic number and vertex coloring.

Outcome 2: Upon completion of the course, students will be able to construct a chart to display data.

Objectives:

1. Identify sampling methods.
2. Identify experimental methods.
3. Create and interpret a histogram.
4. Create and interpret a stemplot.
5. Create and interpret a boxplot.

Outcome 3: Upon completion of the course, students will be able to calculate measures of central tendency.

Objectives:

1. Find and interpret the shape, center, spread, and outliers of a histogram.
2. Find and interpret the mean and median of a data set.
3. Find and interpret quartiles.
4. Find and interpret the standard deviation and variance from a data set
5. Find and interpret the spread of data of a normal distribution using 68-95-99.7 Rule.

Outcome 4: Upon completion of the course, students will be able to use the least-squares regression line to make a prediction.

Objectives:

1. Create a scatterplot.
2. Make a prediction using a regression line.
3. Find the equation of the least-squares regression line identifying slope, y-intercept, and correlation with a scientific calculator.
4. Interpret the correlation between two variables.

Outcome 5: Upon completion of the course, students will be able to find the probability of an event.

Objectives:

1. Find and interpret the probability of events that are mutually exclusive.
2. Find and interpret the probability of events using complements.
3. Find and interpret the probability of events using counting methods.

Outcome 6: Upon completion of the course, students will be able to determine a winner of a preference schedule.

Objectives:

1. Implement the majority-rule voting system and identify its advantages in a two-candidate voting system.
2. Implement Condorcet’s Method.
3. Implement the plurality, Borda count, sequential pairwise voting, contingent, and instant runoff voting systems for three or more candidates.
4. Manipulate the plurality, Borda count, sequential pairwise voting, contingent and instant runoff voting systems.

Outcome 7: Upon completion of the course, students will be able to use methods of division and apportionment to allocate resources fairly.

Objectives:

1. Apply the adjusted winner procedure for divisible items.
2. Apply the sealed bids method for indivisible items.
3. Explain the basic apportionment problem.
4. Implement the Hamilton Method.

Outcome 8: Upon completion of the course, students will be able to determine if an identification number is valid.

Objectives:

1. Identify the check digit on a traveler’s check, money order, Universal Product Code (UPC), European Article Number (EAN), bank routing number, and International Standard Book Number (ISBN-10 and ISBN-13).
2. Determine the validity of a traveler’s check, money order, UPC, EAN, bank routing number, credit card, ISBN-10, and ISBN-13.
3. Identify the information contained in a UPC bar code.

Outcome 9: Upon completion of the course, students will be able to decipher encrypted messages.

Objectives:

1. Use Caesar cipher to decipher a message.
2. Use Vigenère cipher to decipher a message.
3. Solve a cryptogram by recognizing frequent letters and words.

Outcome 10: Upon completion of the course, students will be able to generate the Fibonacci sequence.

Objectives:

1. Generate the Fibonacci sequence and identify some of its properties.
2. Identify relationships between the Fibonacci sequence and the golden ratio.

Outcome 11: Upon completion of the course, students will be able to calculate interest.

Objectives:

1. Apply simple interest formula to finance problems.
2. Apply compound interest formula to finance problems.

• Communication: The graduate can communicate effectively for the intended purpose and audience.
• Critical Thinking: The graduate can make informed decisions after analyzing information or evidence related to the issue.
• Global Literacy: The graduate can analyze human behavior or experiences through cultural, social, political, or economic perspectives.
• Information Literacy: The graduate can responsibly use information gathered from a variety of formats in order to complete a task.
• Quantitative Reasoning: The graduate can apply quantitative methods or evidence to solve problems or make judgments.
• Scientific Literacy: The graduate can produce or interpret scientific information presented in a variety of formats.

1. Graph Theory
   1. Euler paths and circuits
   2. Euler’s Theorem
   3. Eulerize graphs
   4. Hamiltonian paths and circuits
   5. Use various algorithms to find minimum-cost solutions
      1. Method of Trees
      2. Nearest-Neighbor
      3. Sorted-Edges
   6. Kruskal’s algorithm
   7. Use chromatic number to resolve scheduling conflicts
2. Describing and Interpreting Data
   1. Types of sampling methods
   2. Graphs
      1. Histogram
      2. Stemplot
      3. Boxplot
   3. Measures of center
   4. Measures of variance
3. Linear Regression
   1. Scatterplot
   2. Correlation
   3. Predict using regression line
   4. Least-Squares regression line
4. Probability
   1. Basic probability
   2. Counting
   3. Addition Rule
   4. Multiplication Rule
5. Voting Systems
   1. Majority rule
   2. Condorcet’s Method
   3. Systems for 3 or more candidates
      1. Plurality
      2. Borda count
      3. Sequential pairwise voting
      4. Contingent
      5. Instant runoff
   4. Manipulation of voting system
6. Division and Apportionment
   1. Adjusted winner procedure
   2. Sealed bids method
   3. Apportionment
      1. Basic apportionment problem
      2. Hamilton method
7. Identification Numbers
   1. Check digits
   2. Validity of identification numbers
   3. UPC bar codes
8. Encryption
   1. Caesar cipher
   2. Vigenère cipher
   3. Cryptograms
9. Fibonacci Sequence
   1. Fibonacci sequence
   2. Golden ratio
10. Finance Models
    1. Simple interest
    2. Compound interest