CENG 110 • Final • Discrete 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.
499 TL a month, 3 instalments at no extra cost
Instructor
İ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
Relations: Part 1
22 topic lessons
Definition of Relation
Example 1
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
Example 12
Equivalence Relation
Example 13
Example 14
Example 15
Relations: Part 2
14 topic lessons
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
Past Final Problems I
10 questions
Relations 1
Relations 2
Relations 3
Relations 4
Relations 5
Relations 6
Relations 7
Relations 8
Relations 9
Relations 10
Graph Theory Part 1
17 topic lessons
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
Graph Theory Part 2
18 topic lessons
Adjacency Matrices - Undirected Graphs
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
Past Final Problems II
9 questions
Adjacency Matrices
Incidence Matrices
Bipartite Graphs & Euler Circuits
Euler Path, Induced Subgraph & Incidence Matrix
Isomorphism 1
Isomorphism 2
Isomorphism 3
Isomorphism 4
Isomorphism 5
Shortest Path Problem & Dijkstra's Algorithm
7 topic lessons
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
Traveling Salesperson Problem
7 topic lessons
Problem Definition
Solving Problem
Enumeration
Example 1
Nearest Neighbor Algorithm
Example 2
Example 3
Past Final Problems III
9 questions
Djikstra's Algorithm
Shortest Path Problem 1
Shortest Path Problems 2
Shortest Path Problems 3
Shortest Path Problems True/False 1
Shortest Path Problems True/False 2
Traveling Salesperson Problem 1
Traveling Salesperson Problem 2
Traveling Salesperson Problem 3
Buy both together
🎓 92% of İstanbul Okan Üniversitesi students study with the whole bundle.
