AbhiJosy

Provides discrete structures notes on series, sequences (arithmetic, geometric, quadratic) and partial sums (arithmetic, geometric) with examples.

Provides discrete structures notes for probability including distributions such as Bayes rule, Poisson distribution, binomial distribution, and Bernoulli distribution. Also covers terminology related to probability used in class

Provides discrete structures notes on Pigeonhole Principle along with Permutations and Combinations

Provides discrete structures notes on graphs including rooted trees, weighted graphs, forest, subgraphs, directed graphs, and numerous terms and definitions related to graphs

Provides notes for function growth in discrete structures

Covers all the notes up until the first discrete structures exam (approximately 2 months worth of notes compiled) and covers concepts from permutations, principle of inclusion-exclusion, pigeonhole principle, binary and hexadecimal addition/multiplication, partitions, combinations, circuits, conditionals, and sets.

This document covers discrete structures search and sorting algorithms including binary search, merge sort, as well as other concepts such as recursion, logarithm rules, and runtimes with examples.