COMP 106 • Midterm • Discrete Mathematics for Computer Science and Engineering
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
🎓 Koç Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.
Konular
Logic Part 1: Basics
Introduction
Negation of a Proposition
Compound Proposition
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 10
Exam like Question 11
Logic Part 2: Quantifiers
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
Translations
Exam like Question 11
Exam like Question 12
Exam like Question 13
Exam like Question 14
Translation of Mathematical Statements
Translation of Statements With Multiple Variables
Exam like Question 15
Exam like Question 16
Exam like Question 17
Exam like Question 18
Exam like Question 19
Exam like Question 20
Sample Midterm Problems I
Logic Basics 1
Logic Basics 2
Logic Basics 3
Logic Basics 4
Logic Basics 5
Logic Basics 6
Quantifiers 1
Quantifiers 2
Quantifiers 3
Quantifiers 4
Quantifiers 5
Translation 1
Translation 2
Translation 3
Translation 4
Proof Techniques: Part 1
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
Proof Techniques: Part 2
Proof by Counterexample
Example 1
Proof By Cases
Example 1
Example 2
Example 3
Proofs of Equivalence
Example 1
Example 2
Algorithms and Pseudocode
What is an algorithm?
Algorithm and Pseudocode 1
Algorithm and Pseudocode 2
Algorithm and Pseudocode 3
Algorithm and Pseudocode 4
Exam Like Question 1
Exam Like Question 2
Complexity - Growth of Functions
Big-O Notation
Example 1
Example 2
Sum Property of Big-O Notation
Multiplication Property of Big-O Notation
Example 1
Example 2
Big-Omega Notation
Big-Theta Notation
Example 1
Sample Midterm Problems II
Proof Techniques 1
Proof Techniques 2
Proof Techniques 3
Complexity 1
Complexity 2
Complexity 3
Complexity 4
Complexity 5
Complexity 6
Algorithms 1
Algorithms 2
Algorithms 3
Algorithms 4
Algorithms 5
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
Primitive Root
Discrete Logarithm
Fermat's Little Theorem
Solving Linear Congruences
Example 1
Example 2
Chinese Remainder Theorem
Example 1
Example 2
Example 3
Example 4
Cryptography
RSA Algorithm
Example 1
Example 2
Example 3
Exam-like Question 1
Exam-like Question 2
Diffie - Hellman Protocol
Example 1
Sample Midterm Problems III
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Cryptography
Mathematical Induction
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
Example 3
Induction Related to Fibonacci
Strong Induction
Recursive Definition and Structural Induction
Introduction
Recursively Defined Functions
Example 1
Recursively Defined Sets
Example 2
Recursively Defined Strings
Example 3
Structural Induction
Example 4
Example 5
Sample Midterm Problems IV
Induction 1
Induction 2
Induction 3
Induction 4
Strong Induction 1
Algortithm & Induction
Old Midterm and Quiz Questions
Logic: Basics
Logic: Quantifiers 1
Logic: Quantifiers 2
Logic: Quantifiers 3
Logic: Quantifiers 4
Proof Techniques
Algorithm and Complexity 1
Algorithm and Complexity 2
Complexity 1
Complexity 2
Complexity 3
Complexity 4
Number Theory 1
Number Theory 2
Number Theory 3
Cryptography 1
Cryptography 2
Induction
Induction
Recursion and Induction
Recursive Algorithm and Complexity
Değerlendirmeler
Ders İçeriği
Logic Part 1: Basics
Introduction
Negation of a Proposition
Compound Proposition
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 10
Exam like Question 11
Logic Part 2: Quantifiers
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
Translations
Exam like Question 11
Exam like Question 12
Exam like Question 13
Exam like Question 14
Translation of Mathematical Statements
Translation of Statements With Multiple Variables
Exam like Question 15
Exam like Question 16
Exam like Question 17
Exam like Question 18
Exam like Question 19
Exam like Question 20
Sample Midterm Problems I
Logic Basics 1
Logic Basics 2
Logic Basics 3
Logic Basics 4
Logic Basics 5
Logic Basics 6
Quantifiers 1
Quantifiers 2
Quantifiers 3
Quantifiers 4
Quantifiers 5
Translation 1
Translation 2
Translation 3
Translation 4
Proof Techniques: Part 1
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
Proof Techniques: Part 2
Proof by Counterexample
Example 1
Proof By Cases
Example 1
Example 2
Example 3
Proofs of Equivalence
Example 1
Example 2
Algorithms and Pseudocode
What is an algorithm?
Algorithm and Pseudocode 1
Algorithm and Pseudocode 2
Algorithm and Pseudocode 3
Algorithm and Pseudocode 4
Exam Like Question 1
Exam Like Question 2
Complexity - Growth of Functions
Big-O Notation
Example 1
Example 2
Sum Property of Big-O Notation
Multiplication Property of Big-O Notation
Example 1
Example 2
Big-Omega Notation
Big-Theta Notation
Example 1
Sample Midterm Problems II
Proof Techniques 1
Proof Techniques 2
Proof Techniques 3
Complexity 1
Complexity 2
Complexity 3
Complexity 4
Complexity 5
Complexity 6
Algorithms 1
Algorithms 2
Algorithms 3
Algorithms 4
Algorithms 5
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
Primitive Root
Discrete Logarithm
Fermat's Little Theorem
Solving Linear Congruences
Example 1
Example 2
Chinese Remainder Theorem
Example 1
Example 2
Example 3
Example 4
Cryptography
RSA Algorithm
Example 1
Example 2
Example 3
Exam-like Question 1
Exam-like Question 2
Diffie - Hellman Protocol
Example 1
Sample Midterm Problems III
Number Theory 1
Number Theory 2
Number Theory 3
Number Theory 4
Number Theory 5
Cryptography
Mathematical Induction
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
Example 3
Induction Related to Fibonacci
Strong Induction
Recursive Definition and Structural Induction
Introduction
Recursively Defined Functions
Example 1
Recursively Defined Sets
Example 2
Recursively Defined Strings
Example 3
Structural Induction
Example 4
Example 5
Sample Midterm Problems IV
Induction 1
Induction 2
Induction 3
Induction 4
Strong Induction 1
Algortithm & Induction
Old Midterm and Quiz Questions
Logic: Basics
Logic: Quantifiers 1
Logic: Quantifiers 2
Logic: Quantifiers 3
Logic: Quantifiers 4
Proof Techniques
Algorithm and Complexity 1
Algorithm and Complexity 2
Complexity 1
Complexity 2
Complexity 3
Complexity 4
Number Theory 1
Number Theory 2
Number Theory 3
Cryptography 1
Cryptography 2
Induction
Induction
Recursion and Induction
Recursive Algorithm and Complexity
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.