MAT 1006 (Spring 24)Engineering Mathematics IFinal

Ders Tanıtımı

Definition of Relation

Example 1

Ücretsiz

Example 2

Example 3

Example 4

Reflexive Relations

Example 5

Example 6

Symmetric Relations

Antisymmetric Relations

Example 7

Transitive Relations

Example 8

Properties of Relations

Example 9

Example 10

Example 11

Composition of Relations

Example 12

Example 13

Combining Relations

Inverse and Complementary of a Relation

Example 14

Matrix Representation of a Relation 1

Matrix Representation of a Relation 2

Example 15

Operations on Zero - One Matrices

Example 16

Reflexive Closure

Symmetric Closure

Example 17

Transitive Closure & Connectivity Relation

Matrix Representation of Transitive Closure

Example 18

Equivalence Relation

Example 19

Example 20

Example 21

Example 22

Example 23

Example 24

Partially Ordered Set

Example 25

Example 26

Relations 1

Ücretsiz

Relations 2

Ücretsiz

Relations 3

Ücretsiz

Relations 4

Relations 6

Relations 7

Relations 8

Relations 9

Relations 10

Ücretsiz

Introduction to Counting

Combination & Permutation: Intuition

Combination

Permutation 1

Permutation 2

Binomial Theorem

Example 1

Example 2

Example 3

Pascal Identity

Combinatorial Proof

Example 4

Pigeonhole Principle

Ücretsiz

Example 1

Example 2

Example 3

Example 4

Example 5

Counting 1

Ücretsiz

Counting 2

Ücretsiz

Counting 3

Counting 4

Counting 5

Counting 6

Counting 7

Counting 8

Counting 9

Binomial Coefficients and Identities 1

Pigeonhole Principle 1

Ücretsiz

Pigeonhole Principle 2

Ücretsiz

Pigeonhole Principle 3

Ücretsiz

Pigeonhole Principle 4

Pigeonhole Principle 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

Matching

Example 9

Subgraph

Example 10

Subgraph Induced

Edge Contraction

Example 11

Complementary Graph

Example 12

Example 13

Example 14

Adjacency Matrices - Undirected Graphs

Adjacency Matrices - Directed Graphs

Example 15

Example 16

Incidence Matrices

Example 17

Isomorphism of Graphs

Example 18

Example 19

Example 20

Example 21

Definition of Paths and Circuits

Connected Graphs

Euler Paths and Circuits

Example 22

Hamilton Paths and Circuits

Example 23

Example 24

Planar Graph

Planar Graph - Euler Formula

Example 25

Corollaries about Planar Graph

Example 26

Kuratowski's Theorem

Example 27

Example 28

Example 29

Graphs 1

Ücretsiz

Graphs 2

Ücretsiz

Graphs 3

Graphs 4

Graphs 5

Ücretsiz

Graphs 6

Graphs 7

Graphs 8

Graphs 9

Ücretsiz

Graphs 10

Graphs 11

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

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

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.

849 TL
Hemen Al