CMPE 201 • Tüm Sınavlar • Discrete Computational Structures

Introduction

Negation of a Proposition

Compound Propositions

Truth Table 1

Truth Table 2

Tautology

Contradiction

Converse Inverse Contrapositive

Practice Problem 1

Practice Problem 2

Logical Equivalences 1

Logical Equivalences 2

De Morgans' Law

Example 1

Practice Problem 3

Practice Problem 4

Universal Quantifiers

Existential Quantifiers

Truth Value of Propositions with Quantifiers

Example 2

Nested Quantifiers

Example 3

Negation of Nested Quantifiers

Example 4

Translations

Example 5

Example 6

Translation of Statements With Multiple Variables

Valid Argument

Rules of Inferences

Example 1

Example 2

Example 3

Using Rules of Inferences to Build Arguments

Example 4

Direct Proof

Example 1

Example 2

Example 3

Proof by Contrapositive

Example 4

Proof by Contradiction

Example 5

Proof By Cases

Example 6

Proofs of Equivalence

Example 7

Truth Table & Tautology

Logical Equivalences

Logical Equivalences

Logical Equivalences

Tautology

Quantifiers

Quantifiers

Quantifiers

Nested Quantifiers

Nested Quantifiers

Translations

Translations

Translations

Rules of Inferences 1

Rules of Inferences 2

Rules of Inferences 3

Direct Proof 1

Direct Proof 2

Direct Proof 3

Direct Proof 4

Proof by Contrapositive 1

Proof by Contrapositive 2

Proof by Contradiction 1

Proof by Contradiction 2

Proof by Cases

Proofs of Equivalence

Definition and Notation

Subset

Example

Union and Intersection of Two Sets

Difference of Two Sets

Set Identities

Example

Power Set

Example

Cartesian Product

Example 1

Example 2

Proof Example 1

Proof Example 2

Definition of Sequence

Arithmetique Sequence

Example

Geometric Sequence

Example

Sum Notation

Example

Introduction

Proof of Formulas by Induction

Example 1

Example 2

Example 3

Example 4

Proof of Divisibility by Induction

Example 1

Example 2

Proof of Inequality by Induction

Example 1

Example 2

Induction Related to Fibonacci

Strong Induction

Introduction

Recursively Defined Functions

Example 1

Recursively Defined Sets

Example 2

Recursively Defined Strings

Example 3

Structural Induction

Example 4

Example 5

Sets 1

Sets 2

Sets 3

Sets 4 (i ve j ŞIKLARI HARİÇ)

Summation (SADECE 2. SORU)

Summation (SADECE 2. SORU)

Induction for Formulas 1

Induction for Formulas 2

Induction for Formulas 3

Induction for Formulas 4

Induction Proof for Divisibility 1

Induction Proof for Divisibility 2

Induction for Inequalities

Induction with Fibonacci

Recursion and Induction

Recursive Algorithm

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example 1

Identical Objects Example 2

Identical Objects Example 3

Combination

n choose r

Committee Example 1

Committee Example 2

Ball Example 1

Ball Example 2

Binomial Theorem

Example 1

Example 2

Example 3

Pascal Identity

Combinatorial Proof

Example 4

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Counting 1

Counting 2

Counting 3

Counting 4

Counting 5

Counting 6

Counting and Binomial Coefficients

Binomial Coefficient and Identities 1

Binomial Coefficients and Identities 2

Pigeonhole Principle 1

Pigeonhole Principle 2

Pigeonhole Principle 3

Pigeonhole Principle 4

Pigeonhole Principle 5

Pigeonhole Principle 6

Introduction

Homogenous Recurrence Relations

Example 1

Example 2

Example 3

Example 4

Non Homogenous Recurrence Relations

Example5

Example 6

Creating Recurrence Relations

Example 7

Example 8

Example 9

Introduction

Graph Terminology

Handshaking Theorem

Example 1

Special Graphs

Example 2

Bipartite Graphs

Example 3

Example 4

Complete Bipartite Graph

Matching

Subgraph

Example 5

Subgraph Induced

Edge Contraction

Example 6

Complementary Graph

Introduction

Rooted Tree

Terminology for Rooted Trees

Full m-ary Trees

Some Formulas

Recurrence Relations 1

Recurrence Relations 2

Recurrence Relations 3

Recurrence Relations 4

Recurrence Relations 5

Recurrence Relations 6

Recurrence Relations 7

Recurrence Relations 8

Recurrence Relations 9