COMP 106 • FinalDiscrete Mathematics for Computer Science and Engineering

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.

2399 TL

799 TL a month, 3 instalments at no extra cost

53 students took this course
39 past exam questions with solutions
74 topic lessons · 9 h 4 min
4.8 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

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

Example 3

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 1

Free

Induction 2

Free

Induction 3

Induction 4

Strong Induction 1

Free

Algorithm & Induction

Free

Definition of Relation

Example

Example

Reflexive Relations

Example

Example

Symmetric Relations

Antisymmetric Relations

Example

Transitive Relations

Example

Properties of Relations

Example

Example

Composition of Relations

Example

Example

Combining Relations

Inverse and Complementary of a Relation

Matrix Representation of a Relation 1

Matrix Representation of a Relation 2

Example

Operations on Zero - One Matrices

Example

Reflexive Closure

Symmetric Closure

Example

Transitive Closure & Connectivity Relation

Matrix Representation of Transitive Closure

Example

Equivalence Relation

Example

Example

Relations

Free

Relations

Free

Relations

Free

Relations

Relations

Relations

Relations

Relations

Relations

Relations

Relations

Relations

Relations

Relations

Language and Grammar

Phase-Structure Grammar

Grammar -> Language Example 1

Grammar -> Language Example 2

Language -> Grammar Example 1

Language -> Grammar Example 2

Finite State Machines with Output

Example 1

Example 2

Finite State Machines with NO Output

Example 3

Example 4

Example 5

Turing Machine

Example 6

Example 7

Grammar -> Language 1

Free

Grammar -> Language 2

Language -> Grammar 1

Free

Language -> Grammar 2

Language -> Grammar 3

Finite State Machines with Output

Free

Finite State Machines with NO Output 1

Finite State Machines with NO Output 2

Free

Turing Machine

Logic

Proof Techniques

Induction

Growth of Functions

Recursion and Induction

Recursive Algorithm and Complexity

Modular Arithmetic 1

Modular Arithmetic 2

Modeling Computation 1

Modeling Computation 2

Reviews

4.8

16 student reviews

Only students who have this course can review it.

Tuana Çorumluoğlu

Bought the course

Bilgisayar Mühendisliği

2 days ago

Elif Valiyev

Bought the course

Ekonomi

2 days ago

Karya Türkcan

Bought the course

Bilgisayar Mühendisliği

3 days ago

Yavuz Önal

Bought the course

Bilgisayar Mühendisliği

7 days ago

Alya Kaplan

Bought the course

Bilgisayar Mühendisliği

10 days ago

Nehir Sönmezler

Bought the course

Bilgisayar Mühendisliği

16 days ago

Ozan Karakuş

Bought the course

Psikoloji

18 days ago

Ege Şahin

Bought the course

Bilgisayar Mühendisliği

8 months ago

Punhan Guliyev

Bought the course

Bilgisayar Mühendisliği

9 months ago

Erdem Türk

Bought the course

Bilgisayar Mühendisliği

12 months ago

Buy both together

🎓 92% of Koç Üniversitesi students study with the whole bundle.

Discrete Mathematics for Computer Science and Engineering

COMP 106 • Final

Discrete Mathematics for Computer Science and Engineering

4.8(16)
1999 TL2399 TL17%
Discrete Mathematics for Computer Science and Engineering

COMP 106 • Midterm

Discrete Mathematics for Computer Science and Engineering

4.8(16)
1999 TL2399 TL17%
799 TL off
Total:4798 TL3999 TL

Frequently asked questions about COMP 106 Final

Frequently asked questions about Unicourse

2399 TL
53 students took this course