CMPE 139 • Final • Logic and Discrete Mathematics
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
🎓 Bilgi Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.
CMPE 139 • Midterm
Logic and Discrete Mathematics
İhsan Altundağ
1599 TL
CMPE 139 • Final
Logic and Discrete Mathematics
İhsan Altundağ
1599 TL
Konular
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
Example 2
Chinese Remainder Theorem
Example 1
Example 2
Example 3
Sample Final Problems I
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Number Theory 6
Number Theory 7
Number Theory 8
Counting
Introduction to Counting
Combination & Permutation: Intuition
Combination
Permutation 1
Permutation 2
Discrete Probability
Axioms of Probability 1
Axioms of Probability 2
Axioms of Probability 3
Axioms of Probability 4
Intuition of Conditional Probability
Conditional Probability 1
Conditional Probability 2
Example 1
Example 2
Total Probability Rule
Discrete Random Variables
Expected Value
Variance
Expected Value and Variance Arithmetic
Sample Exam Problems II
Counting Standard Models 1
Counting Standard Models 2
Counting Standard Models 3
Counting Standard Models 4
Counting Standard Models 5
Counting Standard Models 6
Counting Standard Models 7
Discrete Probability 1
Discrete Probability 2
Discrete Probability 3
Discrete Probability 4
Discrete Probability 5
Discrete Probability 6
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
Example 13
Example 14
Equivalence Relation
Example 15
Example 16
Example 17
Example 18
Example 19
Example 20
Example 21
Example 22
Example 23
Graph Theory Part 1
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
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
Planar Graph
Planar Graph - Euler Formula
Example 11
Corollaries about Planar Graph
Example 12
Sample Final Problems III
Relations 1
Relations 2
Relations 3
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
Graphs 16
Değerlendirmeler
Henüz hiç değerlendirme yok.
Ders İçeriği
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
Example 2
Chinese Remainder Theorem
Example 1
Example 2
Example 3
Sample Final Problems I
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Number Theory 6
Number Theory 7
Number Theory 8
Counting
Introduction to Counting
Combination & Permutation: Intuition
Combination
Permutation 1
Permutation 2
Discrete Probability
Axioms of Probability 1
Axioms of Probability 2
Axioms of Probability 3
Axioms of Probability 4
Intuition of Conditional Probability
Conditional Probability 1
Conditional Probability 2
Example 1
Example 2
Total Probability Rule
Discrete Random Variables
Expected Value
Variance
Expected Value and Variance Arithmetic
Sample Exam Problems II
Counting Standard Models 1
Counting Standard Models 2
Counting Standard Models 3
Counting Standard Models 4
Counting Standard Models 5
Counting Standard Models 6
Counting Standard Models 7
Discrete Probability 1
Discrete Probability 2
Discrete Probability 3
Discrete Probability 4
Discrete Probability 5
Discrete Probability 6
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
Example 13
Example 14
Equivalence Relation
Example 15
Example 16
Example 17
Example 18
Example 19
Example 20
Example 21
Example 22
Example 23
Graph Theory Part 1
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
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
Planar Graph
Planar Graph - Euler Formula
Example 11
Corollaries about Planar Graph
Example 12
Sample Final Problems III
Relations 1
Relations 2
Relations 3
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
Graphs 16
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.