[ { "page": 1, "items": [ { "page": 1, "type": "TITLE", "location": { "l": 211.68, "t": 672.48, "r": 400.08, "b": 628.8 }, "text": "STARK STATE COLLEGE\nGENERAL SYLLABUS", "reading_order": 0, "level": 1 }, { "page": 1, "type": "TITLE", "location": { "l": 33.84, "t": 590.64, "r": 181.68, "b": 574.08 }, "text": "Course Information", "reading_order": 1, "level": 2 }, { "page": 1, "type": "TEXT", "location": { "l": 32.88, "t": 570.72, "r": 262.8, "b": 540.72 }, "text": "Course Name: Discrete Mathematics\nCourse Number: MTH214", "reading_order": 2 }, { "page": 1, "type": "TITLE", "location": { "l": 34.08, "t": 515.04, "r": 179.76, "b": 498.48 }, "text": "Required Materials", "reading_order": 3, "level": 2 }, { "page": 1, "type": "TEXT", "location": { "l": 33.6, "t": 494.88, "r": 544.32, "b": 450.96 }, "text": "Textbook(s): Free online textbook: https://discrete.openmathbooks.org/dmoi4/frontmatter.html\nRequired Readings: None\nAdditional Materials: None", "links": [ { "uri": "https://discrete.openmathbooks.org/dmoi4/frontmatter.html", "dest": null, "action_type": "/URI", "bbox": [ 262.832, 479.736, 544.835, 495.178 ] } ], "reading_order": 4 }, { "page": 1, "type": "TITLE", "location": { "l": 33.36, "t": 408.48, "r": 222, "b": 391.68 }, "text": "Course Outline/Calendar", "reading_order": 5, "level": 2 }, { "page": 1, "type": "TEXT", "location": { "l": 33.12, "t": 388.32, "r": 549.84, "b": 358.8 }, "text": "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.", "reading_order": 6 }, { "page": 1, "type": "TITLE", "location": { "l": 34.32, "t": 344.16, "r": 119.52, "b": 331.68 }, "text": "16 Week Calendar", "reading_order": 7, "level": 3 }, { "page": 1, "type": "TABLE", "location": { "l": 36.96, "t": 331.92, "r": 571.2, "b": 85.2 }, "text": "
WeekChapter and ContentCourse Objectives
1Chapter 1 – Logic and Proofs1.1 Mathematical Statements• Identify Statements• Translate English Sentences into Statements• Quantifiers1.2.1 Implications• Understanding Truth Tables• Related Statements and Connectives1.1, 1.2
2Chapter 1 – Logic and Proofs1.3 Rules of Logic• Truth Tables for Compound Statements• Logical Equivalence• De-morgan Law• Validity of a Quantified Statement1.3
", "rows": [ { "row_index": 0, "location": [ 36.96, 249.68, 571.2, 331.92 ], "cells": [ { "location": [ 36.96, 249.68, 215.04, 331.92 ], "text": "Week", "html_text": "Week", "links": [], "cell_header_index": 0, "rowspan": 1, "colspan": 1, "column_header": true, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 215.04, 249.68, 393.12, 331.92 ], "text": "Chapter and Content", "html_text": "Chapter and Content", "links": [], "cell_header_index": 1, "rowspan": 1, "colspan": 1, "column_header": true, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 393.12, 249.68, 571.2, 331.92 ], "text": "Course Objectives", "html_text": "Course Objectives", "links": [], "cell_header_index": 2, "rowspan": 1, "colspan": 1, "column_header": true, "row_header": false, "placeholder": false, "ref": "#/tables/0" } ], "ref": "#/tables/0" }, { "row_index": 1, "location": [ 36.96, 167.44, 571.2, 249.68 ], "cells": [ { "location": [ 36.96, 167.44, 215.04, 249.68 ], "text": "1", "html_text": "1", "links": [], "cell_header_index": 0, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 215.04, 167.44, 393.12, 249.68 ], "text": "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", "html_text": "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", "links": [], "cell_header_index": 1, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 393.12, 167.44, 571.2, 249.68 ], "text": "1.1, 1.2", "html_text": "1.1, 1.2", "links": [], "cell_header_index": 2, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" } ], "ref": "#/tables/0" }, { "row_index": 2, "location": [ 36.96, 85.2, 571.2, 167.44 ], "cells": [ { "location": [ 36.96, 85.2, 215.04, 167.44 ], "text": "2", "html_text": "2", "links": [], "cell_header_index": 0, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 215.04, 85.2, 393.12, 167.44 ], "text": "Chapter 1 – Logic and Proofs1.3 Rules of Logic• Truth Tables for Compound Statements• Logical Equivalence• De-morgan Law• Validity of a Quantified Statement", "html_text": "Chapter 1 – Logic and Proofs1.3 Rules of Logic• Truth Tables for Compound Statements• Logical Equivalence• De-morgan Law• Validity of a Quantified Statement", "links": [], "cell_header_index": 1, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" }, { "location": [ 393.12, 85.2, 571.2, 167.44 ], "text": "1.3", "html_text": "1.3", "links": [], "cell_header_index": 2, "rowspan": 1, "colspan": 1, "column_header": false, "row_header": false, "placeholder": false, "ref": "#/tables/0" } ], "ref": "#/tables/0" } ], "n_rows": 3, "n_cols": 3, "ref": "#/tables/0", "reading_order": 8 } ] }, { "page": 2, "items": [ { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 757.92, "r": 574.08, "b": 674.94 }, "text": "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", "reading_order": 0 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 674.94, "r": 574.08, "b": 591.96 }, "text": "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", "reading_order": 1 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 591.96, "r": 574.08, "b": 508.98 }, "text": "5 Ch. 5: Discrete Structures Revisited 0.2.3 Introduction to Functions 5.2 Functions • Describing functions • Surjections, Injections and Bijections 5.2", "reading_order": 2 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 508.98, "r": 574.08, "b": 426 }, "text": "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", "reading_order": 3 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 343.02, "r": 574.08, "b": 260.04 }, "text": "8 Ch. 3: Counting 3.2 Combining outcomes • The Sum and Product Principles • Combining Principles 3.3 Non disjoint outcomes 3.2, 3.3", "reading_order": 4 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 260.04, "r": 574.08, "b": 177.06 }, "text": "9 Ch. 3: Counting 3.4 Combinations and Permutations • Counting Sequences • Counting Sets • The Quotient Principle 3.4", "reading_order": 5 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 177.06, "r": 574.08, "b": 94.08 }, "text": "10 Ch. 3: Counting 3.6 Combinatorial Proofs • Patterns in Pascal's Triangle • Binomial Theorem 3.6", "reading_order": 6 }, { "page": 2, "type": "TEXT", "location": { "l": 36.72, "t": 426, "r": 574.08, "b": 343.02 }, "text": "7 Ch. 4: Sequences 4.5 Mathematical Induction 4.5", "reading_order": 7 } ] }, { "page": 3, "items": [ { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 757.44, "r": 573.84, "b": 689.6 }, "text": "11 Ch. 3: Counting 3.7 Applications to probability • Computing Probabilities • Probability Rules • Conditional Probability 3.7", "reading_order": 0 }, { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 689.6, "r": 573.84, "b": 621.76 }, "text": "12 Ch. 6: Additional Topics 6.2 Introduction to Number Theory 6.2", "reading_order": 1 }, { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 621.76, "r": 573.84, "b": 553.92 }, "text": "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", "reading_order": 2 }, { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 553.92, "r": 573.84, "b": 486.08 }, "text": "14 Ch. 2: Graph Theory 2.6 Relations and Graphs • Properties of Relations • Equivalence Relations • Equivalence Classes and Partitions 2.6", "reading_order": 3 }, { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 486.08, "r": 573.84, "b": 418.24 }, "text": "15 Review", "reading_order": 4 }, { "page": 3, "type": "TEXT", "location": { "l": 37.92, "t": 418.24, "r": 573.84, "b": 350.4 }, "text": "16 Final Exam", "reading_order": 5 } ] } ]