TEXT: "FINITE MATHEMATICS and its APPLICATIONS".
by Goldstein, Schneider and Siegel
SYLLABUS:
Chapter 5: SETS and COUNTING
Operations on sets
The students have to understand that a "statement" has a
well defined truth value. While sections 12.1 and 12.2
are not part of the syllabus (they are not in
the Hunter edition), the notions of "a
statement", "and" and "and/or" from chapter 12 should be
introduced when "sets", "intersection" and "union" are
introduced. DeMorgan's law, below, should be stated both
in logical and set theoretical terms.
The Inclusion-Exclusion Principle.
Venn diagrams (2 and 3 circle diagrams).
De Morgan's law
Multiplication Principle
Permutations and Combinations
5.7, 5.8 are optional
Exam I
Chapters 6: PROBABILITY
Experiments, and Events.
Calculating Probabilities of Events.
Skip "ODDS".
Conditional Probability and Independence.
Tree Diagrams
Bayes' Theorem (The students are do not have to know the
formulas for Bayes' theorem).
Exam II
Choose from the following. (Note: Chapter 2 is prerequisite for
Chapter 8).
Chapter 7: PROBABILITY AND STATISTICS
Frequency Distributions
Histograms
Mean, Expected values
Bernoulli Trials
Skip 7.6, 7.7
Chapter 2 (2.3, 2.4): MATRICES
Arithmetic Operations on Matrices
The Inverse of a Matrix (limited to 2 x 2)
Chapter 8: MARKOV PROCESSES
The transition matrix
Regular Stochastic Matrices (limited to 2 x 2)
Chapter 13 GRAPHS
Exam III