CS-101: Advanced information, computation, communication I

Lectures in this course (220)

Explores set identities as analogues of logical equivalences in propositional logic.

Explores nested quantifiers, order importance, and translation into logic.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Covers the introduction and terminology of functions, including injections, surjections, and bijections.

Covers inverse functions, function composition, partial functions, and graphs of functions.

Explores the history and concepts of Number Theory, including divisibility and congruence relations.

Covers binary relations, functions, composition, and n-ary relations with examples.

Covers binary operations, including addition and multiplication of integers represented in binary form.

Covers countable and uncountable sets, sequences, summation, and Cantor's Diagonalization proof.

Covers binary addition, prime numbers, and the sieve of Eratosthenes in number theory.

Explains how to determine and build valid arguments in propositional logic.

Addresses organizational issues in course management, including query answering and handling unexpected challenges like bot attacks.

Explores binary relations, sequences, and summation, including arithmetic and geometric progressions, recurrence relations, and cardinality of sets.

Introduces greatest common divisor, prime factorization, and the Euclidean Algorithm.

Covers cardinality of sets, poset, equivalence relations, and geometric progressions through a quiz on Kahoot.

Explores the basic principles and applications of counting in computer science and mathematics.

Covers the concepts of combinations and permutations in counting scenarios.

Explores equivalence relations, well-ordered sets, geometric series, and countable sets.

Covers the Binomial Theorem, Pascal's Identity, and Pascal's Triangle in counting.

Explains binary relations, reflexive, symmetric, antisymmetric, and transitive relations on a set.

Page 6 of 11