Online Math Tutor LLC

Discover the Path to Mathematical Mastery 
An Education That Counts

Search
Close this search box.

Mathematical Programming

About This Course

Course Description: Mathematics is the science of numbers, in which patterns are analyzed through logical reasoning and quantitative calculations to comprehend the universe in which we live; thereby, providing us with a means to understand reality and truth.  Discrete mathematics is a branch of mathematics that investigates the underlining structure of mathematics.  In this course, the students will be introduced to various topics, to develop each student’s cognitive abilities.

The primary objective of this course is to help the students to become more proficient in logic and reasoning. We will investigate different logical constructs, as well as investigate both valid and invalid arguments. Students will learn to develop and apply various mathematical proof techniques, such as induction and contradiction. Students will learn how to reason via set theory, and obtain a better understanding of equivalence relations.  Furthermore, students will be able to analyze networks and the efficiency of algorithms.

In this course, we will study various aspects of discrete mathematics. Topics include logic, set theory, mathematical proofs, recurrence relations, and other topics.

Course Information

Course Topics

  • Propositional Logic
  • Truth Tables
  • Logical Equivalence
  • Understanding Quantifiers
  • Rules of Inference
  • Boolean Functions
  • Boolean Arithmetic
  • (Digital) Logic Gates
  • Direct Proofs
  • Indirect Proofs
    • Contradiction, Contrapositive
  • Mathematical Induction
  • Strong Mathematical Induction
  • Proofs by Case
  • Additional Techniques
  • Basics of Counting
  • Cardinality
    • Countable
    • Denumerable
  • The Pigeonhole Principles
  • Permutations and Combinations
  • Binominal Coefficients
  • First-Order Linear Recurrence Relations
  • Higher-Order Linear Recurrence Relations
  • Characteristic Polynomial
  • Generating Functions
  • Graph Structures
  • Euler and Hamilton Paths
  • Planar Graphs
  • Trees, Binary Tree
  • Spanning Trees
  • Minimum Spanning Trees
    • Kruskal’s Algorithm
    • Prim’s Algorithm
    • Dijkstra’s Algorithm
  • Shortest Path

Share this course with a friend.

Previous

Discrete Mathematics

Next

Linear Algebra