MAT 201 • MidtermDiscrete 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.

1499 TL

499 TL a month, 3 instalments at no extra cost

93 past exam questions with solutions
152 topic lessons · 18 h 40 min
5.0 rating
Access for the whole term

Pass guarantee

Instructor

İ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.

Pass guarantee

We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms

Topics

Course introduction

Introduction

Negation of a Proposition

Compound Propositions

Truth Table 1

Truth Table 2

Tautology

Contradiction

Converse Inverse Contrapositive

Practice Problem 1

Practice Problem 2

Logical Equivalences 1

Logical Equivalences 2

De Morgans' Law

Example 1

Practice Problem 3

Practice Problem 4

Universal Quantifiers

Existential Quantifiers

Truth Value of Propositions with Quantifiers

Example 2

Nested Quantifiers

Example 3

Negation of Nested Quantifiers

Example 4

Translations

Example 5

Example 6

Translation of Statements With Multiple Variables

Valid Argument

Rules of Inferences

Example 1

Example 2

Example 3

Using Rules of Inferences to Build Arguments

Example 4

Rules of Inference with Quantified Statements

Example 1

Example 2

Example 3

Direct Proof

Free

Example 1

Free

Example 2

Free

Example 3

Free

Proof by Contrapositive

Example 4

Proof by Contradiction

Example 5

Proof By Cases

Example 6

Proofs of Equivalence

Example 7

Logic Basics 1

Free

Logic Basics 2

Free

Logic Basics 3

Free

Logic Basics 4

Logic - Quantifiers 1

Free

Logic: Quantifiers 2

Free

Logic: Quantifiers 3

Free

Logic - Quantifiers 4

Free

Logic - Quantifiers 5

Logic - Translation 1

Logic - Translation 2

Free

Logic - Translation 3

Free

Logic - Translation 4

Free

Logic - Translation 5

Rules of Inferences 1

Free

Rules of Inferences 2

Rules of Inferences 3

Free

Direct Proof 1

Free

Direct Proof 2

Free

Proof by Contrapositive 1

Proof by Contrapositive 2

Proof by Contradiction 1

Proof by Contradiction 2

Proof by Contradiction 3

Free

Proof by Contradiction 4

Proof by Contradiction 5

Free

Proof by Cases

Free

Proofs of Equivalence

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

What is an algorithm?

Algorithm and Pseudocode 1

Algorithm and Pseudocode 2

Algorithm and Pseudocode 3

Linear Search Algorithm

Binary Search Algorithm

Bubble Sort Algorithm

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

GCD Greatest Common Divisor

LCM Least Common Multiple

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

Example 4

Growth of Functions

Growth of Functions

Growth of Functions

Growth of Functions

Growth of Functions

Growth of Functions

Algorithms

Algorithms

Algorithms

Algorithms

Algorithms

Algorithms

Algorithm and Complexity

Algorithm and Complexity

Algorithm and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Euclidian Algorithm

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Multiplicative Inverse

Euclidian Algorithm & Multiplicative Inverse

Solving Congruences

Solving Congruences

Solving Congruences

Bezout & Inverse & Solving Congruences

Chinese Remainder Theorem

Chinese Remainder Theorem

Chinese Remainder Theorem

Definition and Notation of a Set

Subset

Example 1

Union and Intersection of Two Sets

Difference of Two Sets

Set Identities

Example 2

Power Set

Example 3

Cartesian Product

Example 4

Proof Example 1

Definition of Function

Example 5

Number of Functions

Injective Functions

Example 6

Example 7

Number of Injective Functions

Surjective Functions

Example 8

Example 9

Bijective Function

Inverse Function

Example 10

Example 11

Definition of Sequence

Arithmetique Sequence

Example 1

Geometric Sequence

Example 1

Sum Notation

Example 1

Sets

Sets Proof

Sets Proof

Sets Proof

Sets Proof

Set Proof

Sets Proof

Functions

Functions

Functions

Functions

Functions

Functions

Functions

Functions

Sets & Functions

Sets & Functions

Functions & Summation

Functions & Sets (3. SORU HARİÇ)

Summation & Function (1. SORU HARİÇ)

Sets & Functions & Summation (4. SORU HARİÇ)

Introduction

Free

Proof of Formulas by Induction

Free

Example 1

Free

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

Introduction

Recursively Defined Functions

Example 1

Recursively Defined Sets

Example 2

Recursively Defined Strings

Example 3

Structural Induction

Example 4

Example 5

Induction for Formulas 1

Free

Induction for Formulas 2

Free

Induction for Formulas 3

Induction for Formulas 4

Free

Induction Proof for Divisibility 1

Free

Induction Proof for Divisibility 2

Induction for Inequalities

Free

Induction with Fibonacci

Free

Recursion and Induction

Recursive Algorithm

Free

Reviews

5

3 student reviews

Only students who have this course can review it.

Defne Lal Atak

Bought the course

Bilgisayar Mühendisliği

15 days ago

Sarp Ozal

Bought the course

Yazılım Mühendisliği

17 days ago

Betül Sıla Safkan

Bought the course

Bilgisayar Mühendisliği

11 months ago

Buy both together

🎓 92% of Türk Hava Kurumu Üniversitesi students study with the whole bundle.

Discrete Mathematics

MAT 201 • Final

Discrete Mathematics

5.0(3)
1249 TL1499 TL17%
Discrete Mathematics

MAT 201 • Midterm

Discrete Mathematics

5.0(3)
1249 TL1499 TL17%
499 TL off
Total:2998 TL2499 TL

Frequently asked questions about MAT 201 Midterm

Frequently asked questions about Unicourse

Pass guarantee

1499 TL