CS-101: Advanced information, computation, communication I

Lectures in this course (220)

Explores nested quantifiers in logic and their translation into natural language and mathematical statements.

Explores translating natural language to propositional logic, Boolean search, logic puzzles, circuits, and Sudoku.

Addresses organizational questions related to course materials, exercise solutions, and student participation.

Covers the concept of logical equivalence in proofs and inference rules.

Explores equivalence relations, functions, subsets, and De Morgan's laws.

Introduces equivalence relations, partitions, partial orderings, and total ordering concepts with examples and definitions.

Analyzes a quiz on logical reasoning, discussing correct and incorrect answers.

Explores advanced probabilities, random variables, and expected values, with practical examples and quizzes to reinforce learning.

Analyzes a quiz on proof techniques, emphasizing the importance of showing existence and uniqueness in mathematical proofs.

Covers topics on relations, sequences, and summations, including lattices, recurrence relations, and sigma notation.

Covers the concepts of contraposition and contradiction in proofs.

Covers strings, countable sets, cardinality, and the concept of countability, exploring the countability of various sets and Cantor diagonalization.

Explains variables, predicates, propositional functions, and quantifiers in predicate logic.

Explains how premises imply conclusions using inference rules and truth tables in propositional logic.

Covers inference rules in propositional logic and common logical fallacies.

Introduces posets, Hasse diagrams, and equivalence relations on sets.

Explores optimization problems and greedy algorithms to find the best solutions efficiently.

Covers rules of inference for quantified statements and demonstrates constructing valid arguments using predicate logic.

Introduces informal proofs, explores practical applications, and explains theorem proofs using direct and indirect methods.

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Page 4 of 11