logo-home

Page 2 out of 20 results

Sort by

Newest Discrete Mathematics with Applications summaries

Lecture 14 - Intro to Combinatory Lecture 14 - Intro to Combinatory
  • Lecture 14 - Intro to Combinatory

  • Class notes • 44 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 04 - Propositional Logic Lecture 04 - Propositional Logic
  • Lecture 04 - Propositional Logic

  • Class notes • 34 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 18 - Normal Distribution Lecture 18 - Normal Distribution
  • Lecture 18 - Normal Distribution

  • Class notes • 26 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more

Do you also write study notes yourself? Put them up for sale and earn every time your document is purchased.

Lecture 01 - Set Theory Lecture 01 - Set Theory
  • Lecture 01 - Set Theory

  • Class notes • 24 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 07 - Induction Lecture 07 - Induction
  • Lecture 07 - Induction

  • Class notes • 15 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 09 - Intro to Complexity of An Algorithm Lecture 09 - Intro to Complexity of An Algorithm
  • Lecture 09 - Intro to Complexity of An Algorithm

  • Class notes • 21 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 12 - Tree Lecture 12 - Tree
  • Lecture 12 - Tree

  • Class notes • 21 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 08 - Recursion Lecture 08 - Recursion
  • Lecture 08 - Recursion

  • Class notes • 18 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more
Lecture 03 - Function Lecture 03 - Function
  • Lecture 03 - Function

  • Class notes • 14 pages • 2018
  • Available in package deal
  • 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.49
  • + learn more