| Module Name | Download |
|---|---|
| noc20_cs39_assigment_1 | noc20_cs39_assigment_1 |
| noc20_cs39_assigment_10 | noc20_cs39_assigment_10 |
| noc20_cs39_assigment_11 | noc20_cs39_assigment_11 |
| noc20_cs39_assigment_12 | noc20_cs39_assigment_12 |
| noc20_cs39_assigment_13 | noc20_cs39_assigment_13 |
| noc20_cs39_assigment_2 | noc20_cs39_assigment_2 |
| noc20_cs39_assigment_3 | noc20_cs39_assigment_3 |
| noc20_cs39_assigment_4 | noc20_cs39_assigment_4 |
| noc20_cs39_assigment_5 | noc20_cs39_assigment_5 |
| noc20_cs39_assigment_6 | noc20_cs39_assigment_6 |
| noc20_cs39_assigment_7 | noc20_cs39_assigment_7 |
| noc20_cs39_assigment_8 | noc20_cs39_assigment_8 |
| noc20_cs39_assigment_9 | noc20_cs39_assigment_9 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Introduction to Randomized Algorithms | Download |
| 2 | Randomized Mincut Algorithm | Download |
| 3 | Randomized Find | Download |
| 4 | Probability Review | Download |
| 5 | Expectation of Random Variables | Download |
| 6 | Conditional Probability and Conditional Expectation2 | Download |
| 7 | Birthday Paradox | Download |
| 8 | Markov and Chebychev's Inequalities | Download |
| 9 | Median Algorithm | Download |
| 10 | Chernoff Bound | Download |
| 11 | Permutation Routing on a Hypercube | Download |
| 12 | Permutation Routing on a Hypercube(Analysis) | Download |
| 13 | Introduction to Probabilistic Method | Download |
| 14 | More Examples on Probabilistic Method | Download |
| 15 | Lovasz Local Lemma | Download |
| 16 | Introduction to Markov Chains | Download |
| 17 | 2-SAT and Markov Chains | Download |
| 18 | 3-SAT and Markov Chains | Download |
| 19 | Electrical Networks | Download |
| 20 | Cover Time | Download |
| 21 | Rapid Mixing | Download |
| 22 | Introduction to Computational Complexity | Download |
| 23 | Pratt's Certificate | Download |
| 24 | Primality Testing | Download |
| 25 | Miller Rabin Algorithm | Download |
| 26 | All pair shortest path-I | Download |
| 27 | All pair shortest path-II | Download |
| 28 | Randomized MST | Download |
| 29 | Introduction to approximate counting | Download |
| 30 | DNF counting | Download |
| 31 | Perfect Matching-I | Download |
| 32 | Perfect Matching-II | Download |
| 33 | Perfect Matching-III | Download |
| 34 | Treaps | Download |
| 35 | Hashing | Download |
| 36 | Probabilistically checkable proofs - I | Download |
| 37 | Probabilistically checkable proofs - II | Download |
| 38 | Probabilistically checkable proofs - III | Download |
| 39 | LFKN Protocol | Download |
| 40 | summary | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Introduction to Randomized Algorithms | Download To be verified |
| 2 | Randomized Mincut Algorithm | Download To be verified |
| 3 | Randomized Find | Download To be verified |
| 4 | Probability Review | Download To be verified |
| 5 | Expectation of Random Variables | Download To be verified |
| 6 | Conditional Probability and Conditional Expectation2 | Download To be verified |
| 7 | Birthday Paradox | Download To be verified |
| 8 | Markov and Chebychev's Inequalities | Download To be verified |
| 9 | Median Algorithm | Download To be verified |
| 10 | Chernoff Bound | Download To be verified |
| 11 | Permutation Routing on a Hypercube | Download To be verified |
| 12 | Permutation Routing on a Hypercube(Analysis) | Download To be verified |
| 13 | Introduction to Probabilistic Method | Download To be verified |
| 14 | More Examples on Probabilistic Method | Download To be verified |
| 15 | Lovasz Local Lemma | Download To be verified |
| 16 | Introduction to Markov Chains | Download To be verified |
| 17 | 2-SAT and Markov Chains | Download To be verified |
| 18 | 3-SAT and Markov Chains | Download To be verified |
| 19 | Electrical Networks | Download To be verified |
| 20 | Cover Time | Download To be verified |
| 21 | Rapid Mixing | Download To be verified |
| 22 | Introduction to Computational Complexity | Download To be verified |
| 23 | Pratt's Certificate | Download To be verified |
| 24 | Primality Testing | Download To be verified |
| 25 | Miller Rabin Algorithm | Download To be verified |
| 26 | All pair shortest path-I | Download To be verified |
| 27 | All pair shortest path-II | Download To be verified |
| 28 | Randomized MST | Download To be verified |
| 29 | Introduction to approximate counting | Download To be verified |
| 30 | DNF counting | Download To be verified |
| 31 | Perfect Matching-I | Download To be verified |
| 32 | Perfect Matching-II | Download To be verified |
| 33 | Perfect Matching-III | Download To be verified |
| 34 | Treaps | Download To be verified |
| 35 | Hashing | Download To be verified |
| 36 | Probabilistically checkable proofs - I | Download To be verified |
| 37 | Probabilistically checkable proofs - II | Download To be verified |
| 38 | Probabilistically checkable proofs - III | Download To be verified |
| 39 | LFKN Protocol | Download To be verified |
| 40 | summary | Download To be verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |