MATH 2103 • Midterm IIDiscrete 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.

1299 TL

433 TL a month, 3 instalments at no extra cost

34 past exam questions with solutions
69 topic lessons · 8 h 25 min
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

Definition of Divisibility

Free

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 Common Multiple

Example 1

Euclidian Algorithm

Example 1

Bézout Identity

Example 1

Example 2

Example 3

Fermat' Little Theorem

Modular Arithmetic- True False

Modular Arithmetic

Modular Arithmetic

Euclidian Algorithm

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Bezout Theorem

Euclidian Algorithm & Bezout Theorem

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

Example

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

Strong Induction

Strong Induction

Recursion and Induction

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example 1

Identical Objects Example 2

Combination

n choose r

Committee Example

Ball Example

Pigeonhole Principle

Free

Example 1

Example 2

Example 3

Example 4

Example 5

Principle Inclusion Exclusion

Example 1

Example 2

Basics of Counting

Basics of Counting

Basics of Counting

Basics of Counting

Free

Basics of Counting

Basics of Counting

Basics of Counting

Pigeonhole Principle

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Principle Inclusion - Exclusion

Principle Inclusion - Exclusion

Complete the bundle

🎓 92% of Işık Üniversitesi students study with the whole bundle.

Discrete Mathematics

MATH 2103 • Midterm I

Discrete Mathematics

1099 TL1299 TL15%
Discrete Mathematics

MATH 2103 • Final

Discrete Mathematics

1099 TL1299 TL15%
Discrete Mathematics

MATH 2103 • Midterm II

Discrete Mathematics

1099 TL1299 TL15%
598 TL off
Total:3897 TL3299 TL

Frequently asked questions about MATH 2103 Midterm II

Frequently asked questions about Unicourse

Pass guarantee

1299 TL