SUFFOLK COUNTY COMMUNITY COLLEGE
COLLEGE-WIDE COURSE SYLLABUS
MA36 (MAT121)
I. COURSE TITLE:
Finite Mathematics
II. CATALOG DESCRIPTION 2006-2008:
For students interested in business, social and managerial sciences. Introduction to basic concepts and techniques of those areas in mathematics which deal with finite sets. Topics include linear programming, probability theory, matrix manipulations, Markov Chains, game theory and optimization problems.
A-E-G / 3 cr. hrs.
III. COURSE GOALS:
A. Introduce applied methods of mathematics that are used in business and
management science.
B. This course satisfies the SUNY general education requirement for mathematics.
IV. COURSE OBJECTIVES:
Upon successful completion of this course, students will be able to:
A. perform matrix
manipulations, including:
addition, subtraction, and multiplication (both scalar and matrix);
B. write matrix
inverses;
C. solve matrix
equations, write algebraic equations in matrix form, and switch between algebraic and matrix forms; solve the
matrix equation AX = B by Guassian elimination;
D. solve linear
programming problems by graphing and the simplex algorithm;
E. model stochastic
processes; determine if a transition matrix is regular; calculate and interpret
the equilibrium vector;
F. do the basics of 2-person, zero sum games: including: payoffs, saddle points, dominance, and strategy for 2x2, 2xn, and mx2 games.
V. Topics Outline with Timeline
|
Topics |
Approximate
Time (Including Examinations) |
|
A. Introductory Matrix Theory 1.
arithmetic of
matrices 2.
special
matrices ‑ zero, identity, diagonal, row, column 3. elementary row
operations 4. inverse of a matrix |
2 weeks |
|
B. Systems of Equations 1.
solutions of
matrix equations AX=B (homogeneous, non‑homogeneous
case) 2. Gaussian elimination techniques |
2 ½ weeks |
|
C. Linear Programming 1. solution of a 2‑dimensional
system by graphing 2.
simplex
algorithm |
4 ½ weeks |
|
D. Stochastic Processes 1.
regular Markov
chains 2. equilibrium or steady-state vector |
1 ½ weeks |
|
E. Game Theory 1.
saddle points 2.
dominance 3.
zero sum games 4.
2x2 games 5. 2xm, mx2 games |
1 week |
|
Optional Topics: (If interest and time permit, instructors may introduce any topic that expands on the ideas in the core outline.) |
3 weeks |
|
F. Graph Theory: digraphs, connected
graphs, applications to sociology,
psychology |
|
|
G. Transportation
problem |
|
|
H. Assignment problem |
|
|
I. Absorbing Markov chains |
|
|
J. n x
m games; m, n ³ 3, by simplex algorithm K. Arithmetic,
Geometric Progressions, and Math of Finance L. Additional
Methods for Solving Systems of Equations 1. X = A-1B,
(inverse matrix technique) 2.
Cramer's Rule
and determinants 3.
parametric
equations 4. parametric solutions |
|
|
M. Two and Three
Dimensional Optimization Problems by Slack
Tables N. Counting and Probability 1.
formula for
permutations, combinations 2.
basic
probability rules - and, or events 3.
complements 4.
sample spaces
(counting principles) 5.
probability
distributions of discrete random variable O. Traffic Flow Problems |
|
VI. Evaluation of Student Performance:
To be determined by the instructor
VII. Programs that require this course:
Accounting/AS (recommended)
Business Administration/AS (required)
Information Technology/AAS (recommended)
VIII. Courses that require this course as a prerequisite:
None
IX. Supporting Information:
Mathematics tutoring services, as well as video and computer aids, are provided for all students through the Math Learning Center (Ammerman Campus, Riverhead 235), the Academic Skills Center Annex (Grant Campus, Health, Sports and Education Center 129), and the Academic Skills Center (Eastern Campus, Orient 213).
36RevCollWideCrseSyl