CENG 110 • FinalDiscrete Structures

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

28 past exam questions with solutions
86 topic lessons · 10 h 30 min
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

Definition of Relation

Free

Example 1

Free

Example 2

Free

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

Example 12

Equivalence Relation

Example 13

Example 14

Example 15

Partially Ordered Set

Example 1

Example 2

Example 3

Totally Ordered Set

Example 4

Hasse Diagram

Example 5

Maximal and Minimal Elements

Greatest and Least Elements

Example 6

Upper and Lower Bound

Least Upper and Greatest Lower Bound

Example

Relations 1

Relations 2

Free

Relations 3

Free

Relations 4

Free

Relations 5

Relations 6

Relations 7

Relations 8

Free

Relations 9

Relations 10

Free

Introduction

Graph Terminology

Handshaking Theorem

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

Example 10

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

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Djikstra's Algorithm Example 1

Djikstra's Algorithm Example 2

Shortest Path Problem Example 1

Shortest Path Problem Example 2

Problem Definition

Solving Problem

Enumeration

Example 1

Nearest Neighbor Algorithm

Example 2

Example 3

Djikstra's Algorithm

Free

Shortest Path Problem 1

Shortest Path Problems 2

Shortest Path Problems 3

Shortest Path Problems True/False 1

Free

Shortest Path Problems True/False 2

Traveling Salesperson Problem 1

Free

Traveling Salesperson Problem 2

Free

Traveling Salesperson Problem 3

Free

Buy both together

🎓 92% of İstanbul Okan Üniversitesi students study with the whole bundle.

Discrete Structures

CENG 110 • Midterm

Discrete Structures

1249 TL1499 TL17%
Discrete Structures

CENG 110 • Final

Discrete Structures

1249 TL1499 TL17%
499 TL off
Total:2998 TL2499 TL

Frequently asked questions about CENG 110 Final

Frequently asked questions about Unicourse

Pass guarantee

1499 TL