MAT 2033 • FinalDiscrete 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.

1999 TL

666 TL a month, 3 instalments at no extra cost

35 students took this course
49 past exam questions with solutions
136 topic lessons · 16 h 37 min
4.9 rating
Access for the whole term

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.

Topics

Course introduction

Big-O Notation

Free

Example 1

Free

Example 2

Example 3

Example 4

Sum Property of Big-O Notation

Multiplication Property of Big-O 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

Ceasar Cipher

Affine Cipher

Example 1

Example 2

Example 3

Example 4

Growth of Functions 1

Free

Growth of Functions 2

Free

Growth of Functions 3

Growth of Functions 4

Free

Growth of Functions 5

Algorithms 1

Free

Algorithms 2

Algorithm and Complexity

Free

Algorithm and Complexity

Free

Number Theory 1

Free

Number Theory 2

Number Theory 3

Number Theory 4

Free

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example 1

Identical Objects Example 2

Identical Objects Example 3

Combination

n choose r

Committee Example 1

Committee Example 2

Ball Example 1

Ball Example 2

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Free

Example 6

Example 7

Free

Binomial Theorem

Example 1

Example 2

Example 3

Pascal Identity

Vandermonde's Identity

Example 1

Combinatorial Proof

Example 1

Counting Standard Models 1

Counting Standard Models 2

Free

Counting Standard Models 3

Counting Standard Models 4

Counting Standard Models 5

Counting Standard Models 6

Counting Standard Models 7

Counting Standard Models & Binomial Coefficients 1

Binomial Identities

Free

Pigeonhole Principle 1

Pigeonhole Principle 2

Pigeonhole Principle 3

Pigeonhole Principle 4

Pigeonhole Principle 5

Free

Pigeonhole Principle 6

Free

Introduction

Homogenous Recurrence Relations

Example 1

Example 2

Example 3

Example 4

Non Homogenous Recurrence Relations

Example 5

Example 6

Creating Recurrence Relations

Example 7

Example 8

Example 9

Definition of Relation

Free

Example 1

Example 2

Example 3

Reflexive Relations

Example 4

Symmetric Relations

Antisymmetric Relations

Example 5

Transitive Relations

Properties of Relations

Example 6

Example 7

Composition of Relations

Inverse and Complementary of a Relation

Matrix Representation of a Relation 1

Matrix Representation of a Relation 2

Example 1

Reflexive Closure

Symmetric Closure

Example 2

Transitive Closure & Connectivity Relation

Equivalence Relation

Example 3

Example 4

Partially Ordered Set

Example 5

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

Complementary Graph

Example 9

Example 10

Example 11

Adjacency Matrices - Undirected Graphs

Adjacency Matrices - Directed Graphs

Example 12

Example 13

Incidence Matrices

Example 14

Recurrence Relations 1

Recurrence Relations 2

Recurrence Relations 3

Recurrence Relations 4

Recurrence Relations 5

Recurrence Relations 6

Recurrence Relations 7

Recurrence Relations 8

Relations 1

Free

Relations 2

Free

Relations 3

Free

Relations 4

Relations 5

Adjacency Matrices

Incidence Matrices

Bipartite Graphs & Euler Circuits

Euler Path, Induced Subgraph & Incidence Matrix

Free

Isomorphism 1

Isomorphism 2

Isomorphism 3

Isomorphism 4

Reviews

4.9

8 student reviews

Only students who have this course can review it.

Zehra Çolak

Bought the course

Bilgisayar Mühendisliği

about 1 month ago

Ünsal Yildiz

Bought the course

Bilgisayar Mühendisliği

about 1 month ago

Merve İnci Safi

Bought the course

İşletme Mühendisliği

about 2 months ago

Mehmet Emin İpekçi

Bought the course

Endüstri Mühendisliği

7 months ago

Akça Bayraktar

Bought the course

Endüstri Mühendisliği & Ekonomi

8 months ago

Dilara Akyıldız

Bought the course

İşletme Mühendisliği

10 months ago

Dora Aldemir

Bought the course

Bilgisayar Mühendisliği

almost 2 years ago

Ali Hamza Şahin

Bought the course

Bilgisayar Mühendisliği

almost 2 years ago

Buy both together

🎓 92% of Bahçeşehir Üniversitesi students study with the whole bundle.

Discrete Mathematics

MAT 2033 • Final

Discrete Mathematics

4.9(8)
1699 TL1999 TL15%
Discrete Mathematics

MAT 2033 • Midterm

Discrete Mathematics

4.9(8)
1699 TL1999 TL15%
599 TL off
Total:3998 TL3399 TL

Frequently asked questions about MAT 2033 Final

Frequently asked questions about Unicourse

1999 TL
35 students took this course