MATH 204 (Spring 24)Discrete MathematicsMidterm II

Ders Tanıtımı

Definition of Sequence

Arithmetique Sequence

Example 1

Geometric Sequence

Example 1

Sum Notation

Example 1

Big-O Notation

Ücretsiz

Example 1

Ücretsiz

Example 2

Example 3

Example 4

Sum Property of Big-O Notation

Multiplication Property of Big-O Notation

Example 1

Example 2

Big-Omega Notation

Big-Theta Notation

Example 1

Example 2

Linear Search Algorithm

Binary Search Algorithm

Bubble Sort Algorithm

Definition of Divisibility

Ücretsiz

Example 1

Ücretsiz

Example 2

Example 3

Division Algorithm

Definition of Modular Arithmetic

Example 1

Properties of Modular Arithmetic

Example 1

Example 2

Prime Numbers

Example 1

Example 2

Example 3

GCD Greatest Common Divisor

LCM Least Commun Multiple

Example 1

Euclidian Algorithm

Example 1

Bézout Identity

Example 1

Example 2

Example 3

Inverse of a Number in Modular Arithmetic

Primitive Root

Discrete Logarithm

Fermat's Little Theorem

Complexity 1

Ücretsiz

Complexity 2

Complexity 3

Complexity 4

Ücretsiz

Complexity 5

Ücretsiz

Complexity 6

Number Theory 1

Ücretsiz

Number Theory 2

Number Theory 3

Number Theory 4

Ücretsiz

Introduction to Counting

Combination & Permutation: Intuition

Combination

Permutation 1

Permutation 2

Binomial Theorem

Example 1

Example 3

Example 2

Pascal Identity

Vandermonde's Identity

Example 1

Combinatorial Proof

Example 1

Principle Inclusion-Exclusion

Example 1

Example 2

Distributing Objects into Boxes

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7

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

Counting 1

Ücretsiz

Counting 2

Counting 3

Counting 4

Counting 5

Counting 6

Counting 7

Counting 8

Ücretsiz

Counting 9

Counting 10

Ücretsiz

Counting 11

Ücretsiz

Counting 12

Ücretsiz

Counting 13

Counting 14

Counting & Binomial Coefficients 1

Pigeonhole Principle 1

Ücretsiz

Pigeonhole Principle 2

Ücretsiz

Pigeonhole Principle 3

Ücretsiz

Pigeonhole Principle 4

Pigeonhole Principle 5

Recurrence Relations 1

Ücretsiz

Recurrence Relations 2

Ücretsiz

Recurrence Relations 3

Ücretsiz

Recurrence Relations 4

Recurrence Relations 5

Eğitmen

İhsan Altundağİhsan Altundağ
Eğitmen

2007 yılında Galatasaray Üniversitesi Bilgisayar Mühendisliği bölümünden birincilikle mezun olduktan sonra Fransa'da Kriptoloji üzerine Fransa hükümeti tarafından verilen bursla yüksek lisans yaptım. Devamında ikinci kez sınava girerek Boğaziçi Matematik bölümünü de bitirdim. Yaklaşık 15 yıldır üniversite öğrencilerine dersler vermekteyim.

990 TL
Hemen Al