CMPE 201 • Final • Discrete 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.
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
Basics of Counting & Permutations & Combinations
14 topic lessons
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
Binomial Coefficients and Identities
7 topic lessons
Binomial Theorem
Example 1
Example 2
Example 3
Pascal Identity
Combinatorial Proof
Example 4
The Pigeonhole Principle
6 topic lessons
Pigeonhole Principle
Example 1
Example 2
Example 3
Example 4
Example 5
Past Final Problems I
15 questions
Counting 1
Counting 2
Counting 3
Counting 4
Counting 5
Counting 6
Counting and Binomial Coefficients
Binomial Coefficient and Identities 1
Binomial Coefficients and Identities 2
Pigeonhole Principle 1
Pigeonhole Principle 2
Pigeonhole Principle 3
Pigeonhole Principle 4
Pigeonhole Principle 5
Pigeonhole Principle 6
Recurrence Relations
13 topic lessons
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
Graph Theory
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
Trees
5 topic lessons
Introduction
Rooted Tree
Terminology for Rooted Trees
Full m-ary Trees
Some Formulas
Past Final Problems II
29 questions
Recurrence Relations 1
Recurrence Relations 2
Recurrence Relations 3
Recurrence Relations 4
Recurrence Relations 5
Recurrence Relations 6
Recurrence Relations 7
Recurrence Relations 8
Degree Sequence
Graph Theory Basics
Handshaking Theorem
Handshaking Theorem
Handshaking Theorem
Adjacency Matrices
Incidence Matrices
Bipartite Graphs & Euler Circuits
Euler Path, Induced Subgraph & Incidence Matrix
Isomorphism
Isomorphism
Isomorphism
Isomorphism
Isomorphism
Trees
Trees
Trees
Trees
Trees
Trees
Trees
Reviews
5 student reviews
Only students who have this course can review it.
Mustafa Uzpak
Bought the courseBilgisayar Mühendisliği
Şuana kadar çalışmalar iyi gidiyor
Emirhan Atay
Bought the courseBilgisayar Mühendisliği
Burak Ava
Bought the courseBilgisayar Mühendisliği
Mert Bakal
Bought the courseBilgisayar Mühendisliği
Elif Karaman
Bought the courseBilgisayar Mühendisliği
Buy both together
🎓 92% of Kadir Has Üniversitesi students study with the whole bundle.
