Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Syllabus MCA-AI

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 2

Programme Name MCA Semester V Course Type Core / Elective

Course Code Course Title Artificial Intelligence

Total Hours 90 Hours per week 6 Credit 5 Structure 4L : 0T : 2P

Course Description This course emphasizes on the principles and applications of Artificial Intelligence. It
helps the students to illustrate heuristic approaches for providing good solution
mechanism.

Course Objectives 1. To develop the student understands of the issues involved in trying to define and
simulate perception.
2. To familiarize the student with specific, well known computer vision methods,
algorithms and results.
3. To provide the student additional experience in the analysis and evaluation of
complicated systems.
4. To provide the student additional software development experience.
5. To provide the student with paper and proposal writing experience.

Prerequisites Before starting the study of Artificial Intelligence you should first brush up basic
concepts of the following:
 Basic searching concept and algorithms.
 Basic mathematics and Probability and Statistics.
 Basic Programming skills (C++, Python).

Course Outcome Upon successful completion of the course the students will be able to

CO1: Express the modern view of AI and its foundation


CO2: Illustrate Search Strategies with algorithms and Problems
CO3: Implement Propositional logic and apply inference rules
CO4: Apply suitable techniques for NLP and Game Playing

Theory Content 60 Hrs

UNIT – I INTRODUCTION 12
Introduction to AI, The Foundations of AI, AI Technique -Tic-Tac-Toe. Problem
characteristics, Production system characteristics, Production systems: 8-puzzle
problem. Searching: Uniformed search strategies – Breadth first search, depth first
search.

UNIT – II LOCAL SEARCH ALGORITHMS 12


Generate and Test, Hill climbing, simulated annealing search, Constraint satisfaction
problems, Greedy best first search, A* search, AO* search. Toy problems

UNIT – III SELF LEARNING 12


Propositional logic - syntax & semantics

KNOWLEDGE REPRESENTATION
First order logic. Inference in first order logic, propositional Vs. first order inference,
unification & lifts, Clausal form conversion, Forward chaining, Backward chaining,
Resolution.
UNIT –IV GAME PLAYING 12
Overview, Minimax algorithm, Alpha-Beta pruning, Additional Refinements.
Probabilistic Reasoning : Ad Hoc Methods.

PLANNING
Classical planning problem, STRIPS- basic process and working of system.
or
[Note: For Suggestion: Expert System, Expert System Shells.]

UNIT – V NATURAL LANGUAGE PROCESSING 12


Introduction, Practical Applications of NLP, Syntax processing, Semantic Analysis,
Pragmatic and Discourse Processing: Analysis. Perception.

Lab Content (30 Hours) 30 Hrs

1. 8-queens problem.
2. Solve any problem using depth first search.
3. Solve any problem using best first search.
4. Solve 8- puzzle problem using best first search.
5. Solve Robot (traversal) problem using means End Analysis.
6. Solve Traveling Salesman problem.

Essential Reading:
[1] E. Rich and K. Knight, Artificial Intelligence, 3rd Edition. New york: TMH.
[2] S. Russell and P. Norvig, Artificial Intelligence A Modern Approach, 3rd Edition. Pearson Education.

Reference Books:
[1] Eugene Charniak and Drew McDermott, Introduction to Artificial Intelligence, 2ndEdition. Singapore:
Pearson Education, 2005.
[2] George F Luger, Artificial Intelligence Structures and Strategies for Complex ProblemSolving, 4th Edition.
Singapore: Pearson Education, 2008, ISBN-13 9780321545893
[3] N.L. Nilsson, Artificial Intelligence: A New Synthesis, 1st Edition. USA: MorganKaufmann, 2000.
[4] introduction to artificial intelligence by Patterson, ISBN-13: 978-0134771007

Web Resources:
1. https://ai.google/education/
2. https://intellipaat.com/blog/tutorial/artificial-intelligence-tutorial/
3. https://www.javatpoint.com/artificial-intelligence-tutorial

You might also like