Modules / Lectures


Sl.No Chapter Name MP4 Download
1Lecture 1 : Decision Analysis : Introduction (Repplace with the new one)Download
2Lecture 2 : Payoff MatrixDownload
3Lecture 3 : Decision Making Under RiskDownload
4Lecture 4 : Value of InformationDownload
5Lecture 5 : Probability ConceptsDownload
6Lecture 6 : Bayes TheoremDownload
7Lecture 7 : Decision TreeDownload
8Lecture 8 : Decision Problem with ExperimentationDownload
9Lecture 9 : Decision Problem with Experimentation (Contd.)Download
10Lecture 10 : Decision Problem ExampleDownload
11Lecture 11 : Introduction to Waiting LinesDownload
12Lecture 12 : Poisson and Exponential DistributionDownload
13Lecture 13 : Birth and Death ProcessDownload
14Lecture 14 : M/M/1 Queing ModelDownload
15Lecture 15 : Queuing ExamplesDownload
16Lecture 16 : Queuing Examples (Contd.)Download
17Lecture 17 : M/D/1 and M/M/s Queuing ModelsDownload
18Lecture 18 : M/M/s and M/M/infinity Models Download
19Lecture 19 : Finite Queue Space and Queuing Cost ModelsDownload
20Lecture 20 : Queuing Cost, Priority and Networking ModelsDownload
21Lecture 21 : Introduction to SimulationDownload
22Lecture 22 : Discrete-Event and Monte-Carlo SimulationDownload
23Lecture 23 : Pseudo random NumbersDownload
24Lecture 24 : Simulation ExamplesDownload
25Lecture 25 : Generation of Random Variates Download
26Lecture 26 : Simulation Examples (Contd.)Download
27Lecture 27 : Monte-Carlo Simulation and Output Analysis Download
28Lecture 28 : Variance Reduction and Simulation Software Download
29Lecture 29 : Continuous Simulation and System DynamicsDownload
30Lecture 30 : System Dynamics ExampleDownload
31Lecture 31 : Introduction to Graph TheoryDownload
32Lecture 32 : Introduction (Contd.)Download
33Lecture 33 : Operations on a Graph, Tree and Spanning TreeDownload
34Lecture 34 : Minimal Spanning TreeDownload
35Lecture 35 : CutsetsDownload
36Lecture 36 : Fundamental Circuits and Network Simplex MethodDownload
37Lecture 37 : Maximal Flow ProblemsDownload
38Lecture 38 : Maximal Flow Problems (Contd.)Download
39Lecture 39 : Shortest Path ProblemsDownload
40Lecture 40 : Shortest Path Problems (Contd.)Download

Sl.No Chapter Name English
1Lecture 1 : Decision Analysis : Introduction (Repplace with the new one)PDF unavailable
2Lecture 2 : Payoff MatrixPDF unavailable
3Lecture 3 : Decision Making Under RiskPDF unavailable
4Lecture 4 : Value of InformationPDF unavailable
5Lecture 5 : Probability ConceptsPDF unavailable
6Lecture 6 : Bayes TheoremPDF unavailable
7Lecture 7 : Decision TreePDF unavailable
8Lecture 8 : Decision Problem with ExperimentationPDF unavailable
9Lecture 9 : Decision Problem with Experimentation (Contd.)PDF unavailable
10Lecture 10 : Decision Problem ExamplePDF unavailable
11Lecture 11 : Introduction to Waiting LinesPDF unavailable
12Lecture 12 : Poisson and Exponential DistributionPDF unavailable
13Lecture 13 : Birth and Death ProcessPDF unavailable
14Lecture 14 : M/M/1 Queing ModelPDF unavailable
15Lecture 15 : Queuing ExamplesPDF unavailable
16Lecture 16 : Queuing Examples (Contd.)PDF unavailable
17Lecture 17 : M/D/1 and M/M/s Queuing ModelsPDF unavailable
18Lecture 18 : M/M/s and M/M/infinity Models PDF unavailable
19Lecture 19 : Finite Queue Space and Queuing Cost ModelsPDF unavailable
20Lecture 20 : Queuing Cost, Priority and Networking ModelsPDF unavailable
21Lecture 21 : Introduction to SimulationPDF unavailable
22Lecture 22 : Discrete-Event and Monte-Carlo SimulationPDF unavailable
23Lecture 23 : Pseudo random NumbersPDF unavailable
24Lecture 24 : Simulation ExamplesPDF unavailable
25Lecture 25 : Generation of Random Variates PDF unavailable
26Lecture 26 : Simulation Examples (Contd.)PDF unavailable
27Lecture 27 : Monte-Carlo Simulation and Output Analysis PDF unavailable
28Lecture 28 : Variance Reduction and Simulation Software PDF unavailable
29Lecture 29 : Continuous Simulation and System DynamicsPDF unavailable
30Lecture 30 : System Dynamics ExamplePDF unavailable
31Lecture 31 : Introduction to Graph TheoryPDF unavailable
32Lecture 32 : Introduction (Contd.)PDF unavailable
33Lecture 33 : Operations on a Graph, Tree and Spanning TreePDF unavailable
34Lecture 34 : Minimal Spanning TreePDF unavailable
35Lecture 35 : CutsetsPDF unavailable
36Lecture 36 : Fundamental Circuits and Network Simplex MethodPDF unavailable
37Lecture 37 : Maximal Flow ProblemsPDF unavailable
38Lecture 38 : Maximal Flow Problems (Contd.)PDF unavailable
39Lecture 39 : Shortest Path ProblemsPDF unavailable
40Lecture 40 : Shortest Path Problems (Contd.)PDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available