CENG 213 • FinalDiscrete Computational 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.

1299 TL

433 TL a month, 3 instalments at no extra cost

46 past exam questions with solutions
119 topic lessons · 15 h 51 min
5.0 rating
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

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

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 for Formulas 1

Free

Induction for Formulas 2

Free

Induction for Formulas 3

Induction for Formulas 4

Free

Induction Proof for Divisibility 1

Free

Induction Proof for Divisibility 2

Induction for Inequalities

Free

Induction with Fibonacci

Free

Recursion and Induction

Free

Recursive Algorithm

Free

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example 1

Identical Objects Example 2

Identical Objects Example 3

Combination

n choose r

Committee Example 1

Committee Example 2

Ball Example 1

Ball Example 2

Principle Inclusion-Exclusion

Example

Distributing Objects into Boxes 1

Free

Distributing Objects into Boxes 2

Free

Example 1

Example 2

Example 3

Pigeonhole Principle

Free

Example 1

Example 2

Example 3

Counting 1

Free

Counting 2

Free

Counting 3

Counting 4

Counting 5

Counting 6

Principle Inclusion Exclusion 1

Free

Principle Inclusion Exclusion 2

Distributing Objects into Boxes 1

Free

Distributing Objects into Boxes 2

Pigeonhole Principle 1

Free

Pigeonhole Principle 2

Free

Pigeonhole Principle 3

Pigeonhole Principle 4

Free

Introduction

Homogenous Recurrence Relations

Example 1

Example 2

Example 3

Example 4

Non Homogenous Recurrence Relations

Example 5

Example 6

Creating Recurrence Relations

Example 7

Example 8

Example 9

Definition of Relation

Example 1

Example 2

Reflexive Relations

Example 3

Example 4

Symmetric Relations

Antisymmetric Relations

Free

Example 5

Transitive Relations

Example 6

Properties of Relations

Example 7

Example 8

Composition of Relations

Equivalence Relation

Example 9

Example 10

Recurrence Relations 1

Free

Recurrence Relations 2

Free

Recurrence Relations 3

Recurrence Relations 4

Free

Recurrence Relations 5

Recurrence Relations 6

Free

Recurrence Relations 7

Free

Recurrence Relations 8

Free

Properties of Relation

Free

Properties of Relation

Equivalence Relation 1

Free

Equivalence Relation 2

Free

Equivalence Relation 3

Introduction

Free

Graph Terminology

Free

Handshaking Theorem

Free

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

Introduction

Rooted Tree

Terminology for Rooted Trees

Full m-ary Trees

Some Formulas

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

Reviews

5

1 student review

Only students who have this course can review it.

Esra Camcı

Bought the course

Bilgisayar Mühendisliği

18 days ago

Buy both together

🎓 92% of OSTIM Teknik Üniversitesi students study with the whole bundle.

Discrete Computational Structures

CENG 213 • Midterm

Discrete Computational Structures

5.0(1)
1099 TL1299 TL15%
Discrete Computational Structures

CENG 213 • Final

Discrete Computational Structures

5.0(1)
1099 TL1299 TL15%
399 TL off
Total:2598 TL2199 TL

Frequently asked questions about CENG 213 Final

Frequently asked questions about Unicourse

Pass guarantee

1299 TL