Download SOUTHWESTERN MICHIGAN COLLEGE

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Probability wikipedia , lookup

Transcript
SOUTHWESTERN MICHIGAN COLLEGE
DIVISION OF MATHEMATICS AND SCIENCE
Dowagiac, Michigan
COURSE SYLLABUS
Spring Semester, 2013
COURSE TITLE:
Finite Mathematics
COURSE #: Math 129
SECTION #: 1298
CREDITS/CONTACTS:
Credit Hours 4
Lecture Hours/week 4
INSTRUCTOR:
Jon W. Crouse
Phone: 574-993-3531
E-mail: [email protected]/[email protected]
Office Hours: By Appointment
PREREQUISITE:
Satisfactory completion of Math 105.
COURSE DESCRIPTION: This course provides computer information systems and business curricula with a
survey of set theory, graphing, linear equation systems, matrices, linear programming, permutations and
combinations, and probability with particular attention to applications in the area of business..
CORE CURRICULUM: N/A
DISTRIBUTION
REQUIREMENTS:
TEXTBOOKS:
This course may be used to meet a SMC Natural Science and Mathematics Degree
requirement.
Finite Mathematics for the Managerial, Life, and Social Sciences, Tan, 10th Edition
Additional Resources: a non-graphing scientific calculator is recommended
NOTICE: Information in this syllabus, was to the best knowledge of the instructor, considered correct and complete
when distributed for use at the beginning of the semester. The instructor, however, reserves the right, acting within
the policies and procedures of Southwestern Michigan College, to make changes in course content or instructional
techniques without notice or obligation.
HONESTY POLICY
Cheating or plagiarizing will absolutely not be tolerated at Southwestern Michigan College. Any student found
cheating or plagiarizing material in any manner may be assigned a failing semester/session grade in this course. A
second such incident while at SMC could result in suspension or expulsion from the institution. A student found in
violation of this section of the syllabus will not be allowed to drop this course. Additional detail regarding cheating
and/or plagiarism may be found elsewhere in this syllabus. For more detailed information, consult the SMC Student
Code of Conduct.
CIVILITY POLICY
Students are expected to assist in maintaining a classroom environment that is conducive to learning. In
order to assure that all students have the opportunity to gain from time spent in class, students are prohibited
from engaging in any form of distraction. Inappropriate behavior in the classroom shall result, minimally, in
a request to leave class.
1
METHOD OF INSTRUCTION: Lecture and selected problems throughout the course.
EVALUATION:
Evaluation will consist of 7 exams, a final exam, quizzes, and homework
EVALUATION METHOD:
Homework
Quizzes
Hour Exams
Final Exam
10%
10%
60%
20%
GRADING SCALE:
100% - 93%
92% - 90%
89% - 87%
86% - 83%
82% - 80%
79% - 77%
76% - 73%
72% - 70%
69% - 67%
66% - 63%
62% - 60%
59% or lower
A
AB+
B
BC+
C
CD+
D
DF
ATTENDANCE POLICY:
Attendance is required at all class sessions unless an emergency or an SMC
approved event arises. It is the responsibility of the student to notify the
instructor in advance when an absence is unavoidable.
TESTING POLICY:
One make-up exam will be given. In the event a student misses class the day of
a test, one will be placed in the testing center and it must be completed by the
student within six days of the original test date. If the student does not complete
the test in the allotted timeframe, a zero will be awarded as the grade, and no
other make-up exams will be allowed. The lowest exam grade will be dropped.
If you receive a zero for an exam, then that is the one that will be dropped.
There are no make-up quizzes, and no make-up is allowed for the final exam.
TECHNOLOGY IN THE CLASSROOM:
While technology is a wonderful thing, during the class period, its use shall be strictly regulated. The use of cell
phones, iPods, Black Berries, Palm Pilots, pagers, laptops is strictly prohibited. Phones must either be shut-off or
placed on "vibrate", and put away during class. Placing your cell phone on your desk is prohibited. If you receive a
call during class, DO NOT ANSWER IT!!! If a student answers their cell phone during class, they will asked to
leave the class, and will be marked absent for the day. If there are extenuating circumstances (i.e. family member
having surgery) and the student is expecting an emergency call, please notify me at the beginning of class, and
accommodations will be made.
COURSE OBJECTIVES
1. Students will understand and apply the appropriate formula for set operations including union, intersection,
complement, and set difference when solving problems using sets.
2. Students understand, apply, and interpret Venn diagrams when solving applications involving two or more sets.
3. Students understand, apply, and interpret the outcomes to problems involving the probability and/or mathematical
odds of the occurrence of an event.
4. Students understand apply the appropriate formula for calculating the mean, median, mode, range and standard
deviation when analyzing a set of data.
5. Apply the concept of function and mathematical modeling in business, economics, and management applications.
6. Graph and use linear and polynomial functions in applications.
7. Calculate interest, present and future value, annuities, and amortization tables.
8. Solve and use systems of linear equations and inequalities in two variables in applications.
9. Use Gauss-Jordan elimination to solve linear systems of equations with two or more variables in applications.
10. Understand the concept of matrices and their usage, and perform operations on matrices.
11. Formulate and solve linear programming problems graphically and by using the Simplex Method.
12. Use calculators and computers in learning and doing mathematics.
3
TENTATIVE COURSE SCHEDULE
Week
Chapter
Jan 10
Introduction
Jan 15
1.1-1.5
Jan. 22
2.1 - 2.2
Jan. 29
2.2 - 2.5
Feb. 5
3.1-3.3
Feb. 12
3.4, 4.1
Feb. 19
4.2 , 5.1
Feb. 26
5.2 - 5.4
Mar. 5
Spring Break
Mar. 12
6.1 - 6.3
Mar. 19
6.4, 7.1 - 7.2
Mar. 26
7.2 - 7.3
Apr. 2
7.4, 8.1
Apr. 9
8.2, 9.1
Apr. 16
9.2
Apr. 23
Final Review
4
COURSE OUTLINE
Chapter 1: Straight Lines and Linear Functions
1.1
The Cartesian Coordinate System
1.2
Straight Lines
1.3
Linear Functions and Mathematical Models
1.4
Intersection of Straight Lines
1.5
The Method of Least Squares
Chapter 2: Systems of Linear Equations and Matrices
2.1
Systems of Linear Equations: An Introduction
2.2
Systems of Linear Equations: Unique Solutions
2.4
Matrices
2.5
Multiplication of Matrices
Chapter 3: Linear Programming: A Geometric Approach
3.1
Graphing Systems of Linear Inequalities in Two Variables
3.2
Linear Programming Problems
3.3
Graphical Solution of Linear Programming Problems
3.4
Sensitivity Analysis
Chapter 4: Linear Programming: An Algebraic Approach
4.1
The Simplex Method: Standard Maximization Problems
4.2
The Simplex Method: Standard Minimization Problems
Chapter 5: Mathematics of Finance
5.1
Compound interest
5.2
Annuities
5.3
Amortization
5.4
Arithmetic and Geometric Progressions
Chapter 6: Sets and Counting
6.1
Sets and Set Operations
6.2
The Number of Elements in a Finite Set
6.3
The Multiplication Principle
6.4
Permutations and Combinations
Chapter 7: Probability
7.1
Experiments, Sample Spaces, and Events
7.2
Definition of Probability
7.3
Rules of Probability
7.4
Use of Counting Techniques in Probability
7.5
Conditional Probability and Independent Events
Chapter 8: Probability Distributions and Statistics
8.1
Distributions of Random Variables
8.2
Expected Value
Chapter 9: Markov Chains and Theory of Games
9.1
Markov Chains
9.2
Regular Markov Chains
5