SPPU_AI_Practicals-TE-Sem-V

Artificial Intelligence (AI) practical codes and lab assignments for SPPU AI & DS 2019 Pattern Semester 5

This repository contains all practical codes for the Artificial Intelligence (Group B) lab, including implementations of classic AI search algorithms and problem-solving techniques based on the 2019 Pattern syllabus for Savitribai Phule Pune University (SPPU).

---

📘 Lab Sections (Group B – Artificial Intelligence)

1️⃣ Search Algorithms

• Depth First Search (DFS)
• Breadth First Search (BFS)
• Implemented using an undirected graph with recursive traversal for exploring all vertices.

2️⃣ Heuristic Search

• A* (A-Star) Algorithm
  • Applied to a game search or shortest path problem.

3️⃣ Game Tree Search

• Alpha-Beta Pruning
  • Optimized search strategy for two-player games.

4️⃣ Constraint Satisfaction Problems (CSP)

• Branch & Bound and Backtracking
  • Demonstrated using N-Queens or Graph Coloring problem.

5️⃣ Greedy Search Algorithms

• Greedy strategies implemented for:
  • Selection Sort
  • Minimum Spanning Tree (Prim’s / Kruskal’s Algorithm)
  • Single-Source Shortest Path (Dijkstra’s Algorithm)
  • Job Scheduling Problem

---

🧰 Tools & Technologies Used

• 🐍 Python 3 (Core language)
• 🧠 Jupyter Notebook / VS Code
• 📊 NetworkX (for graphs)
• 💻 Matplotlib (for visualization)
• 🧩 Heuristics & CSP Solvers (custom implementations)

---

🗂️ Repository Structure