===== PAGE 1 ===== # STARK STATE COLLEGE GENERAL SYLLABUS ## Course Information Course Name: Discrete Mathematics Course Number: MTH214 ## Required Materials Textbook(s): Free online textbook: https://discrete.openmathbooks.org/dmoi4/frontmatter.html Required Readings: None Additional Materials: None ## Course Outline/Calendar The date of coverage and order of coverage may be modified based on the faculty member and events beyond the control of faculty members that interfere with class times and teaching. ## 16 Week Calendar

Week	Chapter and Content	Course Objectives
1	Chapter 1 – Logic and Proofs1.1 Mathematical Statements• Identify Statements• Translate English Sentences into Statements• Quantifiers1.2.1 Implications• Understanding Truth Tables• Related Statements and Connectives	1.1, 1.2
2	Chapter 1 – Logic and Proofs1.3 Rules of Logic• Truth Tables for Compound Statements• Logical Equivalence• De-morgan Law• Validity of a Quantified Statement	1.3

===== PAGE 2 =====

3	Chapter 1 – Logic and Proofs 1.4 Proofs • Direct Proof Method • Identify Logical Errors and Disprove Statements • Introduction to Mathematical Induction • Other Methods of Proof	1.4
4	Ch. 5: Discrete Structures Revisited 0.2.2 Introduction to sets 5.1 Sets • Relationships between Sets • Operations on Sets • Venn Diagrams	5.1
5	Ch. 5: Discrete Structures Revisited 0.2.3 Introduction to Functions 5.2 Functions • Describing functions • Surjections, Injections and Bijections	5.2
6	Ch. 4: Sequences 0.2.4 Introduction to Sequences 4.1 Describing Sequences • Sequences and Formulas • Partial Sums and Differences 4.2 Rate of Growth • Arithmetic Sequences • Geometric Sequences	4.1, 4.2
7	Ch. 4: Sequences 4.5 Mathematical Induction	4.5
8	Ch. 3: Counting 3.2 Combining outcomes • The Sum and Product Principles • Combining Principles 3.3 Non disjoint outcomes	3.2, 3.3
9	Ch. 3: Counting 3.4 Combinations and Permutations • Counting Sequences • Counting Sets • The Quotient Principle	3.4
10	Ch. 3: Counting 3.6 Combinatorial Proofs • Patterns in Pascal's Triangle • Binomial Theorem	3.6

===== PAGE 3 =====

11	Ch. 3: Counting 3.7 Applications to probability • Computing Probabilities • Probability Rules • Conditional Probability	3.7
12	Ch. 6: Additional Topics 6.2 Introduction to Number Theory	6.2
13	Ch. 2: Graph Theory 0.2.5 Introductions to Relations 0.2.6 Introduction to Graphs 2.1 Problems and Definitions 2.2 Trees 2.4 Euler Trails and Circuits • Conditions for Euler trails • Hamilton Path	2.1, 2.2, 2.4
14	Ch. 2: Graph Theory 2.6 Relations and Graphs • Properties of Relations • Equivalence Relations • Equivalence Classes and Partitions	2.6
15	Review
16	Final Exam