MATH 204 • Midterm II • Discrete Mathematics
“İhsan Altundağ Allah senden razı olsun”
Tuna Koseoglu
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.
Sınava 6 gün kaldı.
Eğitmen
İ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.
Paketi Tamamla
🎓 Sabancı Üniversitesi öğrencilerinin %92'si tüm paketi alarak çalışıyor.
Konular
Algorithms and Growth of Functions
Big-O Notation
Example 1
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
Sample Midterm Problems I
Growth of Functions 1
Growth of Functions 2
Growth of Functions 3
Algorithms 1
Algorithms 2
Number Theory
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 Commun 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
Counting: Part 1
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
Counting: Part 2
Principle Inclusion-Exclusion
Example 1
Example 2
Distributing Objects into Boxes 1
Distributing Objects into Boxes 2
Pigeonhole Principle
Example 1
Example 2
Advanced Counting Techniques: Recurrence Relations
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
Sample Midterm Problems II
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Number Theory 6
Number Theory 7
Number Theory 8
Number Theory 9
Counting 1
Counting 2
Counting 3
Counting 4
Counting 5
Counting 6
Counting 7
Counting 8
Principle Inclusion - Exclusion 1
Principle Inclusion - Exclusion 2
Pigeonhole Principle 1
Pigeonhole Principle 2
Pigeonhole Principle 3
Pigeonhole Principle 4
Pigeonhole Principle 5
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
PAST EXAM QUESTIONS !!!
Algorithms (Spring 2019)
Growth of Functions (Spring 2024)
Growth of Functions & Number Theory (Spring 2025)
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)
Short Mixed Questions 1 (Spring 2025)
Short Mixed Questions 2 (Spring 2025)
Recurrence Relations (Spring 2025)
Değerlendirmeler
Yardımcı gayet işe yarar
Sıkça Sorulan Sorular
Örneğin, Koç Üniversitesi - MATH 101 (Calculus) veya başka bir okulun benzer dersi olsun, paketlerimiz tam da o derse göre tasarlanır. Böylece nokta atışı çalışır, zaman kazanırsın.
Sınava özel videolar —konu anlatımları, çıkmış sorular ve çözümleri, özet notlar—içerir. Sınavda sıkça çıkan soruları hedefler. Eğitmenlerimiz, üniversitenin akademik takvimini takip ederek paketleri sürekli günceller. Böylece, gereksiz detaylarla vakit kaybetmeden başarını artırmaya odaklanabilirsin.
Ders İçeriği
Algorithms and Growth of Functions
Big-O Notation
Example 1
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
Sample Midterm Problems I
Growth of Functions 1
Growth of Functions 2
Growth of Functions 3
Algorithms 1
Algorithms 2
Number Theory
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 Commun 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
Counting: Part 1
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
Counting: Part 2
Principle Inclusion-Exclusion
Example 1
Example 2
Distributing Objects into Boxes 1
Distributing Objects into Boxes 2
Pigeonhole Principle
Example 1
Example 2
Advanced Counting Techniques: Recurrence Relations
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
Sample Midterm Problems II
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Number Theory 6
Number Theory 7
Number Theory 8
Number Theory 9
Counting 1
Counting 2
Counting 3
Counting 4
Counting 5
Counting 6
Counting 7
Counting 8
Principle Inclusion - Exclusion 1
Principle Inclusion - Exclusion 2
Pigeonhole Principle 1
Pigeonhole Principle 2
Pigeonhole Principle 3
Pigeonhole Principle 4
Pigeonhole Principle 5
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
PAST EXAM QUESTIONS !!!
Algorithms (Spring 2019)
Growth of Functions (Spring 2024)
Growth of Functions & Number Theory (Spring 2025)
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)
Short Mixed Questions 1 (Spring 2025)
Short Mixed Questions 2 (Spring 2025)
Recurrence Relations (Spring 2025)
Sınava 6 gün kaldı.