CMPE 251 • Tüm Sınavlar • Discrete Computational Structures
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.
Ayda 999 TL, peşin fiyatına 3 taksit
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.
Konular
Logic Part 1: Basics
10 konu anlatımı · 8 soru
Introduction
Negation of a Proposition
Compound Propositions
Truth Table 1
Truth Table 2
Exam like Question 1
Exam like Question 2
Tautology
Exam like Question 3
Contradiction
Converse Inverse Contrapositive
Exam like Question 4
Exam-like Question 5
Logical Equivalences & De Morgan's Laws
Logical Equivalences & De Morgan's Laws 2
Exam like Question 6
Exam like Question 7
Exam like Question 8
Logic Part 2: Quantifiers
7 konu anlatımı · 14 soru
Universal Quantifiers
Existential Quantifiers
Truth Value of Propositions with Quantifiers
Exam like Question 1
Exam like Question 2
Exam like Question 3
Exam like Question 4
Nested Quantifiers
Exam like Question 5
Exam like Question 6
Exam like Question 7
Exam like Question 8
Negation of Nested Quantifiers
Exam like Question 9
Exam like Question 10
Translation of Mathematical Statements
Translation of Statements With Multiple Variables
Exam like Question 11
Exam like Question 12
Exam like Question 13
Exam like Question 14
Rules of Inferences
7 konu anlatımı
Valid Argument
Rules of Inferences
Example 1
Example 2
Example 3
Using Rules of Inferences to Build Arguments
Example 4
Sample Midterm Problems I
17 soru
Logic Basics 1
Logic Basics 2
Logic Basics 3
Logic Basics 4
Logic - Quantifiers 1
Logic - Quantifiers 2
Logic - Quantifiers 3
Logic - Quantifiers 4
Logic - Quantifiers 5
Logic - Translation 1
Logic - Translation 2
Logic - Translation 3
Logic - Translation 4
Logic - Translation 5
Rules of Inferences 1
Rules of Inferences 2
Rules of Inferences 3
Introduction to Proofs
12 konu anlatımı
Direct Proof
Example 1
Example 2
Example 3
Example 4
Proof by Contrapositive
Example 1
Example 2
Example 3
Proof by Contradiction
Example 1
Example 2
Functions
16 konu anlatımı
Definition of Function
Example 1
Number of Functions
Injective Functions
Example 2
Example 3
Example 4
Number of Injective Functions
Surjective Functions
Example 5
Example 6
Example 7
Bijective Function
Inverse Function
Example 8
Example 9
Sample Midterm Problems II
13 soru
Direct Proof 1
Direct Proof 2
Proof by Contrapositive 1
Proof by Contrapositive 2
Proof by Contradiction 1
Proof by Contradiction 2
Proof by Contradiction 3
Proof by Contradiction 4
Proof by Contradiction 5
Functions 1
Functions 2
Functions 3
Functions 4
Algorithms and Growth of Functions
16 konu anlatımı
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 II
11 soru
Growth of Functions 1
Growth of Functions 2
Growth of Functions 3
Growth of Functions 4
Growth of Functions 5
Growth of Functions 6
Algorithms 1
Algorithms 2
Algorithms 3
Algorithms 4
Algorithms 5
Mathematical Induction
14 konu anlatımı
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
Sample Final Problems I
14 soru
Induction for Formulas 1
Induction for Formulas 2
Induction Proof for Divisibility 1
Induction Proof for Divisibility 2
Induction for Inequalities 1
Induction for Inequalities 2
Induction for Inequalities 3
Induction for Inequalities 4
Induction with Fibonacci 1
Induction with Fibonacci 2
Induction with Fibonacci 3
Induction with Fibonacci 4
Strong Induction 1
Strong Induction 2
Graph Theory Part 1
25 konu anlatımı
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
18 konu anlatımı
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
16 soru
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