CS-101: Advanced information, computation, communication I

Lectures in this course (220)

Explores quantifiers with finite domains, uniqueness quantifier, composite statements, variable binding, and validity in logic.

Covers proof techniques like direct, contraposition, and cases with examples.

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Covers organizational aspects, introduces Kahut for quizzes, presents complex examples, and summarizes the main topics.

Covers sets, functions, and relations, including functions' properties and binary relations.

Covers the Big-O notation to analyze algorithm efficiency and provides examples of polynomial and factorial function estimates.

Covers subsets, power sets, and functions through an engaging quiz format.

Explores the complexity of algorithms, including big-O notation and efficiency analysis.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Covers the quiz answers related to sets, functions, and relations.

Covers examples of relation composition, Cartesian product, and injective functions.

Covers logical equivalences, quantifiers, and De Morgan's Laws in predicate logic.

Introduces sets as unordered collections of objects and covers set descriptions, numbers, and important properties.

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Covers set equality, subsets, proper subsets, and Venn diagrams.

Introduces mathematical induction principles and applications, including inequalities, divisibility, subsets, and strong induction.

Explores Fibonacci numbers, rabbit population growth, and recursively defined functions.

Covers power sets, tuples, Cartesian product, truth sets, and set cardinality with illustrative examples.

Covers set operations and their analogies to propositional logic connectives, including the cardinality of set union.

Explores recursion and induction for mathematical proofs through recursive algorithms and functions.

Page 5 of 11