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

1499 TL

499 TL a month, 3 instalments at no extra cost

64 past exam questions with solutions
131 topic lessons · 16 h 36 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

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

Binomial Theorem

Example 1

Example 2

Pascal Identity

Combinatorial Proof

Example 3

Pigeonhole Principle

Free

Example 1

Example 2

Example 3

Example 4

Example 5

Principle Inclusion Exclusion

Example 1

Example 2

Distributing Objects into Boxes 1

Free

Distributing Objects into Boxes 2

Free

Example 1

Example 2

Counting Standard Models

Counting Standard Models

Counting Standard Models

Counting Standard Models

Free

Counting Standard Models

Counting Standard Models

Counting Standard Models

Counting Standard Models & Binomial Coefficients

Binomial Coefficient

Binomial Identities

Binomial Identities - Combinatorial Proof

Pigeonhole Principle

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Pigeonhole Principle

Free

Principle Inclusion - Exclusion

Principle Inclusion - Exclusion

Counting & Principle Inclusion - Exclusion

Generalized Permutations and Combinations

Free

Generalized Permutations and Combinations

Generalized Permutations and Combinations

Free

Generalized Permutations and Combinations

Generalized Permutations and Combinations

Generalized Permutations and Combinations

Recurrence Relations

Homogenous Recurrence Relations

Example 1

Example 2

Non Homogenous Recurrence Relations

Example 3

Example 4

Creating Recurrence Relations

Example 5

Example 6

Generating Functions

Free

Example 1

Example 2

Extended Binomial Theorem

Counting Problems with Generating Functions

Example 1

Example 2

Recurrence Relations

Free

Recurrence Relations

Free

Recurrence Relations

Free

Recurrence Relations

Recurrence Relations

Free

Recurrence Relations

Recurrence Relations

Recurrence Relations

Recurrence Relations

Generating Functions

Generating Functions

Free

Generating Functions

Generating Functions

Generating Functions

Free

Generating Functions

Generating Functions

Generating Functions

Generating Functions

Generating Functions

Definition of Relation

Example 1

Example 2

Example 3

Reflexive Relations

Example 4

Symmetric Relations

Antisymmetric Relations

Example 5

Transitive Relations

Example 6

Properties of Relations

Example 7

Example 8

Composition of Relations

Example 9

Example 10

Combining Relations

Inverse and Complementary of a Relation

Example 11

Matrix Representation of a Relation 1

Matrix Representation of a Relation 2

Example 12

Operations on Zero - One Matrices

Example 13

Equivalence Relation

Example 14

Partially Ordered Set

Example

Example

Example

Totally Ordered Set

Example

Hasse Diagram

Example

Maximal and Minimal Elements

Greatest and Least Elements

Example

Upper and Lower Bound

Least Upper and Greatest Lower Bound

Example

Introduction

Free

Graph Terminology

Free

Handshaking Theorem

Free

Example 1

Special Graphs

Example 2

Bipartite Graphs

Example 3

Example 4

Complete Bipartite Graph

Matching

Subgraph

Example 5

Subgraph Induced

Edge Contraction

Example 6

Complementary Graph

Adjacency Matrices - Undirected Graphs

Free

Adjacency Matrices - Directed Graphs

Example 1

Example 2

Incidence Matrices

Example 3

Isomorphism of Graphs

Example 4

Example 5

Example 6

Example 7

Definition of Paths and Circuits

Connected Graphs

Euler Paths and Circuits

Example 8

Hamilton Paths and Circuits

Example 9

Introduction

Rooted Tree

Terminology for Rooted Trees

Full m-ary Trees

Some Formulas

What is a Minimum Spanning Tree?

Prim's Algorithm

MST Example 1

MST Example 2

Properties of Relation

Properties of Relation

Equivalence Relation 1

Equivalence Relation 2

Equivalence Relation 3

Hasse Diagram 1

Hasse Diagram 2

Adjacency Matrices

Incidence Matrices

Bipartite Graphs & Euler Circuits

Euler Path, Induced Subgraph & Incidence Matrix

Free

Isomorphism 1

Isomorphism 2

Isomorphism 3

Isomorphism 4

Isomorphism 5

Minimum Spanning Trees 1

Minimum Spanning Trees 2

Minimum Spanning Trees (T/F)

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 Final

Frequently asked questions about Unicourse

Pass guarantee

1499 TL