0% found this document useful (0 votes)
20 views4 pages

New Syllabus

Syllabus gor second year bca

Uploaded by

park-nifty08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views4 pages

New Syllabus

Syllabus gor second year bca

Uploaded by

park-nifty08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Annexure ‘CD-01’

Course Title: Foundations of Artificial Intelligence - I

Course Code: L T P/S SW/FW No. of PSDA TOTAL CREDIT

Credit Units: 5 UNITS

4 0 2 0 0 5
Course Level: UG
Course Objectives: To introduce the fundamental concepts and techniques of artificial
intelligence.
Prerequisites: None
Course Contents/syllabus:

Weightage Teaching
Hours

Unit I: Introduction 15% 11 H

What is intelligence? Foundations of artificial intelligence (AI). History of AI. AI problems: Toy Problems, Real
World problems- TicTac-Toe, Water Jug, Question-Answering, 8-puzzle, 8-Queens problem. Formulating
problems, Searching for Solutions.

Unit II: Knowledge Representation 35% 25 H


Propositional Logic, Propositional Theorem Proving-Inference
and Proofs, Proof by Resolution, Horn Clauses, and definite
Clauses, Forward and Backward chaining; First order Logic,
Inference in First order Logic.
Uncertain Knowledge and Reasoning: Basic probability, Bayes
rule, Belief networks, Default reasoning, Fuzzy sets, and fuzzy
logic. Structured Knowledge: Associative Networks, Frame
Structures, Conceptual Dependencies and Scripts.
Unit III: Uninformed and Informed Search Strategies 30% 22 H

Uninformed Search strategies- Breadth-first search, Uniform-cost search, Depth-first search, Depth-limited
search, Iterative deepening depth-first search, Bidirectional search, comparing uninformed search strategies.
Informed (Heuristic) Search Strategies-Hill Climbing, Simulated Annealing, Greedy best-first search, A* and
optimal search, Memory bounded heuristic search.

Unit IV: Natural Language Processing & Expert Systems 20% 14 H


Grammars, Parsing, Semantic Analysis and Pragmatics.
Expert System Architectures: Characteristics, Rule-Based System Architectures, Nonproduction System
Architectures, Knowledge Acquisition and Validation
Course Learning Outcomes: After studying this course students will be able:

1. Illustrate the significance and domains of Artificial Intelligence and knowledge representation.
2. Select the right AI tool for different AI based applications.
3. Identify various Expert Systems and AI applications.
4. Explain the role of AI in different areas like NLP.

Pedagogy for Course Delivery:


Lectures: 62 sessions
Presentation / Seminar: 2
Mid Term/End Term: 2 sessions
Quiz: 6 sessions
Labs: 36 sessions
Total: 108 sessions

Lab/ Practical details, if applicable:

List of experiments:
1. Learn the building blocks of Logic Programming in Python.
2. Python script for comparing mathematical expressions and finding out unknown
values.
3. Use logic programming in Python to check for prime numbers.
4. Use logic programming in Python parse a family tree and infer the relationships
between the family members.
5. Python script for building a puzzle solver.
6. Implementation of Naïve Bayes classifier, computing its accuracy and visualizing its
performance.
7. Creation of a fuzzy control system which models how you might choose to tip at a
restaurant.
8. Implementation of uninformed search techniques in Python.

Assessment/ Examination Scheme:

Theory L/T (%) Lab/Practical/Studio (%) End Term Examination


75% 25% 100%

Assessment/Examination Scheme: Theory

CONTINUOUS EVALUATION FORMAT FINAL EXAM

TYPE OF ASSESSMENT Surprise Tests MCQ Term paper Seminar/ Mid semester Test End semester Exam End Semester
based Best of 4 presentation/ (Subjective) Exam
(minimum 6 tests) Assignment (MCQ)

WEIGHTAGE 16 4 5 25 25 25
(%)

Minimum # of Surprise test for up to 1 credit = 3


Minimum # of Surprise test for more than 1 credits = 6
Laboratory Assessment:
Continuous Assessment/Internal End Term Examination
Assessment

Lab Record
including
Components Minor Major
Attendance, Viva-
(Drop Experiment/ Experiment Viva Total
Ethics, voce
down) Spotting (Practical)
Precautions,
Interactions

Weight age
20 15 15 35 15 100
(%)

Bloom’s Level > Understanding Applying Analyzing Evaluating

Course Learning CLO1 CLO2 CLO3 CLO4


Outcomes Illustrate the significance Select the right AI tool Identify various Expert Sys- Explain the role of AI in different
` and domains of Artificial for different AI based ap- tems and AI applications. areas like NLP.
Assessment type Intelligence and knowl- plications. 1.
/PSDA edge representation.

Mid-Term Test

End-Term Test

Quiz 1

Quiz 2

Quiz 3

Quiz 4

Quiz 5

Quiz 6

HA1

HA2

Text / Reference Books:


AUTHOR TITLE Publisher Year of ISBN
publication

rd
Russel and Artificial Intelligence-A Modern Approach, 3 Prentice Hall 2015 978-9332543515
Norvig ed.
Elaine Rich, Kevin Knight Artificial Intelligence TMH 2017 978-0070087705
and SB Nair

D.W. Patterson Artificial Intelligence And Prentice 1997 978-


Expert Systems Hall 8120307773

George F. Luger Artificial Intelligence Pearson 2008 978-


Structures and Strategies 0321545893
for complex Problem
Solving

Nils J. Nilsson Artificial Intelligence-A Elsevier 2003 978-


New Synthesis India 8181471901

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy