IE 313 • Midterm II + Final • Operations Research III
Eğitmen
Ömer Faruk Altun
Co-founder & Head of Education
2011 yılında Endüstri Mühendisliği okumak için başladığım Sabancı Üniversitesi'nden 2018 yılında Bilgisayar Mühendisi olarak mezun oldum. 13 yıldır Altun ismiyle başta Sabancı Üniversitesi olmak üzere çeşitli okullarda Endüstri ve Bilgisayar Mühendisliği alanlarında ders vermekteyim. Unicourse'ta sunduğum derslerin yanında eğitim departmanının da sorumluluğunu üstlenmekteyim.
Paketi Tamamla
🎓 Sabancı Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.

IE 313 • Midterm II + Final
Operations Research III
Ömer Faruk Altun
2199 TL

IE 313 • Midterm I
Operations Research III
Ömer Faruk Altun
2199 TL
Konular
Continuous Time Markov Chains
From Discrete to Continuous
Example 1
Example 2
Example 3
Steady State Distribution
Q Matrix
Example 4
Example 5
Example 6
Absorbing Chains
Example 7
Embedded Chains
Example 8
Embedded Chains and Stationary Distribution
Example 9
Example 10
Time Reversibility
Example 11
Birth-Death Models
A subproblem of CTMC
Random Rates, Finite Chain
Example 1
Random Rates, Infinite Chain
Example 2
Equal Rates, Infinite Chain, Single Server
Example 3
Equal Rates, Finite Chain, Single Server
Example 4
Equal Rates, Finite Chain, Multiple Servers
Example 5
Queueing Theory
Kendall's Notation
Terminology
M/M/1 Queue
Example 1
M/M/s Queue
Example 2
M/M/1/K Queue
Example 3
M/M/s/K Queue
Example 4
Python Implementation of Queueing Theory
Coding for Markovian Queues
M/M/1/K Queue
M/M/1 Queue
M/M/s/K Queue
M/M/s Queue
Sample Exam Problems
Poisson Processes 1 (From Midterm I)
Poisson Processes 2 (From Midterm I)
Poisson Processes 3 (From Midterm I)
Continuous Time Markov Chains 1
Continuous Time Markov Chains 2
Continuous Time Markov Chains 3
Continuous Time Markov Chains 4
Continuous Time Markov Chains 5
Birth and Death 1
Birth and Death 2
Birth and Death 3
Birth and Death 4
Queueing Theory 1
Queueing Theory 2
Queueing Theory 3
Queueing Theory 4
Queueing Theory 5
Queueing Theory 6
Queueing Theory 7
Queueing Theory 8
🦄 🦄 Fall 2024 Midterm II Exam 🦄 🦄
Continuous Time Markov Chains 1
Continuous Time Markov Chains 2
Birth-and-Death 1
Continuous Time Markov Chains 3
Birth-and-Death 2
Her Başlık Uygun Buraya
🦄 🦄 Fall 2024 Final Exam 🦄 🦄
Discrete Time Markov Chains 1
Continuous Time Markov Chains 1
Discrete Time Markov Chains 2
Poisson Processes
Continuous Time Markov Chains 2
Queueing Theory 1
Queueing Theory 2
Değerlendirmeler
Henüz hiç değerlendirme yok.
Ders İçeriği
Continuous Time Markov Chains
From Discrete to Continuous
Example 1
Example 2
Example 3
Steady State Distribution
Q Matrix
Example 4
Example 5
Example 6
Absorbing Chains
Example 7
Embedded Chains
Example 8
Embedded Chains and Stationary Distribution
Example 9
Example 10
Time Reversibility
Example 11
Birth-Death Models
A subproblem of CTMC
Random Rates, Finite Chain
Example 1
Random Rates, Infinite Chain
Example 2
Equal Rates, Infinite Chain, Single Server
Example 3
Equal Rates, Finite Chain, Single Server
Example 4
Equal Rates, Finite Chain, Multiple Servers
Example 5
Queueing Theory
Kendall's Notation
Terminology
M/M/1 Queue
Example 1
M/M/s Queue
Example 2
M/M/1/K Queue
Example 3
M/M/s/K Queue
Example 4
Python Implementation of Queueing Theory
Coding for Markovian Queues
M/M/1/K Queue
M/M/1 Queue
M/M/s/K Queue
M/M/s Queue
Sample Exam Problems
Poisson Processes 1 (From Midterm I)
Poisson Processes 2 (From Midterm I)
Poisson Processes 3 (From Midterm I)
Continuous Time Markov Chains 1
Continuous Time Markov Chains 2
Continuous Time Markov Chains 3
Continuous Time Markov Chains 4
Continuous Time Markov Chains 5
Birth and Death 1
Birth and Death 2
Birth and Death 3
Birth and Death 4
Queueing Theory 1
Queueing Theory 2
Queueing Theory 3
Queueing Theory 4
Queueing Theory 5
Queueing Theory 6
Queueing Theory 7
Queueing Theory 8
🦄 🦄 Fall 2024 Midterm II Exam 🦄 🦄
Continuous Time Markov Chains 1
Continuous Time Markov Chains 2
Birth-and-Death 1
Continuous Time Markov Chains 3
Birth-and-Death 2
Her Başlık Uygun Buraya
🦄 🦄 Fall 2024 Final Exam 🦄 🦄
Discrete Time Markov Chains 1
Continuous Time Markov Chains 1
Discrete Time Markov Chains 2
Poisson Processes
Continuous Time Markov Chains 2
Queueing Theory 1
Queueing Theory 2
Sıkça Sorulan Sorular
Örneğin, Koç Üniversitesi - MATH 101 (Calculus) veya başka bir okulun benzer dersi olsun, paketlerimiz tam da o derse göre tasarlanır. Böylece nokta atışı çalışır, zaman kazanırsın.
Sınava özel videolar —konu anlatımları, çıkmış sorular ve çözümleri, özet notlar—içerir. Sınavda sıkça çıkan soruları hedefler. Eğitmenlerimiz, üniversitenin akademik takvimini takip ederek paketleri sürekli günceller. Böylece, gereksiz detaylarla vakit kaybetmeden başarını artırmaya odaklanabilirsin.