Print Page

Credit hours

3 credits (3 hours per week)

Prerequisites

MATH 0099 with a grade of C or better
Math 1139C: Mathematics for Liberal Arts Students must be taken with  
MATH 0239C: Support for Liberal Arts Math 

Course Description

This course deals with the fundamentals of logic, set theory, probability and statistics.  

Course Objectives

1. Identify methods to represent, organize, and distinguish sets
2. Apply rules of logic to evaluate claims
3. Compute probabilities of an event
4. Distinguish between methods for collecting, presenting, and interpreting data

Learning Outcomes

1. Understand set theory terminology, perform set operations, construct Venn diagrams with two and three sets, and solve application problems
2. Use connectives and negations to convert between symbolic statements and English
3. Construct truth tables for negation, conjunction, disjunction, conditional, and biconditional statements
4. Write equivalent and negated statements using DeMorgan’s Laws and other equivalent forms
5. Determine the validity of symbolic arguments
6. Solve probability problems involving the fundamental counting principle, permutations, and combinations
7. Calculate odds and convert between probability and odds
8. Solve compound probability problems involving unions (or) and intersections (and)
9. Construct frequency distributions, histograms, and frequency polygons
10. Calculate statistical measures including mean, median, mode, midrange, range, and standard deviation
11. Solve problems involving the normal distribution

Course Topics

I. SETS

1. Methods of specifying sets
   
   1. Descriptive notation
   2. Roster notation
2. Set membership and notation
3. Special Sets 
   1. Universal set
   2. Empty Set
4. Cardinality of a set
   
   1. One -to -one correspondence
   2. Finite
   3. Infinite
5. Subsets
   1. Definition and notation
   2. Types
      
      1. Proper
      2. Improper
6. Operations on sets
   1. Union
   2. Intersection
   3. Complement
   4. Difference*
7. Venn diagrams
8. Cartesian product*
9. Applications: voting coalitions

II. Logic

1. Statements
   1. Definition
   2. Examples
2. Quantifiers*
   
   1. Universal
   2. Existential
   3. Truth value of quantified statements
3. Basic connectives
   1. Four types
      1. Conjunction
      2. Disjunction
      3. Conditional
      4. Biconditional
   2. Examples
   3. Combining Connectives
   4. Truth Tables
4. Variants of the conditional
   1. Converse
   2. Inverse
   3. Contrapositive
5. Additional connectives*
6. Uses of truth tables
   1. Identification of tautologies, contradictions, contingencies
   2. Determination of the validity of an argument 
   3. Truth tables and Venn diagrams*
7. Syllogisms using Venn diagrams

III. COUNTING TECHNIQUES

1. Counting Techniques
   1. Multiplicative counting principle
2. Permutations 
   1. Permutation of n objects taken n at a time
   2. Permutations of n objects taken r at a time
   3. Permutations of objects some of which are alike
   4. Circular permutations* 
3. Combinations

IV. Probability

1. Elementary experiments
2. Definitions
   1. Sample space
   2. Random variable
   3. Event 
   4. Probability of an event
3. Simple examples and examples involving permutations and combinations
4. Additive principle of probability
5. Multiplicative principle of probability
6. Mathematical expectation* 

V. STATISTICS 

1. Three measures of central tendency (grouped & ungrouped)
   1. Mean
   2. Median
   3. Mode
2. Measures of dispersion
   1. Range
   2. Variance
   3. Standard deviation
3. Frequency distribution and frequency polygons
4. Percentiles
5. Normal curve
6. Z scores 

VI. NATURE OF COMPUTERS* 

1. History of computers  
2. Uses of computers  
3. Flow charts (incorporate with simple programming) 
4. Programming languages: introduction of programming language (e.g. Basic) 
5. Mathematical applications of a programming language (e.g. Basic) 

*Optional 

Print Page