SOUTHWEST COLLEGE –STAFFORD CAMPUS
Department of Mathematics
FINITE MATHEMATICS Course Syllabus
Math 1324, CRN # 81032
SPRING 2014 Mon, Wed: 12:30PM –2:00PM Room: SW Hub
INSTRUCTOR:
Ernest Nwachukwu
CONTACT PHONE #
EMAIL ADDRESS
(713) 718 7770
Office Hour:
Ernest.Nwachukwu@hccs.edu
Mon, Wed: 2:00pm – 3:00pm
Catalog Description: MATH 1324 Finite Mathematics with Applications. A
survey of finite mathematics and its application to problems of business and
the natural and social sciences. Topics include set theory, probability, an
introduction to matrices, linear programming, and an introduction to
statistics. Prerequisite: MATH 1314 or the equivalent. 3 credit (3 lecture).
Prerequisites: A grade of C or better in Math 1314 or the equivalent.
Course Intent: This course is intended for students majoring in liberal arts and
secondary education.
Audience: Students who are enrolled in the business area may take this
course as an elective in order to obtain a broader background in the technique
Math 1324
Student Learning Outcomes
Course Objectives
1.1 Be able to graph systems of linear equations in two
variables.
1.2 Be able to solve systems of linear equations using
Gauss-Jordan elimination.
1.3 Know how to add, subtract, and multiply matrices.
1.4 Be able to find the inverse of a square matrix.
1.5 Be able to graph systems of linear inequalities in
two variables.
1. Solve business / financial problems
by the use of systems of equations,
systems of inequalities, and
matrices.
2. Formulate and solve linear programming
problems by graphing and the Simplex
Method.
3. Analyze information and make
conclusions based on set data.
2.1 Know the graphical method for solving a linear
programming problem.
2.2 Know the simplex method for solving standard
maximization and standard minimization problems.
3.1 Be able to perform the basic set operations.
3.2 Be able to use the multiplication principle of
counting.
3.3 Understand permutations and combinations.
3.4 Be able to use the basic counting techniques.
4.1 Understand conditional probability.
4.2 Be able to use Bayes’ Formula.
4.3 Be able to find expected values.
4.4 Be able to find the standard deviation of a set of
values.
4.5 Be able to find the binomial distribution and the
normal distribution of a set of data.
4. Comprehend, analyze, and synthesize
statistical data in order to make
predictions.
Attendance policy:
Students are expected to attend classes regularly. If some special situation
arises, which calls for your missing classes, then please keep me
informed. If I am not notified and your absences exceed 12.5% of the
number of classes, you will be administratively withdrawn
immediately.
Tardiness (lateness to class) policy:
Every student is expected to be in class on time. If a student is
late on the examination day, the student will not be given extra
time.
Withdrawal policy:
Any student who is contemplating withdrawing from the class is encouraged
to do so on or before the final day for withdrawal . If a student withdraws after
the final day for withdrawal from the class (Nov 2), the student will get “F”.
Home Work policy:
Assignments will given every day but usually will not be collected. For a
student to get the best out of this class, it is very important that the student
2
Math 1324
solves problems in the textbook. If a student fails to do assignments, it is not
likely that the student will pass the examination.
Exam Policy:
Cheating is not allowed in the examination. If a student is caught cheating in
an examination, the student will lose all the marks for that examination.
College policies on cheating will be enforced. These are clearly outlined in the
HCCS Student Handbook.
Make-up policy:
There will be no make-up of any test. An exception to this can be allowed if
there is a case of medical emergency and with a valid proof. There will be no
make-up of the final examination.
Grading policy:
Each of the first four examinations is worth 20%; and the final examination is
worth 40% of the final course grade. The final course grade (call it FCG) will
be calculated using the formula:FCG = Average of the best five grades (final counting double).
Letter grade will be assigned to the FCG.
Grade legend: 90% - 100% - A, 80% - 89% - B, 70% - 79% - C, 60% - 69% - D,
below 60% - F.
Final Examination :
The final examination consists of 33 multiple-choice problems. The problems
cover only the material required in this course.
Americans with Disabilities Act (ADA): Students with Disabilities: Any student
with a documented disability (e.g. physical, learning, psychiatric, vision,
hearing, etc.) who needs to arrange reasonable accommodations must
contact the Disability Services Office at the respective college at the
beginning of each semester.
Textbook: MATHEMATICS WITH APPLICATIONS; 1 0 TH Edition; Lial
& Hungerford.Addison Wesley
APPROXIMATE TIME
TEXT REFERENCE
UNIT I
Review
1/2 hour
Introduction to the course
1/2 hour
2.1 Graphs
1/2 hour
2.2 Straight Lines
1/2 hour
2.4 Linear Inequalities
UNIT II
Systems of Linear Equations
11/2 hours
6.1 Systems of two Linear Equations in Two variables
2 hours
6.2 The Gauss-Jordan Method
11/2 hours
6.3 Applications of Systems of Linear Equations
2 hours
6.4 Basic Matrix Operations
1 hour
6.5 matrix Products and Inverses
1 hour
6.6 Applications of Matrices (Omit Code Theory and Routing)
3
UNIT III
1/2 hour
1/2 hour
11/2 hours
11/2 hours
11/2 hours
11/2 hours
1 hour
Math 1324
Linear Programming
7.1 Graphing Linear Inequalities in Two Variables
7.2 Linear Programming: The Graphical Method
7.3 Applications of Linear Programming
7.4 The Simplex Method: Maximization
7.5 Maximization Applications
7.6 The simplex Method: Duality and Minimization
7.7 The Simplex Method: Nonstandard Problems
UNIT IV
1 hour
1 hour
11/2 hours
11/2 hours
2 hours
1 hour
Sets and Probability
8.1 Sets
8.2 Applications of Venn Diagrams
8.3 Introduction to Probability
8.4 Basic Concepts of Probability
8.5 Conditional Probability and Independent Events
8.6 Bayes’ Formula
UNIT V
11/2 hours
1 hour
11/2 hours
11/2 hours
11/2 hours
UNIT VI
11/2 hours
11/2 hours
11/2 hours
11/2 hours
11/2 hours
Counting, Probability Distributions, and Further Topics in Probability
9.1 Probability Distributions and Expected Value
9.2 The Multiplication Principle, Permutations and Combinations
9.3 Applications of Counting
9.4 Binomial Probability
9.5 Markov Chains (Optional)
Introduction to Statistics
10.1 Frequency Distributions
10.2 Measures of Central Tendency
10.3 Normal Distributions
10.4 Normal Distributions and Box plots
10.5 Normal Approximation to the Binomial Distribution
4