CS-101: Advanced information, computation, communication I

About
Privacy
Disclaimer

Graph Chatbot

Lectures in this course (309)

Relations in Computer Science

Explores the properties of relations in computer science, including equivalence relations and the partition of a set.

Relations and Sequences

Covers relations, sequences, and posets, emphasizing properties like anti-symmetry and transitivity, and introduces arithmetic and geometric progressions.

Untitled

Untitled Log in to Mediaspace to watch this video

Untitled

Untitled Log in to Mediaspace to watch this video

Untitled

Untitled Log in to Mediaspace to watch this video

Propositional Logic: Basic Logical Connectives

Covers propositions, logical connectives, truth tables, and propositional logic language.

Propositional Logic

Covers the importance of Discrete Mathematics for Computer Science and explains the course organization, weekly schedule, exercises, and exams.

Predicate Logic: Quantifiers and Statements

Covers the basics of predicate logic, including quantifiers and statements.

Mathematical Proofs: Induction, Inequalities, Divisibility, Subsets

Covers mathematical proofs by induction, inequalities, divisibility, and subsets.

Strong Induction: Proof Method and Application

Explores strong induction as a proof method and demonstrates its application in proving a theorem about positive integers.

Recursively Defined Functions

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

Page 10 of 16