MATH 204 • Final • 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.
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ı Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.
Konular
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
Advanced Counting Techniques: Generating Functions
Generating Functions
Example 1
Example 2
Example 3
Example 4
Example 5
Extended Binomial Theorem
Counting Problems with Generating Functions
Example 6
Example 7
Example 8
Example 9
Example 10
Relations
Definition of Relation
Example 1
Example 2
Example 3
Example 4
Reflexive Relations
Example 5
Example 6
Symmetric Relations
Antisymmetric Relations
Example 7
Transitive Relations
Example 8
Properties of Relations
Example 9
Example 10
Example 11
Example 12
Equivalence Relation
Example 13
Example 14
Example 15
Composition of Relations
Example 16
Example 17
Sample Final Problems I
Generating Functions 1
Generating Functions 2
Generating Functions 3
Generating Functions 4
Generating Functions 5
Generating Functions 6
Generating Functions 7
Generating Functions 8
Generating Functions 9
Generating Functions 10
Generating Functions 11
Generating Functions 12
Generating Functions 13
Generating Functions 14
Generating Functions 15
Generating Functions 16
Properties of Relation 1
Properties of Relation 2
Equivalence Relation 1
Equivalence Relation 2
Equivalence Relation 3
Equivalence Relation 4
Equivalence Relation 5
Equivalence Relation 6
Equivalence Relation - Proof
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
Recurrence Relations 10
Recurrence Relations 11
Recurrence Relations 12
Recurrence Relations 13
Recurrence Relations 14
Recurrence Relations 15
Graph Theory Part 1
Introduction
Example 1
Graph Terminology
Example 2
Handshaking Theorem
Example 3
Example 4
Special Graphs
Example 5
Example 6
Bipartite Graphs
Example 7
Example 8
Complete Bipartite Graph
Matching
Example 9
Subgraph
Example 10
Subgraph Induced
Edge Contraction
Example 11
Complementary Graph
Example 12
Example 13
Example 14
Graph Theory Part 2
Adjacency Matrices - Undirected Graphs
Adjacency Matrices - Directed Graphs
Example 1
Example 2
Incidence Matrices
Example 3
Isomorphism of Graphs
Example 4
Example 5
Example 6
Example 7
Definition of Paths and Circuits
Connected Graphs
Euler Paths and Circuits
Example 8
Hamilton Paths and Circuits
Example 9
Example 10
Sample Final Problems II
Graphs 1
Graphs 2
Graphs 3
Graphs 4
Graphs 5
Graphs 6
Graphs 7
Graphs 8
Graphs 9
Graphs 10
Graphs 11
Graphs 12
Graphs 13
Graphs 14
Graphs 15
Spring 2025 Final Questions
Short Mixed Questions 1
Short Mixed Questions 2
Generating Functions
Recurrence Relations
Graph Theory - Euler Path and Circuit
Graph Theory - Isomorphism
Propositional Logic & Sets - Proof
Relations
Değerlendirmeler
Gayet yeterli
Hoca çok temiz anlatıyor gayet başarılı ve yardımcı
İhsan Altundağ Allah senden razı olsun
Ders İçeriği
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
Advanced Counting Techniques: Generating Functions
Generating Functions
Example 1
Example 2
Example 3
Example 4
Example 5
Extended Binomial Theorem
Counting Problems with Generating Functions
Example 6
Example 7
Example 8
Example 9
Example 10
Relations
Definition of Relation
Example 1
Example 2
Example 3
Example 4
Reflexive Relations
Example 5
Example 6
Symmetric Relations
Antisymmetric Relations
Example 7
Transitive Relations
Example 8
Properties of Relations
Example 9
Example 10
Example 11
Example 12
Equivalence Relation
Example 13
Example 14
Example 15
Composition of Relations
Example 16
Example 17
Sample Final Problems I
Generating Functions 1
Generating Functions 2
Generating Functions 3
Generating Functions 4
Generating Functions 5
Generating Functions 6
Generating Functions 7
Generating Functions 8
Generating Functions 9
Generating Functions 10
Generating Functions 11
Generating Functions 12
Generating Functions 13
Generating Functions 14
Generating Functions 15
Generating Functions 16
Properties of Relation 1
Properties of Relation 2
Equivalence Relation 1
Equivalence Relation 2
Equivalence Relation 3
Equivalence Relation 4
Equivalence Relation 5
Equivalence Relation 6
Equivalence Relation - Proof
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
Recurrence Relations 10
Recurrence Relations 11
Recurrence Relations 12
Recurrence Relations 13
Recurrence Relations 14
Recurrence Relations 15
Graph Theory Part 1
Introduction
Example 1
Graph Terminology
Example 2
Handshaking Theorem
Example 3
Example 4
Special Graphs
Example 5
Example 6
Bipartite Graphs
Example 7
Example 8
Complete Bipartite Graph
Matching
Example 9
Subgraph
Example 10
Subgraph Induced
Edge Contraction
Example 11
Complementary Graph
Example 12
Example 13
Example 14
Graph Theory Part 2
Adjacency Matrices - Undirected Graphs
Adjacency Matrices - Directed Graphs
Example 1
Example 2
Incidence Matrices
Example 3
Isomorphism of Graphs
Example 4
Example 5
Example 6
Example 7
Definition of Paths and Circuits
Connected Graphs
Euler Paths and Circuits
Example 8
Hamilton Paths and Circuits
Example 9
Example 10
Sample Final Problems II
Graphs 1
Graphs 2
Graphs 3
Graphs 4
Graphs 5
Graphs 6
Graphs 7
Graphs 8
Graphs 9
Graphs 10
Graphs 11
Graphs 12
Graphs 13
Graphs 14
Graphs 15
Spring 2025 Final Questions
Short Mixed Questions 1
Short Mixed Questions 2
Generating Functions
Recurrence Relations
Graph Theory - Euler Path and Circuit
Graph Theory - Isomorphism
Propositional Logic & Sets - Proof
Relations
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.