MATH 204 • Midterm IDiscrete Mathematics

“İhsan Altundağ Allah senden razı olsun”

Tuna Koseoglu

Verified

Endüstri Mühendisliği

Bu ders ile hem bir sürü soru çözmüş, hem kendini denemiş, hem de konuların püf noktalarını öğrenmiş olacaksın.

Kolayca yüksek notlar alabilmen için özenle hazırlanmış video derslerlerimizi izle. Çıkma ihtimali yüksek ve çıkmış soruların soru çözümleriyle sınava en iyi şekilde hazırlan. Hızını sen ayarla. İstediğin yerde hızlandırır, dersleri istediğin kadar tekrar et.

2199 TL

733 TL a month, 3 instalments at no extra cost

68 students took this course
104 past exam questions with solutions
135 topic lessons · 15 h 31 min
4.9 rating
Access for the whole term

Instructor

İ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.

Topics

Course introduction

Introduction

Free

Negation of a Proposition

Free

Compound Propositions

Truth Table 1

Free

Truth Table 2

Tautology

Example 1

Contradiction

Converse Inverse Contrapositive

Example 2

Logical Equivalences 1

Logical Equivalences 2

Example 3

Example 4

Example 5

Universal Quantifiers

Existential Quantifiers

Truth Value of Propositions with Quantifiers

Example 1

Example 2

Nested Quantifiers

Example 3

Example 4

Negation of Nested Quantifiers

Example 5

Example 6

Translations - Introduction

Translation: English to Logic

Translation: Logic to English

Translation with Quantifiers 1

Free

Translation with Quantifiers 2

Translation of Mathematical Statements

Example 7

Translation of Statements With Multiple Variables

Example 8

Example 9

Logic Basics 1

Free

Logic Basics 2

Free

Logic Basics 3

Free

Logic Basics 4

Logic - Quantifiers 1

Free

Logic - Quantifiers 2

Free

Logic - Quantifiers 3

Free

Logic - Quantifiers 4

Logic - Quantifiers 5

Logic - Quantifiers 6

Logic - Translation 1

Free

Logic - Translation 2

Logic - Translation 3

Free

Direct Proof

Free

Example 1

Free

Example 2

Free

Example 3

Free

Example 4

Proof by Contrapositive

Example 5

Example 6

Proof by Contradiction

Example 7

Example 8

Proof by Counterexample

Example 9

Proof By Cases

Example 10

Proofs of Equivalence

Example 11

Definition of Sequence

Arithmetique Sequence

Example 1

Geometric Sequence

Example 1

Sum Notation

Example 1

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

Direct Proof 1

Free

Direct Proof 2

Free

Proof by Contrapositive 1

Proof by Contrapositive 2

Proof by Contradiction 1

Proof by Contradiction 2

Proof by Contradiction 3

Free

Proof by Contradiction 4

Proof by Contradiction 5

Free

Proofs of Equivalence 1

Free

Proofs of Equivalence 2

Induction for Formulas 1

Induction for Formulas 2

Induction for Formulas 3

Induction for Formulas 4

Free

Induction for Formulas 5

Induction Proof for Divisibility 1

Free

Induction Proof for Divisibility 2

Direct Proof & Induction 1

Direct Proof & Induction 2

Free

Induction for Inequalities 1

Free

Induction for Inequalities 2

Induction for Inequalities 3

Free

Induction with Fibonacci 1

Induction with Fibonacci 2

Free

Strong Induction

Strong Induction

Free

Definition of Divisibility

Example 1

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 Common Multiple

Example 1

Euclidian Algorithm

Example 1

Bézout Identity

Example 1

Example 2

Example 3

Inverse of a Number in Modular Arithmetic

Fermat's Little Theorem

Solving Linear Congruences

Example 1

Chinese Remainder Theorem

Example 1

Example 2

Example 3

Example 4

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example

Combination

n choose r

Committee Example

Ball Example

Binomial Theorem

Example 1

Example 3

Example 2

Pascal Identity

Vandermonde's Identity

Example 1

Combinatorial Proof

Example 1

Distributing Objects into Boxes 1

Distributing Objects into Boxes 2

Example 1

Example 2

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Number Theory 1

Free

Number Theory 2

Free

Number Theory 3

Free

Number Theory 4

Number Theory 5

Free

Number Theory 6

Number Theory 7

Number Theory 8

Number Theory 9

Counting 1

Counting 2

Free

Counting 3

Free

Counting 4

Counting 5

Counting 6

Free

Counting 7

Principle Inclusion - Exclusion 1

Free

Principle Inclusion - Exclusion 2

Pigeonhole Principle 1

Free

Pigeonhole Principle 2

Free

Pigeonhole Principle 3

Free

Pigeonhole Principle 4

Pigeonhole Principle 5

Propositional Logic (Spring 2025)

Tautology by Truth Table (Fall 2024)

Quantifiers (Spring 2025)

Nested Quantifiers (Fall 2024)

Negation of Nested Quantifiers (Fall 2024)

Translation (Fall 2024)

Translation (Spring 2025)

Direct Proof (Fall 2024)

Proof Techniques and Sets (Spring 2025)

Induction (Spring 2025)

Induction (Fall 2024)

Modular Arithmetic - True False (Spring 2019)

Modular Arithmetic - Proof (Spring 2019)

Modular Arithmetic - Proof (Spring 2024)

Euclidian Algorithm (Spring 2024)

Euclidian Algorithm (Spring 2025)

Number Theory (Fall 2024)

Number Theory (Fall 2024)

Binomial Coefficient (Spring 2024)

Binomial Identities (Spring 2024)

Binomial Identities (Spring 2025)

Counting (Spring 2019)

Counting (Spring 2019)

Counting (Fall 2024)

Counting (Spring 2024)

Counting (Spring 2025)

Counting (Spring 2025)

Counting (Spring 2025)

Pigeonhole Principle (Fall 2024)

Pigeonhole Principle (Spring 2024)

Truth Table

Nested Quantifiers

Nested Quantifiers

Translation

Induction

Euclidian Algorithm & Bezout & Inverse & Congruence

Proof by Contraposition

Direct Proof

Modular Arithmetic - Proof

Counting

Pigeonhole Principle

Reviews

4.9

47 student reviews

Only students who have this course can review it.

Rüveyda Otu

Bought the course

Mühendislik ve Doğa Bilimleri Programları

about 12 hours ago

iyi

İdil İpek Duman

Bought the course

Endüstri Mühendisliği

15 days ago

Cidden işe yarıyor

Rüveyda Otu

Bought the course

Mühendislik ve Doğa Bilimleri Programları

18 days ago

iyi

Emre Pamukcu

Bought the course

Mühendislik ve Doğa Bilimleri Programları

21 days ago

çok iyi

Tuna Şentürk

Bought the course

Sanat ve Sosyal Bilimler Programları

11 months ago

Gayet yeterli

Eren Medetoğlu

Bought the course

Mühendislik ve Doğa Bilimleri Programları

12 months ago

Hoca çok temiz anlatıyor gayet başarılı ve yardımcı

Eren Medetoğlu

Bought the course

Mühendislik ve Doğa Bilimleri Programları

12 months ago

Yardımcı gayet işe yarar

Tuna Koseoglu

Bought the course

Endüstri Mühendisliği

almost 4 years ago

İhsan Altundağ Allah senden razı olsun

Akan Savaş Saltık

Bought the course

Mühendislik ve Doğa Bilimleri Programları

14 days ago

Rıza Deniz Tekcan

Bought the course

Mühendislik ve Doğa Bilimleri Programları

15 days ago

Complete the bundle

🎓 92% of Sabancı Üniversitesi students study with the whole bundle.

Discrete Mathematics

MATH 204 • Midterm II

Discrete Mathematics

4.9(47)
1833 TL2199 TL17%
Discrete Mathematics

MATH 204 • Midterm I

Discrete Mathematics

4.9(47)
1833 TL2199 TL17%
Discrete Mathematics

MATH 204 • Final

Discrete Mathematics

4.9(47)
1833 TL2199 TL17%
1098 TL off
Total:6597 TL5499 TL

Frequently asked questions about MATH 204 Midterm I

Frequently asked questions about Unicourse

2199 TL
68 students took this course