Semester 6Year 3 · EvenCore Subject★★★★★ Hard
CS 601

Artificial Intelligence

Study of intelligent agents, search algorithms, knowledge representation, expert systems, and AI applications.

4Units
25Topics
4Credits
60hLecture hrs
100Max marks
Your Progress
0 / 25 topics
0% complete
Overview
🎯
Why it matters
AI is transforming everything. From ChatGPT to self-driving cars to medical diagnosis — AI is the future. Understanding intelligent agents, search, and reasoning is foundational to building smart systems.
💼
Placement relevance
AI/ML Engineer roles at top companies. Research positions. Robotics companies. Builds on ML knowledge. Growing field with ₹25-60 LPA salaries for AI specialists.
🔗
Prerequisites for
Natural Language Processing · Computer Vision · Robotics · Expert Systems · AI Research · Reinforcement Learning
📚
Recommended books
Artificial Intelligence: A Modern Approach by Russell and Norvig · Artificial Intelligence by Elaine Rich and Kevin Knight · Introduction to Artificial Intelligence by Wolfgang Ertel
Curriculum — 4 Units
U1
Unit 1 · 7 Topics · 0% complete
Search & Problem Solving
⚡ Key Formulae
A* Evaluation:f(n) = g(n) + h(n), where g=cost, h=heuristic
Admissible Heuristic:h(n) ≤ actual cost to goal (never overestimate)
Intelligent Agents
Problem Formulation
Uninformed Search (BFS, DFS, DLS)
Informed Search (A*, Greedy)
Heuristic Functions
Adversarial Search
Minimax, Alpha-Beta Pruning
U2
Unit 2 · 7 Topics · 0% complete
Knowledge Representation
⚡ Key Formulae
Modus Ponens:If P→Q and P, then Q
Resolution:CNF conversion, resolve complementary literals
First-Order Logic
Propositional Logic
Knowledge Base
Inference Rules
Resolution
Semantic Networks
Frames
U3
Unit 3 · 6 Topics · 0% complete
Expert Systems & Planning
⚡ Key Formulae
Bayes Theorem:P(A|B) = P(B|A)×P(A) / P(B)
Expert Systems
Forward Chaining
Backward Chaining
STRIPS Planning
Partial Order Planning
Uncertainty (Bayesian)
U4
Unit 4 · 5 Topics · 0% complete
Advanced AI
⚡ Key Formulae
Fuzzy Membership:μ(x) ∈ [0,1] (degree of membership)
Fuzzy Logic
Neural Networks Basics
Genetic Algorithms
Natural Language Processing Basics
Computer Vision Basics
Previous Year Questions
Unit 12023 · End Semester10 marks
Apply A* search algorithm to find path from S to G. Given graph with nodes, edges, and heuristic values. Show open list, closed list at each step.
Unit 32022 · End Semester8 marks
Design a simple expert system for medical diagnosis using forward chaining. Given symptoms and rules, show inference process.
Exam Strategy
🔍
Search algorithms = step-by-step
A*, BFS, DFS questions need each step shown: open list, closed list, node expansion. Draw search tree. Missing steps = lost marks.
🧠
Understand heuristics
Know difference between admissible and consistent heuristics. A* needs admissible h(n). Practice Manhattan distance, Euclidean distance.
🎮
Minimax for games
Game tree problems: Show minimax values at each node. Alpha-beta pruning: mark pruned branches. Common in every exam.
Related Subjects
Semester 5
Machine Learning
CS 501