{"id":20491303,"url":"https://github.com/kunalpisolkar24/ai_lab","last_synced_at":"2026-04-17T22:04:20.034Z","repository":{"id":233770183,"uuid":"780426863","full_name":"kunalPisolkar24/AI_Lab","owner":"kunalPisolkar24","description":"Collection of practical codes for Savitribai Phule Pune University's Artificial Intelligence (310258) .","archived":false,"fork":false,"pushed_at":"2024-06-22T12:06:33.000Z","size":136,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-16T05:28:17.306Z","etag":null,"topics":["a-star-algorithm","ai-algorithms","aritificial-intelligence","backtracking","chatbot","graph-traversal","greedy-algorithms","heuristic-search","natural-language-processing","search-algorithms","sppu-computer-engineering"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kunalPisolkar24.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-04-01T13:10:00.000Z","updated_at":"2024-06-22T12:14:30.000Z","dependencies_parsed_at":"2024-04-17T10:17:27.263Z","dependency_job_id":"3202f8e5-4227-4fb4-8ec2-d49cedc6df56","html_url":"https://github.com/kunalPisolkar24/AI_Lab","commit_stats":null,"previous_names":["kunalpisolkar24/ai_lab"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kunalPisolkar24%2FAI_Lab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kunalPisolkar24%2FAI_Lab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kunalPisolkar24%2FAI_Lab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kunalPisolkar24%2FAI_Lab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kunalPisolkar24","download_url":"https://codeload.github.com/kunalPisolkar24/AI_Lab/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242069906,"owners_count":20067183,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["a-star-algorithm","ai-algorithms","aritificial-intelligence","backtracking","chatbot","graph-traversal","greedy-algorithms","heuristic-search","natural-language-processing","search-algorithms","sppu-computer-engineering"],"created_at":"2024-11-15T17:22:24.885Z","updated_at":"2025-12-05T22:02:03.891Z","avatar_url":"https://github.com/kunalPisolkar24.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"##  🧠 Artificial Intelligence Laboratory - Savitribai Phule Pune University 🧠\n\n[![GitHub license](https://img.shields.io/github/license/kunalPisolkar24/AI_LAB)](https://github.com/kunalPisolkar24/AI_LAB/blob/main/LICENSE)\n![GitHub last commit](https://img.shields.io/github/last-commit/kunalPisolkar24/AI_LAB)\n![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/kunalPisolkar24/AI_LAB)\n\nThis repository contains practical implementations for the Artificial Intelligence component of the **Laboratory Practice II (310258)** course offered in the Third Year of Computer Engineering (2019 Course) at Savitribai Phule Pune University.  Explore the world of intelligent agents, search algorithms, and AI applications! \n\n🏛️ **Course Information:**\n\n* **University:** Savitribai Phule Pune University\n* **Course Name:** Laboratory Practice II (310258)\n* **Focus:** Artificial Intelligence\n* **Companion Courses:** \n    * Artificial Intelligence (310253)\n    * Elective II (310254) \n* **Credit:** 02\n* **Examination Scheme:**\n    * Practical: 04 Hours/Week\n    * Term Work: 50 Marks\n    * Practical Exam: 25 Marks\n\n🎯 **Learning Objectives:**\n\n* Gain a deep understanding of search strategies used in AI, including informed, uninformed, and heuristic approaches.\n* Apply fundamental AI principles to design solutions for problems involving:\n    * Problem-solving\n    * Inference\n    * Perception \n    * Knowledge representation\n    * Machine learning \n* Design, develop, and implement interactive AI applications.\n\n💡 **Course Outcomes (Artificial Intelligence):**\n\nUpon completion of this laboratory component, students will be able to:\n\n* **CO1:** Design intelligent systems leveraging different informed/uninformed search and heuristic algorithms.\n* **CO2:** Apply core AI principles in crafting solutions that require problem-solving, inference, perception, knowledge representation, and learning capabilities.\n* **CO3:** Design and develop interactive AI applications.\n\n📂 **Practical Implementations:**\n\n| Practical No. | Description |\n|---|---|\n| 1 | Implement Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms. Use an undirected graph and develop a recursive algorithm to search all vertices within a graph or tree data structure. |\n| 2 | Implement the A* Search algorithm to solve a game search problem.  |\n| 3 | Implement the Greedy Search algorithm for one of the following applications:  |\n|   |  I) Selection Sort |\n|   |  II) Minimum Spanning Tree |\n|   |  III) Single-Source Shortest Path Problem |\n|   |  IV) Job Scheduling Problem |\n|   |  V) Prim's Minimal Spanning Tree Algorithm |\n|   |  VI) Kruskal's Minimal Spanning Tree Algorithm |\n|   |  VII) Dijkstra's Minimal Spanning Tree Algorithm | \n| 4 | Implement a solution for a Constraint Satisfaction Problem using Branch and Bound and Backtracking techniques for the N-Queens problem or a graph coloring problem. |\n| 5 | Develop a basic chatbot for a suitable customer interaction application. |\n| 6 | Implement one of the following Expert Systems: |\n|   |  I) Information Management System |\n|   |  II) Hospital and Medical Facility System |\n|   |  III) Help Desk Management System |\n|   |  IV) Employee Performance Evaluation System |\n|   |  V) Stock Market Trading System |\n|   |  VI) Airline Scheduling and Cargo Scheduling System |\n\n🚀 **Getting Started:**\n\nNavigate to the directory of the AI practical implementation you want to explore. Each directory contains well-documented code files with clear instructions to guide your learning.\n\n🙌 **Contributions:**\n\nWe encourage contributions, enhancements, and feedback from the AI and programming communities! If you have improvements, bug fixes, or additional practical examples to share, please open a pull request. Refer to our [CONTRIBUTING.md](./CONTRIBUTING.md) file for guidelines.\n\n📄 **License:**\n\nThis repository is distributed under the [MIT License](./LICENSE), allowing you to use, modify, and distribute the code for educational and personal projects. \n\nLet's learn and build intelligent systems together! 🚀 \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkunalpisolkar24%2Fai_lab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkunalpisolkar24%2Fai_lab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkunalpisolkar24%2Fai_lab/lists"}