Lectures related to Counting labeled trees

Course Overview: Teaser on Course Contents

Offers an overview of propositional and predicate logic, sets, functions, relations, algorithms, Swiss cities, sorting tables, Covid infections, poker hands, and prime numbers.

Induction and Recursion: Summary

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.