| Module Name | Download |
|---|---|
| noc20_cs81_Assignment_01_Week_00 | noc20_cs81_Assignment_01_Week_00 |
| noc20_cs81_Assignment_01_Week_01 | noc20_cs81_Assignment_01_Week_01 |
| noc20_cs81_Assignment_01_Week_02 | noc20_cs81_Assignment_01_Week_02 |
| noc20_cs81_Assignment_01_Week_03 | noc20_cs81_Assignment_01_Week_03 |
| noc20_cs81_Assignment_01_Week_04 | noc20_cs81_Assignment_01_Week_04 |
| noc20_cs81_Assignment_01_Week_05 | noc20_cs81_Assignment_01_Week_05 |
| noc20_cs81_Assignment_01_Week_06 | noc20_cs81_Assignment_01_Week_06 |
| noc20_cs81_Assignment_01_Week_07 | noc20_cs81_Assignment_01_Week_07 |
| noc20_cs81_Assignment_01_Week_08 | noc20_cs81_Assignment_01_Week_08 |
| noc20_cs81_Assignment_01_Week_09 | noc20_cs81_Assignment_01_Week_09 |
| noc20_cs81_Assignment_01_Week_10 | noc20_cs81_Assignment_01_Week_10 |
| noc20_cs81_Assignment_01_Week_11 | noc20_cs81_Assignment_01_Week_11 |
| noc20_cs81_Assignment_01_Week_12 | noc20_cs81_Assignment_01_Week_12 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Prologue | Download |
| 2 | The Winograd Schema Challenge | Download |
| 3 | Introduction (2013 version) | Download |
| 4 | Can Machines Think? | Download |
| 5 | The Turing Test | Download |
| 6 | Language and Thought | Download |
| 7 | The Willing Suspension of Disbelief | Download |
| 8 | Machines with Wheels and Gears | Download |
| 9 | The Notion of Mind in Philosophy | Download |
| 10 | Reasoning = Computation | Download |
| 11 | Concepts and Categories | Download |
| 12 | How did AI get its name? | Download |
| 13 | The Chess Saga | Download |
| 14 | A Brief History of AI | Download |
| 15 | The Worlds in our Minds | Download |
| 16 | Epiphemona in Computers | Download |
| 17 | State Space Search | Download |
| 18 | Domain Independent Algorithms | Download |
| 19 | Deterministic Search | Download |
| 20 | DFS and BFS | Download |
| 21 | Comparing DFS and BFS | Download |
| 22 | Depth First Iterative Deepening | Download |
| 23 | Heuristic Search | Download |
| 24 | Heuristic Functions and the Search Landscape | Download |
| 25 | Solution Space Search | Download |
| 26 | The Traveling Salesman Problem | Download |
| 27 | Escaping Local Optima | Download |
| 28 | Stochastic Local Search | Download |
| 29 | Genetic Algorithms: Survival of the Fittest | Download |
| 30 | Genetic Algorithms and SAT | Download |
| 31 | Genetic Algorithms for the TSP | Download |
| 32 | Emergent Systems | Download |
| 33 | Ant Colony Optimization | Download |
| 34 | Finding Optimal Paths | Download |
| 35 | Branch & Bound | Download |
| 36 | Algorithm A* | Download |
| 37 | A*: An illustrated example | Download |
| 38 | Is A* Admissible? | Download |
| 39 | Admissibility of A* | Download |
| 40 | Higher, Faster ... | Download |
| 41 | B&B - A* - wA* - Best First | Download |
| 42 | A*: Leaner Admissible Variations | Download |
| 43 | The Monotone Condition | Download |
| 44 | DNA Sequence Alignment | Download |
| 45 | Divide & Conquer Frontier Search. | Download |
| 46 | Smart Memory Graph Search | Download |
| 47 | Variations on A*: The story so far | Download |
| 48 | Breadth First Heuristic Search | Download |
| 49 | Beam Stack Search | Download |
| 50 | Game Theory | Download |
| 51 | Popular Recreational Games | Download |
| 52 | Board Games and Game Trees | Download |
| 53 | The Evaluation Function in Board Games | Download |
| 54 | Algorithm Minimax and Alpha-Beta Pruning | Download |
| 55 | A Cluster of Strategies | Download |
| 56 | SSS*: A Best First Algorithm | Download |
| 57 | SSS*: A Detailed Example | Download |
| 58 | Automated Domain Independent Planning | Download |
| 59 | The Blocks World Domain | Download |
| 60 | State Space Planning: Forward and Backward | Download |
| 61 | Goal Stack Planning (GSP) | Download |
| 62 | GSP: A Detailed Example | Download |
| 63 | Plan Space Planning (PSP) | Download |
| 64 | PSP: A Tiny Example | Download |
| 65 | Multi-Armed Robots | Download |
| 66 | Means-Ends Analysis | Download |
| 67 | The Planning Graph | Download |
| 68 | Algorithm Graphplan | Download |
| 69 | Problem Decomposition. | Download |
| 70 | Algorithm AO* | Download |
| 71 | AO*: An Illustration | Download |
| 72 | Rule Based Expert Systems | Download |
| 73 | The Inference Engine | Download |
| 74 | The OPS5 Language | Download |
| 75 | Conflict Resolution | Download |
| 76 | Business Rule Management Systems | Download |
| 77 | The Rete Net | Download |
| 78 | Rete Algorithm: Optimizing the Match | Download |
| 79 | Rete Algorithm: Conflict Resolution | Download |
| 80 | Reasoning in Logic | Download |
| 81 | Rules of Inference | Download |
| 82 | Forward Reasoning | Download |
| 83 | First Order Logic | Download |
| 84 | Implicit Quantifier Notation | Download |
| 85 | Backward Reasoning | Download |
| 86 | Depth First Search on Goal Trees | Download |
| 87 | Incompleteness... | Download |
| 88 | Constraint Satisfaction Problems | Download |
| 89 | Binary Constraint Networks | Download |
| 90 | Interpreting Line Drawings | Download |
| 91 | Model Based Diagnosis | Download |
| 92 | Solving CSPs | Download |
| 93 | Arc Consistency | Download |
| 94 | Propagation = Reasoning | Download |
| 95 | Lookahead Search | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Prologue | Download To be verified |
| 2 | The Winograd Schema Challenge | Download To be verified |
| 3 | Introduction (2013 version) | Download To be verified |
| 4 | Can Machines Think? | Download To be verified |
| 5 | The Turing Test | Download To be verified |
| 6 | Language and Thought | Download To be verified |
| 7 | The Willing Suspension of Disbelief | Download To be verified |
| 8 | Machines with Wheels and Gears | Download To be verified |
| 9 | The Notion of Mind in Philosophy | Download To be verified |
| 10 | Reasoning = Computation | Download To be verified |
| 11 | Concepts and Categories | Download To be verified |
| 12 | How did AI get its name? | Download To be verified |
| 13 | The Chess Saga | Download To be verified |
| 14 | A Brief History of AI | Download To be verified |
| 15 | The Worlds in our Minds | Download To be verified |
| 16 | Epiphemona in Computers | Download To be verified |
| 17 | State Space Search | Download To be verified |
| 18 | Domain Independent Algorithms | Download To be verified |
| 19 | Deterministic Search | Download To be verified |
| 20 | DFS and BFS | Download To be verified |
| 21 | Comparing DFS and BFS | Download To be verified |
| 22 | Depth First Iterative Deepening | Download To be verified |
| 23 | Heuristic Search | Download To be verified |
| 24 | Heuristic Functions and the Search Landscape | Download To be verified |
| 25 | Solution Space Search | Download To be verified |
| 26 | The Traveling Salesman Problem | Download To be verified |
| 27 | Escaping Local Optima | Download To be verified |
| 28 | Stochastic Local Search | Download To be verified |
| 29 | Genetic Algorithms: Survival of the Fittest | Download To be verified |
| 30 | Genetic Algorithms and SAT | Download To be verified |
| 31 | Genetic Algorithms for the TSP | Download To be verified |
| 32 | Emergent Systems | Download To be verified |
| 33 | Ant Colony Optimization | Download To be verified |
| 34 | Finding Optimal Paths | Download To be verified |
| 35 | Branch & Bound | Download To be verified |
| 36 | Algorithm A* | Download To be verified |
| 37 | A*: An illustrated example | Download To be verified |
| 38 | Is A* Admissible? | Download To be verified |
| 39 | Admissibility of A* | Download To be verified |
| 40 | Higher, Faster ... | Download To be verified |
| 41 | B&B - A* - wA* - Best First | Download To be verified |
| 42 | A*: Leaner Admissible Variations | Download To be verified |
| 43 | The Monotone Condition | Download To be verified |
| 44 | DNA Sequence Alignment | Download To be verified |
| 45 | Divide & Conquer Frontier Search. | Download To be verified |
| 46 | Smart Memory Graph Search | Download To be verified |
| 47 | Variations on A*: The story so far | Download To be verified |
| 48 | Breadth First Heuristic Search | Download To be verified |
| 49 | Beam Stack Search | Download To be verified |
| 50 | Game Theory | Download To be verified |
| 51 | Popular Recreational Games | Download To be verified |
| 52 | Board Games and Game Trees | Download To be verified |
| 53 | The Evaluation Function in Board Games | Download To be verified |
| 54 | Algorithm Minimax and Alpha-Beta Pruning | Download To be verified |
| 55 | A Cluster of Strategies | Download To be verified |
| 56 | SSS*: A Best First Algorithm | Download To be verified |
| 57 | SSS*: A Detailed Example | Download To be verified |
| 58 | Automated Domain Independent Planning | Download To be verified |
| 59 | The Blocks World Domain | Download To be verified |
| 60 | State Space Planning: Forward and Backward | Download To be verified |
| 61 | Goal Stack Planning (GSP) | Download To be verified |
| 62 | GSP: A Detailed Example | Download To be verified |
| 63 | Plan Space Planning (PSP) | Download To be verified |
| 64 | PSP: A Tiny Example | Download To be verified |
| 65 | Multi-Armed Robots | Download To be verified |
| 66 | Means-Ends Analysis | Download To be verified |
| 67 | The Planning Graph | Download To be verified |
| 68 | Algorithm Graphplan | Download To be verified |
| 69 | Problem Decomposition. | Download To be verified |
| 70 | Algorithm AO* | Download To be verified |
| 71 | AO*: An Illustration | Download To be verified |
| 72 | Rule Based Expert Systems | Download To be verified |
| 73 | The Inference Engine | Download To be verified |
| 74 | The OPS5 Language | Download To be verified |
| 75 | Conflict Resolution | Download To be verified |
| 76 | Business Rule Management Systems | Download To be verified |
| 77 | The Rete Net | Download To be verified |
| 78 | Rete Algorithm: Optimizing the Match | Download To be verified |
| 79 | Rete Algorithm: Conflict Resolution | Download To be verified |
| 80 | Reasoning in Logic | Download To be verified |
| 81 | Rules of Inference | Download To be verified |
| 82 | Forward Reasoning | Download To be verified |
| 83 | First Order Logic | Download To be verified |
| 84 | Implicit Quantifier Notation | Download To be verified |
| 85 | Backward Reasoning | Download To be verified |
| 86 | Depth First Search on Goal Trees | Download To be verified |
| 87 | Incompleteness... | Download To be verified |
| 88 | Constraint Satisfaction Problems | Download To be verified |
| 89 | Binary Constraint Networks | Download To be verified |
| 90 | Interpreting Line Drawings | Download To be verified |
| 91 | Model Based Diagnosis | Download To be verified |
| 92 | Solving CSPs | Download To be verified |
| 93 | Arc Consistency | Download To be verified |
| 94 | Propagation = Reasoning | Download To be verified |
| 95 | Lookahead Search | 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 |