-
About The Course
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
Description
This course enables learning on different graph traversal techniques (BFS & DFS)
along with enhanced search algorithms like A* algorithm. Genetic algorithms are discussed along with Min-Max algorithms.
Expert systems and ANN are also discussed in detail along with Fuzzy logic in SC.
Along with a pdf with important notes and explanations
Modules Covered:
Introduction to AI / SC
Problem solving algorithms
Knowledge, Reasoning and Planning.
Fuzzy Logic.
Artificial Neural Network.
Expert System. -
How to Pass AISC
-
Introduction to Artificial Intelligence(AI) and Soft Computing
-
Problem Solving
- BFS ( Breadth First Search ) Algorithm with solved Example
- DFS ( Depth First Search ) Algorithm with solved Example
- IDFS ( Iterative Depth First Search ) Algorithm with solved Example
- GBFS Solved Example
- A Star solved Example
- Hill Climbing
- Min Max Solved Example
- Alpha-Beta Pruning Solved Example
- Genetic Algorithm
- Genetic Algorithm Max one Problem Solved Example
-
Fuzzy Logic
-
Knowledge, Reasoning and Planning
-
Artificial Neural Network
-
Expert System
-
Notes
-
Extra Notes
- Introduction to Artificial Intelligence and Soft Computing (Module 1 Notes)
- Artificial Intelligence Notes #1
- Artificial Intelligence Notes #2
- Soft Computing Module 4
- Soft Computing Module 5
- Soft Computing Handmade Notes
- Artificial Intelligence and Soft Computing Complete Notes ( Toppers Solution )
- Mobile Communication and Computing Notes ( Toppers Solution )
- Digital Signal Processing Handmade Notes
Propositional Logic (PL) Introduction
Propositional Logic (PL) Introduction
The machine doesn’t understand human language. It only understands binary form which is zero or one that is true or false
Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. A proposition is a declarative statement that is either true or false. It is a technique of knowledge representation in logical and mathematical form. Propositional Logic does exactly that only, Propositions are statements that can be either true or false and nothing else. This is called “the law of excluded middle,” because there’s nothing allowed in the middle of true and false.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
