Skip to Main Content

Fall 2011 Math 118

What, When, and Where:

Course Description:

Finite Mathamatics: This course studies the basic elements and applications of finite mathematics. The first half of the class covers the language of set theory, principles of counting and combinatorics, probability theory for equal likely outcomes, elementary stochastic processes, conditional probabilities, and repeated experiments. The concept of a random variable is developed, along with expectation and variance. The second half of the class explores systems of linear equations and matrix algebra, linear programming, and Markov chains. This course considers a broad range of applications in business, the life sciences, and the social sciences.

Text:

Finite Mathematics by Lial, Greenwell, Ritchie (BYU Custom Edition, available at bookstore)

Lectures:

TuTh 9:30-10:45a TNRB 151

Office Hours:

TuTh 5:00-5:50 PM

Grading Scheme:

20% Exam I, Sept 23-Sept 26 (Late day Sept. 27)
20% Exam II, Oct 21-Oct 24 (Late day Oct. 25)
20% Exam III, Nov 18-Nov 21 (Late day Nov. 22)
25% Final Exam
10% Daily Online Homework on MyMathLab
5% Weekly Online Quizzes on MyMathLab (except for exam weeks)

Class Schedule (subject to change):

Aug 30 Set Theory & Applications (Section 1.1 and 1.2)
Sept 01 Introduction to Probability (Section 1.3 and 1.4)
Sept 06 Conditional Probability; Independent Events (Section 1.5)
Sept 08 Bayes' Theorem (Section 1.6)
Sept 13 Permutations (Section 2.1)
Sept 15 Combinations (Section 2.2)
Sept 20 Probability of Equally Likely Outcomes (Section 2.3)

Exam 1: 1.1-1.6, 2.1-2.3 (9 sections) in Testing Center, Sept. 23--Sept. 26 (Late day Sept. 27)

Sept 22 Binomials and Bernoulli Trials (Section 2.4)
Sept 27 Probability Distributions; Expected Values (Section 2.5)
Sept 29 Measures of Central Tendency (Section 3.1 and 3.2)
Oct 04 Normal Distribution (Section 3.3)
Oct 06 Review of Lines (Section 4.1 and 4.2)
Oct 11 Least Squares Line Fitting (Section 4.3)
Oct 13 Echelon Method (Section 5.1)
Oct 18 Gauss-Jordan Method (Section 5.2)

Exam 2: 2.4-2.5, 3.1-3.3, 4.1-4.2, 5.1-5.3 (10 Sections) In Testing Center Oct. 21--Oct. 24
(Late day Oct. 25)

Oct 20 Matrix Algebra (Section 5.3 and 5.4)
Oct 25 Inverses of Matrices (Section 5.5)
Oct 27 Input-Output Methods (Section 5.6)
Nov 01 Solving Linear Programs Graphically (Section 6.1 and 6.2)
Nov 03 Applications of Linear Programming (Section 6.3)
Nov 08 Slack Variables and the Pivot (Section 7.1)
Nov 10 Maximization Problems (Section 7.2)
Nov 15 Duality Principle; Minimization Problems (Section 7.3)

Exam 3: 5.4-5.6, 6.1-6.3, 7.1-7.3 (9 Sections) In Testing Center Nov. 18--Nov. 21
(Late day Nov. 22)

Nov 17 Solving Linear Programing via Computer
Nov 29 Markov Chains (Section 8.1)
Dec 01 Regular Markov Chains (Section 8.2)
Dec 06 Absorbing Markov Chains (Section 8.3)
Dec 08 Review for Final

Final Exam (25% over Chapter 8, 25% each prior exam) In Testing Center