COMP 106 ( Spring 24)Discrete Mathematics for Computer Science and EngineeringMidterm

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.

Ders Tanıtımı

Introduction

Negation of a Proposition

Compound Proposition

Truth Table 1

Truth Table 2

Exam like Question 1

Ücretsiz

Exam like Question 2

Ücretsiz

Tautology

Exam like Question 3

Contradiction

Converse Inverse Contrapositive

Exam like Question 4

Exam-like Question 5

Ücretsiz

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

Ücretsiz

Exam like Question 11

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

Ücretsiz

Exam like Question 7

Exam like Question 8

Ücretsiz

Negation of Nested Quantifiers

Translations

Exam like Question 11

Ücretsiz

Exam like Question 12

Exam like Question 13

Ücretsiz

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

Ücretsiz

Exam like Question 18

Exam like Question 19

Exam like Question 20

Logic Basics 1

Logic Basics 2

Logic Basics 3

Logic Basics 4

Logic Basics 5

Logic Basics 6

Quantifiers 1

Ücretsiz

Quantifiers 2

Ücretsiz

Quantifiers 3

Ücretsiz

Quantifiers 4

Quantifiers 5

Ücretsiz

Translation 1

Ücretsiz

Translation 2

Translation 3

Ücretsiz

Translation 4

Ücretsiz

Direct Proof

Ücretsiz

Exam like Question 1

Ücretsiz

Exam like Question 2

Ücretsiz

Exam like Question 3

Exam-like Question 4

Ücretsiz

Contrapositive Proof

Exam like Question 5

Exam like Question 6

Proof by Contradiction

Exam like Question 7

Exam like Question 8

Exam like Question 9

Exam-like Question 10

Proof by Counterexample

Exam like Question 1

Exam-like Question 2

If and Only if Statements

Exam like Question 3

Exam like Question 4

Exam like Question 5

What is an algorithm?

Ücretsiz

Algorithm and Pseudocode 1

Algorithm and Pseudocode 2

Algorithm and Pseudocode 3

Algorithm and Pseudocode 4

Exam Like Question 1

Ücretsiz

Exam Like Question 2

Ücretsiz

Big-O Notation

Example 1

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

Proof Techniques 1

Ücretsiz

Proof Techniques 2

Proof Techniques 3

Complexity 1

Ücretsiz

Complexity 2

Complexity 3

Complexity 4

Ücretsiz

Complexity 5

Complexity 6

Algorithms 1

Ücretsiz

Algorithms 2

Ücretsiz

Algorithms 3

Ücretsiz

Algorithms 4

Algorithms 5

Introduction

Proof of Formulas by Induction

Example 1

Example 2

Example 3

Example 4

Exam-like Question 1

Exam-like Question 2

Exam-like Question 3

Exam-like Question 4

Proof of Divisibility by Induction

Example 1

Example 2

Exam-like Question 1

Exam-like Question 2

Proof of Inequality by Induction

Example 1

Example 2

Example 3

Exam-like Question 1

Exam-like Question 2

Exam-like Question 3

Induction Related to Fibonacci

Strong Induction

Definition of Divisibility

Ücretsiz

Example 1

Example 2

Example 3

Division Algorithm

Definition of Modular Arithmetic

Example 1

Properties of Modular Arithmetic

Example 1

Example 2

Prime Numbers

Ücretsiz

Example 1

Example 2

Example 3

GCD Greatest Common Divisor

LCM Least Commun Multiple

Example 1

Euclidian Algorithm

Ücretsiz

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

RSA Algorithm

Ücretsiz

Example 1

Example 2

Example 3

Exam-like Question 1

Exam-like Question 2

Diffie - Hellman Protocol

Example 1

Induction 1

Ücretsiz

Induction 2

Ücretsiz

Induction 3

Induction 4

Strong Induction 1

Ücretsiz

Algortithm & Induction

Ücretsiz

Number Theory 1

Number Theory 2

Number Theory 3

Ücretsiz

Number Theory 4

Number Theory 5

Number Theory & Induction

Ücretsiz

Cryptography

Ücretsiz

Eğitmen

İhsan Altundağİ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.

990 TL
Hemen Al