INDR 201 • FinalDiscrete Mathematical Structure

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.

2499 TL

833 TL a month, 3 instalments at no extra cost

34 students took this course
70 past exam questions with solutions
75 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

What is an algorithm?

Free

Algorithm and Pseudocode 1

Algorithm and Pseudocode 2

Algorithm and Pseudocode 3

Algorithm and Pseudocode 4

Exam-like Question 1

Free

Exam-like Question 2

Free

Linear Search Algorithm

Binary Search Algorithm

Bubble Sort Algorithm

Insertion Sort Algorithm

Insertion Sort Algorithm - Code

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

Big-Omega Notation

Big-Theta Notation

Example 1

Example 2

Algorithms

Algorithms

Algorithms

Algorithms

Algorithms

Algorithms

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Algorithms and Complexity

Growth of Functions

Growth of Functions

Growth of Functions

Growth of Functions

Growth of Functions

Introduction

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

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

Subgraph

Example 10

Subgraph Induced

Edge Contraction

Example 11

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

Induction for Formulas

Induction for Formulas

Induction for Formulas

Induction for Formulas

Induction for Formulas

Induction for Formulas

Induction for Divisibility

Induction for Divisibility

Induction for Divisibility

Induction for Divisibility

Induction for Inequality

Induction for Inequality

Induction for Inequality

Induction for Inequality

Induction for Fibonacci

Induction for Fibonacci

Induction for Fibonacci

Handshaking Theorem

Handshaking Theorem

Handshaking Theorem

Degree Sequence

Number of Graphs

Graph Theory - Basics

Bipartite Graphs

Complete Bipartite

Adjacency Matrices

Incidence Matrices

Incidence Matrices

Isomorphism

Isomorphism

Isomorphism

Isomorphism

Isomorphism

Euler Path & Circuit

Euler Path & Circuit

Euler Path, Incidence Matrix & Induced Subgraph

Euler Path, Incidence Matrix & Bipartite

Graph Theory - Proof

Graph Theory - Proof

Graph Theory - Proof

Graph Theory - Proof

Graph Theory - Proof

Graph Theory - Proof

Graph Theory - Proof

Logic Basics

Translation

Free

Quantifiers

Functions

Sets and Functions

Cardinality

Proof Techniques

Reviews

4.8

14 student reviews

Only students who have this course can review it.

Zeynep Duru Ertuğ

Bought the course

Endüstri Mühendisliği

about 4 hours ago

Mehmet Ali Mansuroğlu

Bought the course

Endüstri Mühendisliği

about 8 hours ago

Emircan Ateşsönmez

Bought the course

Endüstri Mühendisliği

4 days ago

Habip Can Hamidi

Bought the course

Endüstri Mühendisliği

4 days ago

Elifnaz Aytürk

Bought the course

Endüstri Mühendisliği

4 days ago

Aras Yılmaz

Bought the course

Endüstri Mühendisliği

6 months ago

Aras Yılmaz

Bought the course

Endüstri Mühendisliği

7 months ago

Ali Emre Derebağ

Bought the course

Endüstri Mühendisliği

7 months ago

Yavuz Önal

Bought the course

Bilgisayar Mühendisliği

10 months ago

Resul Tankılıç

Bought the course

Elektrik-Elektronik Mühendisliği

10 months ago

Buy both together

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

Discrete Mathematical Structure

INDR 201 • Final

Discrete Mathematical Structure

4.8(16)
2099 TL2499 TL16%
Discrete Mathematical Structure

INDR 201 • Midterm

Discrete Mathematical Structure

4.8(16)
2099 TL2499 TL16%
799 TL off
Total:4998 TL4199 TL

Frequently asked questions about INDR 201 Final

Frequently asked questions about Unicourse

2499 TL
34 students took this course