Discrete mathematics in plain view

Logic

 * Overview ([[Media:DM1.Logic.1A.Intro.20180312.pdf |A.pdf]])
 * Connectives ([[Media:DM1.Logic.2A.Connective.20180312.pdf |A.pdf]])
 * Propositional Logic ([[Media:DM1.Logic.3A.Proposition.20180514.pdf |A.pdf]])
 * First Order Logic ([[Media:DM1.Logic.4A.FOLogic.20185015.pdf |A.pdf]])
 * Truth Table in C ([[Media:DM1.Logic.5A.TTable.20180312.pdf |A.pdf]])
 * Implications ([[Media:DM1.Logic.6A.Implication.20180317.pdf |A.pdf]])
 * Resolution ([[Media:DM1.Logic.7A.Resolution.20180421.pdf |A.pdf]])
 * Boolean Algebra
 * - Overview ([[Media:DM1.Logic.8A.BOverview.20180330.pdf |A.pdf]])
 * - Functions ([[Media:DM1.Logic.8B.BFunction.20180330.pdf |A.pdf]])
 * - K-Map ([[Media:DM1.Logic.8C.KMap.20180322.pdf |A.pdf]])


 * Normal Form ([[Media:DM1.Logic.9A.NormalForm.20180712.pdf |A.pdf]])


 * Logic Old Note ([[Media:Logic.H.1.20170403.pdf |H1.pdf]])


 * Logic in Haskell ([[Media:Logic.20180915.pdf |pdf]])


 * MIT OCW

Set theory

 * Set Operations ([[Media:DM1.Set.1A.Operation.20180323.pdf |A.pdf]])
 * Cardinality ([[Media:DM1.Set.2A.Cardinality.20180323.pdf |A.pdf]])


 * Sets in Haskell ([[Media:Set.20181215.pdf |pdf]])

Functions and Relations

 * Functions ([[Media:DM4.Func.1A.Function.20180413.pdf |A.pdf]])
 * Matrix ([[Media:DM4.Func.2A.Matrix.20180322.pdf |A.pdf]])
 * Relations ([[Media:DM4.Func.3A.Relation.20180414.pdf |A.pdf]])
 * Equivalent Relations ([[Media:DM4.Func.4A.EQRelation.20180414.pdf |A.pdf]])
 * Partial Order Relations ([[Media:DM4.Func.4A.PORelation.20180414.pdf |A.pdf]])


 * Relation Note ([[Media:Relation.H.1.20170509.pdf |H1.pdf]])


 * Functions in Haskell ([[Media:Function.20181008.pdf |pdf]])
 * Relations in Haskell ([[Media:Relation.20171225.pdf |pdf]])

Algorithms

 * Algorithms
 * - Overview ([[Media:DM5.Alg.1A.Overview.20180329.pdf |A.pdf]])
 * - Bubble Sort ([[Media:DM5.Alg.1B.Bubble.20180405.pdf |B.pdf]])
 * - Insertion Sort ([[Media:DM5.Alg.1C.Insert.20180413.pdf |C.pdf]])
 * - Binary Search ([[Media:DM5.Alg.1D.Search.20180413.pdf |D.pdf]])


 * The Growth of Functions ([[Media:DM5.Alg.2A.GrowthFunc.20180410.pdf |A.pdf]])
 * The Complexity of Algorithms ([[Media:DM5.Alg.3A.Complexity.20180414.pdf |A.pdf]])


 * [ [[Media:DS.BinarySearch.20170411.pdf |Binary Search]] ]
 * [ [[Media:DS.BubbleSort.20170411.pdf |Bubble Sort]] ]
 * [ [[Media:DS.InsertSort.20170411.pdf |Insertion Sort]] ]

Induction and Recursion

 * [ [[Media:C03.Func4.Recursion.1.A.20161214.pdf |C Recursion Functions ]] ]


 * Induction and Recursion in Haskell ([[Media:IndRecursion.20181013.pdf |pdf]])

Number theory

 * [ [[Media:DD1.1.A.BinaryNum.20130918.pdf |Binary Numbers]] ]
 * [ [[Media:DD1.2.A.HexaNum.20130918.pdf |Hexadecimal Numbers]] ]
 * Number Theory ([[Media:DM.8.A.Numbers.20170621.pdf |A.pdf]])


 * Number Theory in Haskell

Combinatorics

 * Counting ([[Media:DM.9.A.Counting.20170525-2.pdf |A.pdf]])

Probability

 * Probability ([[Media:DM.10.A.Probability.20170612.pdf |A.pdf]])
 * Bayes' Theorem ([[Media:DM.10.B.Bayes.20170603.pdf |B.pdf]])
 * Monte Carlo Algorithms ([[Media:DM.10.C.MonteCarlo.20170531-2.pdf |C.pdf]])
 * Expected Value ([[Media:DM.10.D.Expect.20170612.pdf |D.pdf]])

Graphs

 * Graph Overview ([[Media:DM10.Graph.1A.Overview.20180511.pdf |A.pdf]], [[Media:Graph.H1.20150615.pdf |H1.pdf]])
 * Eulerian Cycles ([[Media:DM10.Graph.2A.Eulerian.20180525.pdf |A.pdf]])
 * Hamiltonian Cycles ([[Media:DM10.Graph.3A.Hamiltonian.20180628.pdf |A.pdf]])
 * Shortest Path Problem ([[Media:DM10.Graph.4A.ShortPath.20180511.pdf |A.pdf]])
 * Minimum Spanning Tree ([[Media:DM10.Graph.5A.MSTree.20180511.pdf |A.pdf]])
 * Graph Search ([[Media:DM10.Graph.6A.Search.20180524.pdf |A.pdf]])
 * Planar Graph ([[Media:DM10.Graph.7A.Planar.20180620.pdf |A.pdf]])
 * Graph Isomorphism ([[Media:DM10.Graph.8A.Isomorphism.20180518.pdf |A.pdf]])
 * Graph Coloring ([[Media:DM10.Graph.9A.Color.20180523.pdf |A.pdf]])


 * Graph Drawing in Latex ([[Media:DM.12.A.GraphTex.20180227.pdf |A.pdf]])
 * Network Analysis using R ([[Media:DM.13.A.iGraph.20180228.pdf |A.pdf]])

Trees

 * Tree Background ([[Media:DM11.Tree.1A.Background.20180608.pdf |pdf]])
 * Tree Traversal ([[Media:DM11.Tree.2A.Traversal.20180618.pdf |pdf]])
 * Binary Search Tree ([[Media:DM11.Tree.3A.BinSearch.20180609.pdf |pdf]])


 * Tree Drawing in Latex ([[Media:DM.14.A.TreeTex.20180228.pdf |A.pdf]])

Automata

 * Finite State Machine ([[Media:DM12.FL.1A.FSM.20180609.pdf |pdf]])
 * Finite State Automata ([[Media:DM12.FL.2A.FSA.20180609.pdf |pdf]])
 * Push Down Automata ([[Media:DM12.FL.2B.PDA.20180628.pdf |pdf]])
 * Turing Machine ([[Media:DM12.FL.2C.Truing.20180609.pdf |pdf]])

Formal Language

 * Regular Language ([[Media:DM12.FL.3A.RGL.20180609.pdf |pdf]])
 * Context Free Language ([[Media:DM12.FL.3B.CFL.20180609.pdf |pdf]])
 * Recursively Enumerable Language Language ([[Media:DM12.FL.3C.REL.20180609.pdf |pdf]])

Note

 * Week 01 ([[Media:DM.Week01.20180310.pdf |H.pdf]], [[Media:DM.Week01.Key.20180320.pdf |K.pdf]], [[Media:HW01.sol.20180404.pdf |P.pdf]])
 * Week 02 ([[Media:DM.Week02.20180319.pdf |H.pdf]], [[Media:DM.Week02.Key.20180320.pdf |K.pdf]], [[Media:HW02.sol.20180410.pdf |P.pdf]])
 * Week 03 ([[Media:DM.Week03.20180330.pdf |H.pdf]], [[Media:DM.Week03.Key.20180320.pdf |K.pdf]], [[Media:HW03.sol.20180417.pdf |P.pdf]])


 * Week 04 ([[Media:DM.Week04.20180330.pdf |H.pdf]], [[Media:DM.Week04.Key.20180417.pdf |K.pdf]], [[Media:HW04.sol.20180418.pdf |P.pdf]])


 * Week 05 ([[Media:DM.Week05.20180406.pdf |H.pdf]], [[Media:DM.Week05.Key.20180417.pdf |K.pdf]], [[Media:HW05.sol.20180419.pdf |P.pdf]])


 * Week 06 ([[Media:DM.Week06.20180406.pdf |H.pdf]], [[Media:DM.Week06.Key.20180000.pdf |K.pdf]], [[Media:HW06.sol.20180512.pdf |P.pdf]])


 * Week 07 ([[Media:DM.Week07.20180413.pdf |H.pdf]], [[Media:DM.Week07.Key.20180417.pdf |K.pdf]], [[Media:quiz.20180702.pdf |P.pdf]])


 * Week 08 ([[Media:DM.Week08.20180611.pdf |H.pdf]], [[Media:DM.Week08.Key.20180612.pdf |K.pdf]], [[Media:midterm.sol.20180702.pdf |P.pdf]])


 * Week 09 ([[Media:DM.Week09.20180611.pdf |H.pdf]], [[Media:DM.Week09.Key.20180612.pdf |K.pdf]], [[Media:HW07.sol.20180521.pdf |P.pdf]])


 * Week 10 ([[Media:DM.Week10.20180611.pdf |H.pdf]], [[Media:DM.Week10.Key.20180612.pdf |K.pdf]], [[Media:HW08.sol.20180526.pdf |P.pdf]])


 * Week 11 ([[Media:DM.Week11.20180512.pdf |H.pdf]], [[Media:DM.Week11.Key.20180612.pdf |K.pdf]], [[Media:HW09.sol.20180604.pdf |P.pdf]])


 * Week 12 ([[Media:DM.Week12.20180519.pdf |H.pdf]], [[Media:DM.Week12.Key.20180612.pdf |K.pdf]], [[Media:HW10.sol.20180605.pdf |P.pdf]])


 * Week 13 ([[Media:DM.Week13.20180526.pdf |H.pdf]], [[Media:DM.Week13.Key.20180612.pdf |K.pdf]], [[Media:HW11.sol.20180606.pdf |P.pdf]])


 * Week 14 ([[Media:DM.Week14.20180602.pdf |H.pdf]], [[Media:DM.Week14.Key.20180612.pdf |K.pdf]], [[Media:HW12.sol.20180611.pdf |P.pdf]])


 * Week 15 ([[Media:DM.Week15.20180609.pdf |H.pdf]], [[Media:DM.Week15.Key.20180612.pdf |K.pdf]], [[Media:final.sol.20180702.pdf |P.pdf]])

go to [ Electrical_%26_Computer_Engineering_Studies ]