코스 · College
Discrete Mathematics
Logic, proof, induction, relations, counting, recurrences, graphs, automata and complexity: the discrete maths of a first university course.
A complete first university course in discrete mathematics, in the order it is usually taught: propositional and predicate logic and the standard proof techniques; induction in all its forms; sets, relations and functions, including countable and uncountable sets; counting with the product rule, bijections and the pigeonhole principle; recurrence relations and how to solve them; graphs, trees, Euler and Hamilton paths and colouring; Boolean algebra, circuits and finite automata; and finally algorithms, asymptotic analysis, the master theorem, satisfiability and polynomial-time reductions.
It is for anyone comfortable with school algebra who wants to reason precisely about finite and countable structures, and it is the mathematical core of a computer science degree. Each unit ends with a quiz mixing computation, concepts and short proofs; the final exam covers the whole course.
다음에 오는: Algebra
코스에 대해
-
Logic and proof
25 레슨What is Discrete Mathematics?Discrete StructuresDiscrete mathematicsTruth tablesMathematical StatementsStatements and QuantifiersCompound StatementsConstructing Truth TablesTruth Tables for the Conditional and BiconditionalImplicationsEquivalent StatementsDe Morgan’s LawsRules of LogicLogical ArgumentsPredicate logic and quantifiersProofsDirect proof, contrapositive and contradictionProofs about Discrete StructuresChapter SummaryPropositional calculusLogical connectiveTruth tableFirst-order logicQuantifier (logic)Predicate (mathematical logic) -
Induction and sequences
11 레슨 -
Sets, relations and functions
20 레슨SetsRelations: equivalence relations and partial ordersFunctionsFunctions and cardinalityIntroduction to Number TheoryCryptographyCartesian productPower setBinary relationEquivalence relationPartial orderFunction (mathematics)Injective functionSurjective functionBijectionComposite functionInverse functionCardinal numberCountable setUncountable set -
Counting
16 레슨Counting: rules, choices and bijectionsThe pigeonhole principleVoting MethodsFairness in Voting MethodsStandard Divisors, Standard Quotas, and the Apportionment ProblemApportionment MethodsFairness in Apportionment MethodsEnumerative combinatoricsPermutationCombinationBinomial coefficientPascal's trianglePigeonhole principleInclusion–exclusion principleBijective proofDouble counting (proof technique) -
Recursion and recurrence relations
7 레슨 -
Graphs and trees
18 레슨Graphs: degrees, paths and connectivityTrees and spanning treesEuler and Hamilton pathsGraph colouringGraph theoryGraph (discrete mathematics)Degree (graph theory)Path (graph theory)Cycle (graph theory)Connectivity (graph theory)Tree (graph theory)Spanning treeEulerian pathHamiltonian pathBipartite graphPlanar graphGraph coloringAdjacency matrix -
Boolean algebra and automata
7 레슨 -
Algorithms and complexity
15 레슨Algorithms and growth of functionsAlgorithmRate of GrowthBig O notationAsymptotic analysis, recursion trees and the master theoremSorting algorithmComputational complexity theoryDecision problems, satisfiability and reductionsMath and ArtMath and the EnvironmentMath and MedicineMath and MusicMath and SportsComputability theoryHalting problem
마지막 시험
모든 단위에서 질문, 가장 어려운 것들 마지막. 입력 답변은 대수학 시스템에 의해 표시됩니다; 증거와 사진 작업 모델에 의해 읽어; 그럼 사람이 결과가 발표되기 전에 전체 종이를 검토. 통과하고 자신의 링크와 함께 인증서를 얻을. 통과 표시: 70%.
로그인