CSE 2023 • 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

52 past exam questions with solutions
142 topic lessons · 16 h 52 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 Divisibility

Free

Example 1

Free

Example 2

Free

Example 3

Division Algorithm

Definition of Modular Arithmetic

Example 1

Properties of Modular Arithmetic

Example 1

Example 2

GCD Greatest Common Divisor

LCM Least Common Multiple

Euclidian Algorithm

Example 1

Bézout Identity

Example 1

Example 2

Example 3

Inverse of a Number in Modular Arithmetic

Fermat's Little Theorem

Solving Linear Congruences

Example 1

Example 2

Chinese Remainder Theorem

Example 1

Example 2

Example 3

Example 4

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 Theorem

Example 1

Example 3

Example 2

Pascal Identity

Vandermonde's Identity

Example 1

Combinatorial Proof

Example 1

Principle Inclusion-Exclusion

Example 1

Example 2

Distributing Objects into Boxes

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7

Counting 1

Free

Counting 2

Counting 3

Free

Counting 4

Counting 5

Free

Counting 6

Free

Counting 7

Inclusion-Exclusion Principle 1

Free

Inclusion-Exclusion Principle 2

Inclusion-Exclusion Principle & Distributing Objects 1

Distributing Objects into Boxes 1

Free

Distributing Objects into Boxes 2

Distributing Objects into Boxes 3

Free

Distributing Objects into Boxes 4

Distributing Objects into Boxes 5

Distributing Objects into Boxes 6

Pigeonhole Principle 1

Free

Pigeonhole Principle 2

Free

Pigeonhole Principle 3

Pigeonhole Principle 4

Pigeonhole Principle 5

Number Theory 1

Free

Number Theory 2

Free

Number Theory 3

Free

Number Theory 4

Number Theory 5

Free

Number Theory 6

Number Theory 7

Number Theory 8

Number Theory 9

Number Theory 10

Free

Number Theory 11

Number Theory 12

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

Example 13

Example 14

Equivalence Relation

Example 15

Example 16

Example 17

Example 18

Example 19

Example 20

Example 21

Example 22

Example 23

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

Matching

Example 9

Subgraph

Example 10

Subgraph Induced

Edge Contraction

Example 11

Complementary Graph

Example 12

Example 13

Example 14

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

Relations 1

Free

Relations 2

Free

Relations 3

Graphs 1

Free

Graphs 2

Graphs 3

Free

Graphs 4

Free

Graphs 5

Free

Graphs 6

Graphs 7

Graphs 8

Graphs 9

Graphs 10

Free

Graphs 11

Graphs 12

Free

Graphs 13

Free

Graphs 14

Graphs 15

Graphs 16

Free

Buy both together

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

Discrete Computational Structures

CSE 2023 • Final

Discrete Computational Structures

1099 TL1299 TL15%
Discrete Computational Structures

CSE 2023 • Midterm

Discrete Computational Structures

1099 TL1299 TL15%
399 TL off
Total:2598 TL2199 TL

Frequently asked questions about CSE 2023 Final

Frequently asked questions about Unicourse

Pass guarantee

1299 TL