| 1 |
Demonstrate basic problem-solving using Breadth-First Search on a simple grid. |
View |
| 2 |
Implement Depth-First Search (DFS) on a small graph. |
View |
| 3 |
Solve the Water Jug Problem using Breadth First Search (BFS). |
View |
| 4 |
Implement a Hill Climbing search to find the peak in a numeric dataset. |
View |
| 5 |
Apply the A* Search algorithm to find the shortest path in a 4x4 grid. |
View |
| 6 |
Implement the Minimax search algorithm for 2-player games. You may use a game tree with 3 plies. |
View |
| 7 |
Solve the 4 – Queens Problem as a CSP backtracking problem. |
View |
| 8 |
Use constraint propagation to solve a Magic Square puzzle. |
View |
| 9 |
Apply optimization techniques to find the maximum value in a list. |
View |
| 10 |
Represent and evaluate propositional logic expressions. |
View |
| 11 |
Implement a basic rule-based expert system for weather classification. |
View |
| 12 |
Implement a basic AI agent with simple decision-making rules. |
View |
| 13 |
Implement a basic Rule-Based Chatbot. |
View |
| 14 |
Using Python NLTK, perform the following Natural Language Processing (NLP) tasks for text content. a) Tokenizing b) Filtering Stop Words c) Stemming d) Part of Speech tagging e) Chunking f) Named Entity Recognition (NER) |
View |
| 15 |
Perform Image classification for a given dataset using CNN. You may use Tensorflow/Keras. |
View |