SRJC Course Outlines

3/28/2024 5:26:25 AMMATH 9 Course Outline as of Fall 1999

Changed Course
CATALOG INFORMATION

Discipline and Nbr:  MATH 9Title:  FINITE MATH  
Full Title:  Finite Mathematics
Last Reviewed:3/13/2023

UnitsCourse Hours per Week Nbr of WeeksCourse Hours Total
Maximum3.00Lecture Scheduled3.0017.5 max.Lecture Scheduled52.50
Minimum3.00Lab Scheduled06 min.Lab Scheduled0
 Contact DHR0 Contact DHR0
 Contact Total3.00 Contact Total52.50
 
 Non-contact DHR0 Non-contact DHR Total0

 Total Out of Class Hours:  105.00Total Student Learning Hours: 157.50 

Title 5 Category:  AA Degree Applicable
Grading:  Grade or P/NP
Repeatability:  00 - Two Repeats if Grade was D, F, NC, or NP
Also Listed As: 
Formerly: 

Catalog Description:
Untitled document
Sets, matrices, and systems of equations and inequalities, linear programming, combinatorial techniques and probability, mathematics of finance, Markov chains, game theory.

Prerequisites/Corequisites:
Math 155.


Recommended Preparation:

Limits on Enrollment:

Schedule of Classes Information
Description: Untitled document
Sets, matrices, systems of equations and inequalities, linear programming, combinatorial techniques, probability, mathematics of finance, Markov chains, game theory.
(Grade or P/NP)

Prerequisites:Math 155.
Recommended:
Limits on Enrollment:
Transfer Credit:CSU;UC.
Repeatability:00 - Two Repeats if Grade was D, F, NC, or NP

ARTICULATION, MAJOR, and CERTIFICATION INFORMATION

Associate Degree:Effective:Fall 1981
Inactive: 
 Area:B
MC
Communication and Analytical Thinking
Math Competency
 
CSU GE:Transfer Area Effective:Inactive:
 B4Math/Quantitative ReasoningFall 1981
 
IGETC:Transfer Area Effective:Inactive:
 2AMathematical Concepts & Quantitative ReasoningFall 1981
 
CSU Transfer:TransferableEffective:Fall 1981Inactive:
 
UC Transfer:TransferableEffective:Fall 1981Inactive:
 
C-ID:
 CID Descriptor: MATH 130 Finite Mathematics SRJC Equivalent Course(s): MATH9

Certificate/Major Applicable: Not Certificate/Major Applicable



COURSE CONTENT

Outcomes and Objectives:
At the conclusion of this course, the student should be able to:
Untitled document
1.  Define sets, matrix operations.
2.  Apply matrix methods of solving systems of equations, Apply
   permutations and combinations.
3.  Apply the fundamental counting principle, permutations, and
   combinations applied to probability. Expected value, conditional
   probability and Markov chain.
4.  Apply graphical and simplex linear programming methods.
5.  Apply compound interest, annuities, present value, sinking funds,
   amortization formulas.
6.  Apply fundamentals of game theory.

Topics and Scope
Untitled document
1.  Discrete Methods.
    Introduction to sets, matrix operations, matrix methods of solving
    systems of equations, permutations and combinations. Binomial
    Theorem.
2.  Probability.
    The fundamental counting principle, permutations, and combinations
    applied to probability. Expected value, conditional probability
    and Markov chain.
3.  Linear Programming.
    Graphical and simplex methods.
4.  Mathematics of Finance.
    Compound interest, annuities, present value, sinking funds,
    amortization.
5.  Game Theory.
    Introduction to fundamentals of game theory with applications of
    matrices and linear programming.

Assignments:
Untitled document
1.  The student will have daily outside reading, problem set assignments
   from required text(s), or instructor chosen supplementary materials.
2.  Instructional methodology may include, but not limited to: lecture,
   demonstrations, oral recitation, discussion supervised practice,
   independent study, outside project or other assignments.

Methods of Evaluation/Basis of Grade.
Writing: Assessment tools that demonstrate writing skill and/or require students to select, organize and explain ideas in writing.Writing
0 - 0%
None
This is a degree applicable course but assessment tools based on writing are not included because problem solving assessments and skill demonstrations are more appropriate for this course.
Problem solving: Assessment tools, other than exams, that demonstrate competence in computational or non-computational problem solving skills.Problem Solving
25 - 75%
Homework problems, Exams
Skill Demonstrations: All skill-based and physical demonstrations used for assessment purposes including skill performance exams.Skill Demonstrations
20 - 40%
Performance exams
Exams: All forms of formal testing, other than skill performance exams.Exams
5 - 25%
Multiple choice
Other: Includes any assessment tools that do not logically fit into the above categories.Other Category
0 - 15%
PROJECT - ORAL OR WRITTEN


Representative Textbooks and Materials:
Untitled document
Text(s) required of each student will be selected by the department,
a committee of the department, or the responsible instructor from the
books currently available. Choices in the past have included:
FINITE MATHEMATICS, (3rd) by Karl Smith, California: Brooks/Cole,
1996.
FINITE MATHEMATICS,(6th) Lial Miller, Greenwell 1997.

Print PDF