CMPE 201 • Midterm II + FinalDiscrete Mathematics for Engineering

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.

1799 TL

599 TL a month, 3 instalments at no extra cost

75 past exam questions with solutions
150 topic lessons · 19 h 59 min
Access for the whole term

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.

Topics

Course introduction

What is an algorithm?

Algorithm and Pseudocode 1

Algorithm and Pseudocode 2

Exam-like Question 1

Free

Linear Search Algorithm

Binary Search Algorithm

Bubble Sort Algorithm

Insertion Sort Algorithm

Insertion Sort Algorithm - Code

Big-O Notation

Free

Example 1

Free

Example 2

Example 3

Example 4

Sum Property of Big-O Notation

Multiplication Property of Big-O Notation

Example 1

Example 2

Big-Omega Notation

Big-Theta Notation

Example 1

Example 2

Definition of Divisibility

Example 1

Example 2

Division Algorithm

Definition of Modular Arithmetic

Example 1

Properties of Modular Arithmetic

Example 1

Example 2

Prime Numbers

Example 1

Example 2

GCD Greatest Common Divisor

LCM Least Common Multiple

Example 1

Euclidian Algorithm

Example 1

Bezout Identity

Example 1

Introduction

Free

Proof of Formulas by Induction

Free

Example 1

Free

Example 2

Exam-like Question 1

Exam-like Question 2

Proof of Divisibility by Induction

Example 1

Example 2

Exam-like Question 1

Exam-like Question 2

Proof of Inequality by Induction

Example 1

Example 2

Example 3

Exam-like Question 1

Exam-like Question 2

Exam-like Question 3

Induction Related to Fibonacci

Exam-like Question 1

Strong Induction

Example 1

Introduction

Recursively Defined Functions

Example 1

Recursively Defined Sets

Example 2

Recursively Defined Strings

Example 3

Structural Induction

Example 4

Example 5

Growth of Functions 1

Free

Growth of Functions 2

Growth of Functions 3

Growth of Functions 4

Free

Algorithms 1

Free

Algorithms 2

Free

Algorithms 3

Free

Number Theory 1

Free

Number Theory 2

Induction for Formulas 1

Free

Induction for Formulas 2

Induction for Formulas 3

Induction for Formulas 4

Free

Induction Proof for Divisibility 1

Free

Induction Proof for Divisibility 2

Induction for Inequalities 1

Free

Induction for Inequalities 2

Counting 1

Free

Counting 2

Counting 3

Free

Counting 4

Counting 5

Counting 6

Free

Counting 7

Pigeonhole Principle 1

Free

Pigeonhole Principle 2

Free

Pigeonhole Principle 3

Free

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example

Combination

n choose r

Committee Example

Ball Example

Pigeonhole Principle

Pigeonhole Principle Example 1

Pigeonhole Principle Example 2

Pigeonhole Principle Example 3

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

Counting 1

Free

Counting 2

Counting 3

Free

Counting 4

Free

Counting 5

Counting 6

Free

Counting 7

Pigeonhole Principle 1

Free

Pigeonhole Principle 2

Free

Pigeonhole Principle 3

Free

Pigeonhole Principle 4

Pigeonhole Principle 5

Recurrence Relations 1

Free

Recurrence Relations 2

Free

Recurrence Relations 3

Recurrence Relations 4

Recurrence Relations 5

Free

Recurrence Relations 6

Recurrence Relations 7

Free

Recurrence Relations 8

Free

Introduction

Free

Graph Terminology

Free

Handshaking Theorem

Free

Example 1

Free

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

Free

Incidence Matrices

Bipartite Graphs & Euler Circuits

Free

Euler Path, Induced Subgraph & Incidence Matrix

Free

Isomorphism 1

Free

Isomorphism 2

Free

Isomorphism 3

Isomorphism 4

Free

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

Finite State Machines with Output

Example 1

Example 2

Finite State Machines with NO Output

Example 3

Example 4

Example 5

Turing Machine

Example 6

Example 7

Djikstra's Algorithm

Free

Shortest Path Problem 1

Free

Shortest Path Problems 2

Free

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

Finite State Machines with Output

Free

Finite State Machines with NO Output 1

Finite State Machines with NO Output 2

Free

Turing Machine

Free

Growth of Functions

Euclidian Algorithm & Bezout Theorem

Recursion and Induction

Pigeonhole Principle

Counting

Graph Theory - Incidence Matrix

Buy both together

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

Discrete Mathematics for Engineering

CMPE 201 • Midterm II + Final

Discrete Mathematics for Engineering

1499 TL1799 TL17%
Discrete Mathematics for Engineering

CMPE 201 • Midterm I

Discrete Mathematics for Engineering

1499 TL1799 TL17%
599 TL off
Total:3598 TL2999 TL

Frequently asked questions about CMPE 201 Midterm II + Final

Frequently asked questions about Unicourse

1799 TL