logo-home

Page 2 sur 20 résultats

Trier par

Derniers résumés de Discrete Mathematics with Applications

Lecture 08 - Recursion Lecture 08 - Recursion
  • Lecture 08 - Recursion

  • Notes de cours • 18 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 10 - Intro to Graph Lecture 10 - Intro to Graph
  • Lecture 10 - Intro to Graph

  • Notes de cours • 17 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 02 - Relation Lecture 02 - Relation
  • Lecture 02 - Relation

  • Notes de cours • 43 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus

Est-ce que vous écrivez vous-même des résumés ? Mettez-les ensuite en vente et gagnez de l'argent à chaque achat de vos documents.

Lecture 05 - Predicate Logic Lecture 05 - Predicate Logic
  • Lecture 05 - Predicate Logic

  • Notes de cours • 34 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 17 - Discrete Distribution Lecture 17 - Discrete Distribution
  • Lecture 17 - Discrete Distribution

  • Notes de cours • 29 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 15 - Intro to Probability Lecture 15 - Intro to Probability
  • Lecture 15 - Intro to Probability

  • Notes de cours • 29 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 03 - Function Lecture 03 - Function
  • Lecture 03 - Function

  • Notes de cours • 14 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 07 - Induction Lecture 07 - Induction
  • Lecture 07 - Induction

  • Notes de cours • 15 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus
Lecture 13 - Finite State Automata Lecture 13 - Finite State Automata
  • Lecture 13 - Finite State Automata

  • Notes de cours • 17 pages • 2018
  • The outcome of this course is able to perform basic operations on discrete structures, able to interpret logic and construct proofs, able to interpret various concepts on graphs and employ related algorithms and last but not least, able to apply principles of discrete probability to calculate probabilities and expectations of simple random processes.
    (0)
  • 7,11 €
  • + en savoir plus