Page 2 out of 20 results
Sort by
-
Lecture 14 - Intro to Combinatory
- Lecture notes • 44 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 09 - Intro to Complexity of An Algorithm
- Lecture notes • 21 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 08 - Recursion
- Lecture notes • 18 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 04 - Propositional Logic
- Lecture notes • 34 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 12 - Tree
- Lecture notes • 21 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 01 - Set Theory
- Lecture notes • 24 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 03 - Function
- Lecture notes • 14 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 18 - Normal Distribution
- Lecture notes • 26 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 11 - Trail, Path and Circuit
- Lecture notes • 23 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.
-
Lecture 06 - Formal Reasoning
- Lecture notes • 45 pages • 2018
- Available in package deal
-
- £6.09
- + learn more
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.