21AI52 Dayananda Sagar University • CSE — Artificial Intelligence & Machine Learning (Semester 5)

Artificial Intelligence & Search Algorithms

💡 DSU Exam Strategy & Guidance

Uninformed Search (BFS, DFS, Uniform Cost), Informed Search (A*, Greedy Best-First), Game Playing (Minimax, Alpha-Beta Pruning), and Constraint Satisfaction Problems.

High-Yield Passing Strategy: Draw complete search trees showing heuristic calculations and Alpha-Beta pruning branch cuts.
Most Repeated Question Topics:
A* Search with Admissible & Consistent HeuristicsAlpha-Beta Pruning on Game TreesConstraint Satisfaction with Backtracking & AC-3Hill Climbing & Local Maxima Avoidance

🔥 Most Predictable Exam Questions (1)

Guaranteed Every Year 8 Marks Module 2: Heuristic Search Strategies

Q1. Trace the A* Search algorithm on a given navigation graph from Start node S to Goal node G with step-by-step OPEN and CLOSED lists, verifying that heuristic h(n) is admissible.

Key Points: Evaluation function f(n) = g(n) + h(n). Admissible condition h(n) <= h*(n). Track OPEN list prioritized by lowest f(n), expand node, compute f(m) for neighbors, add to CLOSED.

🎓 Open Source Courses & Video Playlists (2)

UC Berkeley

UC Berkeley CS188: Introduction to Artificial Intelligence

Watch Course ↗
MIT OpenCourseWare

MIT 6.034: Artificial Intelligence (Prof. Patrick Winston)

Watch Course ↗

📄 Previous Year Question Papers (1)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗

Turn 21AI52 Notes into AI Flashcards

Upload your Artificial Intelligence & Search Algorithms lecture slides to generate spaced repetition study cards in seconds.

Start Free →
MindFlow
DSU Hub Sign In

Structured Active Recall for Complex Coursework.

Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.

Start Free Sprint →