Module -I-L1
Module -I-L1
Artificial Intelligent
Syllabus Introduction
Learning Objectives
• To focus on general AI techniques that have
been useful in many applications
Recommended Books
• E. Rich and K. Knight, “Artificial intelligence”,
Course Syllabus
All Module Contain weightage 20% equal
Module I: Scope of AI & Problem Solving
• Horn Clauses
• Resolution,
• Semantic Nets,
• Introduction to NLP
• Basics of Parsing techniques • context free and transformational grammars • transition nets •
• knowledge acquisition
• Probabilistic reasoning
• Fuzzy logic
Amity School of Engineering & Technology
• Application of Robotics
• Features of Robotics
Amity School of Engineering & Technology
List of Practical
1. Write a program to implement A* algorithm in python
2. Write a program to implement Single Player Game
3. Write a program to implement Tic-Tac-Toe game problem
4. Implement Brute force solution to the Knapsack problem in Python
5. Implement Graph coloring problem using python
6. Write a program to implement BFS for water jug problem using Python
7. Write a program to implement DFS using Python
8. Tokenization of word and Sentences with the help of NLTK package
9. Design an XOR truth table using Python
10. Study of SCIKIT fuzzy
Amity School of Engineering & Technology
Open Ended Problems
• The traveling salesperson problem (TSP) asks the following question:
"Given a list of cities and the distances between each pair of cities, what is
the shortest possible route that visits each city and returns to the origin city?"
It is an NP-hard problem in combinatorial optimization, important in
operations research and theoretical computer science. In this assignment
you will implement a program using hill climbing approach to solve
TSP. We will consider only the Euclidean version of TSP, in which the cities
all lie on a 2-dimensional plane. Each city will have (x,y) coordinates, and
the Euclidean distance between two cities will be the weight of the edge
connecting them.
Amity School of Engineering & Technology