0% found this document useful (0 votes)
21 views67 pages

FAI Course File Umar

The document outlines the syllabus for the 'Fundamentals of Artificial Intelligence' course offered in the III B. Tech I Semester at Guru Nanak Institutions Technical Campus. It covers various topics including intelligent agents, problem-solving strategies, logical agents, expert systems, and machine learning paradigms. Additionally, it details the course objectives, outcomes, educational objectives, and assessment methodologies.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views67 pages

FAI Course File Umar

The document outlines the syllabus for the 'Fundamentals of Artificial Intelligence' course offered in the III B. Tech I Semester at Guru Nanak Institutions Technical Campus. It covers various topics including intelligent agents, problem-solving strategies, logical agents, expert systems, and machine learning paradigms. Additionally, it details the course objectives, outcomes, educational objectives, and assessment methodologies.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 67

Department of Computer Science & Engineering

Fundamentals of Artificial Intelligence (18MC0CS01)

III B. Tech I Semester


Academic Year 2021-2022

Umar Farooq
Assistant Professor

Guru Nanak Institutions Technical Campus


(Autonomous)
Ibrahimpatnam, R.R District – 501 506, Telangana

CSE Dept, GNITC Page 1


GURU NANAK INSTITUTIONS TECHNICAL CAMPUS
(AUTONOMOUS)

(18MC0CS01) FUNDAMENTALS ARTIFICIAL INTELLIGENCE

L T P C
3 0 0 0
UNIT I
Introduction: What is artificial intelligence, foundations of artificial intelligence, history of
artificial intelligence Intelligent Agents – agents and environments, the structure, good
behavior: the concept of rationality, the nature of environments, the structure of agents.

UNIT II
Solving Problem by Searching – Problem solving agents, example problems, searching for
solutions. Uninformed Search Strategies – Breadth first search, uniform-cost search, depth
first search, depth limited search, iterative deepening search, bidirectional search,
comparing uninformed search strategies.

UNIT III
Logical Agents – Knowledge-based agents, the Wumpus world, logic, propositional logic:
the very simple logic. Knowledge Representation – Introduction, approaches to knowledge
representation-relational knowledge, knowledge represented as logic, procedural
knowledge, knowledge representation using semantic networks, inheritance in semantic
net.

UNIT IV
Expert System & Applications – Introduction, phases in building expert systems-
knowledge engineering, knowledge representation, expert systems architecture-
knowledgebase, inference engine, knowledge acquisition, expert systems versus traditional
systems-characteristics of expert systems, evolution of expert systems, advantages and
disadvantages of expert systems, languages for es development., applications of expert
systems.

UNIT V
Learning: Machine Learning Paradigm – Introduction, machine learning system-
components of learning system, rote learning, learning by taking advice. Supervised &
Unsupervised Learning – supervised concept learning, unsupervised concept learning,
reinforcement learning.

CSE Dept, GNITC Page 2


TEXT BOOKS:

1. Artificial Intelligence-A Modern Approach, 3rd Edition, Stuart J. Russell, Peter Norvig,
Pearson Education.
2. Artificial Intelligence, Saroj Kaushik, Cengage Publication

REFERENCE BOOKS:

1. Artificial Intelligence, Elaine Rich, Kevin Knight, Shivashankar B. Nair, 3rd Edition, McGraw
Hill.
2. Principles of Artificial Intelligence, Nils J. Nilson, Morgan Kaufmann Publishers.
3. Artificial Intelligence, 3rd Edition, Patric Henry Winston, Pearson Education.
4. Artificial Intelligence Illuminated, Ben Coppin, Narosa Publication

VISION OF THE INSTITUTION [GNITC]:


To be a world–class educational and research institution in the service of humanity by promoting
high quality Engineering, Management and Pharmacy education.

MISSION OF THE INSTITUTION [GNITC]:


1. Imbibe soft skills and technical skills.
2. Develop the faculty to reach the international standards.
3. Maintain high academic standards and teaching quality that promotes the analytical thinking
and independent judgment.
4. Promote research, innovation and Product development by collaboration with reputed foreign
universities.
5. Offer collaborative industry programs in emerging areas and spirit of enterprise.

QUALITY POLICY:
GNITC is committed to provide quality education through dedicated and talented faculty, world
class infrastructure, labs and updated research center to the students. Quality teaching-learning
process and system will help students to attain placements and prepare them for higher studies.

VISION OF THE DEPARTMENT (COMPUTER SCIENCE & ENGINEERING):


To be a premier department of Computer Science & Engineering in the region.

MISSION OF THE DEPARTMENT (COMPUTER SCIENCE & ENGINEERING):


1. Nurture young individuals into knowledgeable, skillful and ethical professionals in their
pursuit of Computer Science and Engineering.
2. Nurture the faculty to expose them to world-class infrastructure.

CSE Dept, GNITC Page 3


3. Sustain high performance by excellence in teaching, research and innovations.
4. Extensive partnerships and collaborations with foreign universities for technology
upgradation.
5. Develop Industry-Interaction for innovation and product development.

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):

PEO 1: Graduates shall have the ability to apply knowledge across the disciplines and in emerging
areas of Computer Science and Engineering for higher studies, research, employability, product
development and handle the realistic problems.
PEO 2: Graduates shall have good communication skills, possess ethical conduct, sense of
responsibility to serve the society, and protect the environment.
PEO 3: Graduates shall possess academic excellence with innovative insight, soft skills,
managerial skills, leadership qualities, Knowledge of contemporary issues and understand the need
for lifelong learning for a successful professional career.

PROGRAMME OUTCOMES (POs):

The following list of programme outcomes describes what graduates are expected to know and be
able to do at the time of graduation. Graduates at graduation will have:
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
3. Design/Development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.

CSE Dept, GNITC Page 4


6. The Engineer and Society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9. Individual and team work: Function effectively as an individual and as a member or leader in
diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering management principles and apply these to one's own work, as a member and leader in
a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for and have the preparation and ability to engage in
independent and lifelong learning in the broadest context of technological change.

PROGRAMME SPECIFIC OUTCOMES (PSOs):

PSO 1: Ability to apply software engineering skills to design, develop and debug optimized
solutions for all real world problems.
PSO 2: Ascertain knowledge in diverse areas of Computer Science and experience an
environment conducive in novel skills for successful career, entrepreneurship and higher studies.

Mapping of PEOs with POs and PSOs:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

PEO1 √ √ √ √ √ √ √ √ √

PEO2 √ √ √ √ √ √ √

PEO3 √ √ √ √ √ √ √

CSE Dept, GNITC Page 5


Model Lesson Plan/Consolidated Unit Wise Lesson Plan

Subject (18MC0CS01) FUNDAMENTALS OF ARTIFICAL INTELLIGENCE (Mandatory)

Faculty Umar Farooq

Text Books (to be acquired by the Students)


Book 1 Artificial Intelligence-A Modern Approach, 3rd Edition, Stuart J. Russel, Peter Marvin, Pearson
Education.
Book 2 Artificial Intelligence, Saroj Kaushik, Cengage Publication.

Reference Books
Book 3 Artificial Intelligence, Elaine Rich, Kevin Knight, Shivashankar B. Nair, 3rd Edition, McGraw Hill.

Book 4 Principles of Artificial Intelligence, Nils J. Nilson, Morgan Kaufmann Publishers.

Book 5 Artificial Intelligence, 3rd Edition, Patric Henry Winston, Pearson Education.

Book 6 Artificial Intelligence Illuminated, Ben Coppin, Narosa Publication

Chapters
Unit No of
Topic Book 1 Book 2 Book 3 Book 4 Book 5 Classes

I Introduction, Intelligent Ch 1,2 Ch 1 -- 12


Agents
Solving Problem by
Information
II Searching, Uninformed Ch 2 Ch 2 -- 14
Search Strategies
Retrieval System
Capabilities
Logical Agents,
III Knowledge Ch 7 Ch 7 -- 10
Representation

IV Expert System & Ch 16 Ch 8 -- 10


Applications
Machine Learning Ch
V Ch 11 -- 10
Paradigm, Supervised & 18,21
Unsupervised Learning
Contact classes for syllabus coverage 56

Classes for beyond syllabus :02 Descriptive tests: 02 Gaps in the syllabus:02 08
Remedial Classes: 02
Tutorial classes 16
Total classes 80

CSE Dept, GNITC Page 6


COURSE INFORMATION SHEET

PROGRAMME: ME DEGREE: B. Tech


COURSE: Fundamentals of Artificial Intelligence SEMESTER: I CREDITS: 0
COURSE CODE: 18MC0CS01 COURSE TYPE: Mandatory
REGULATION: R18
COURSE AREA/DOMAIN: Civil CONTACT HOURS: 3 hours
CORRESPONDING LAB COURSE CODE (IF ANY): NIL LAB COURSE NAME: NIL

SYLLABUS:
UNIT DETAILS HOURS
I Introduction – What is artificial intelligence, foundations of artificial 12
intelligence, history of artificial intelligence, applications of AI.
Intelligent Agents – agents and environments, good behavior: the concept of
rationality, the nature of environments, the structure of agents.
II Solving Problem by Searching – Problem solving agents, example problems, 14
searching for solutions.
Uninformed Search Strategies – Breadth first search, uniform-cost search,
depth first search, depth limited search, iterative deepening search, bidirectional
search, comparing uninformed search strategies.
III Logical Agents – Knowledge-based agents, the Wumpus world, logic, 10
propositional logic: the very simple logic.
Knowledge Representation – Introduction, approaches to knowledge
representation-relational knowledge, knowledge represented as logic,
procedural knowledge, knowledge representation using semantic networks,
inheritance in semantic net.
IV Expert System & Applications – Introduction, phases in building expert 10
systems-knowledge engineering, knowledge representation, expert systems
architecture-knowledgebase, inference engine, knowledge acquisition,
Expert systems versus traditional systems-characteristics of expert systems,
evolution of expert systems, advantages and disadvantages of expert systems,
languages for expert system development, applications of expert systems.
V Machine Learning Paradigm – Introduction, machine learning system-
components of learning system, rote learning, learning by taking advice.
10
Supervised & Unsupervised Learning – supervised concept learning,
unsupervised concept learning, reinforcement learning
Total 56
Tutorial classes 16
Descriptive 2
Classes beyond Syllabus 2
Gaps in the syllabus 2
Remedial classes 2
TOTAL HOURS 80

CSE Dept, GNITC Page 7


TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T Artificial Intelligence-A Modern Approach, Stuart J. Russel, Peter Marvin, 3rd Edition,
Pearson Education.
T Artificial Intelligence, Saroj Kaushik, Cengage Publication
R Artificial Intelligence, Elaine Rich, Kevin Knight, Shivashankar B. Nair, 3rd Edition, McGraw Hill.
R Principles of Artificial Intelligence, Nils J. Nilson, Morgan Kaufmann Publishers.
R Artificial Intelligence, 3rd Edition, Patric Henry Winston, Pearson Education.
R Artificial Intelligence Illuminated, Ben Coppin, Narosa Publication

COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
--- NIL ---

COURSE OBJECTIVES:
1. The course is introduced to familiarize the basic concepts of artificial intelligence, its
relevance in the modern era and various applications.

COURSE OUTCOMES:

SNO DESCRIPTION
1 Identify the importance of artificial intelligence.

2 Apply various search strategies to provide efficient solutions for problem space.

3 Comprehend various approaches for knowledge representation.

4 Employ expert systems for knowledge engineering applications.

5 Develop models using machine learning techniques.

Mapping of COs with POs and PSOs:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 0 3 0 1 0 0 0 0 0 0 0 0 0 1
CO2 3 2 2 0 2 3 2 3 0 1 2 0 2 0
CO3 1 1 1 2 0 2 2 0 0 3 1 0 0 2
CO4 3 2 2 1 3 2 1 0 0 1 2 0 2 1
CO5 1 1 3 1 2 0 0 1 0 1 1 3 2 0

CSE Dept, GNITC Page 8


GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SNO DESCRIPTION PROPOSED
ACTIONS
1 Automation Seminar
2 Neural Networks Seminar
ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST
LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


1 Machine Learning
2 Deep Learning

WEB SOURCE REFERENCES:


1 www.techopedia.com/definition/190/artificial-intelligence-ai
2 www.britannica.com/technology/artificial-intelligence
3 www.investopedia.com/terms/a/artificial-intelligence-ai.asp
4 www.edx.org/micromasters/columbiax-artificial-intelligence
5 https://www.tutorialspoint.com/artificial_intelligence/index.htm
6 https://stfalcon.com/en/blog/post/artificial-intelligence-in-website-developmen

DELIVERY/INSTRUCTIONAL METHODOLOGIES:
 PPT & TALK  STUD.  WEB RESOURCES  VIDEO
ASSIGNMENT- LECTURES
 LCD/SMART BOARDS  STUD. SEMINARS ☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT:
✓ASSIGNMENTS √ STUD. SEMINARS √ TESTS/MODEL EXAMS √ UNIV.
EXAMINATION
☐ STUD. LAB PRACTICES ☐STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PROJECTS
☐ ADD-ON COURSES ☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT:
√ASSESSMENT OF COURSE OUTCOMES (BY  STUDENT FEEDBACK ON FACULTY
FEEDBACK, ONCE) (TWICE)-YES
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. ☐ OTHERS
EXPERTS

Course Instructor Approved by:


(Umar Farooq) (HOD)

CSE Dept, GNITC Page 9


MICRO LESSION PLAN

Teaching
S. No. Date Name of the Topic BTL
AID
UNIT-1
1 Introduction – What is artificial intelligence 1,2 Talk & PPT
2 Foundations of artificial intelligence 1,2 Talk & PPT
3 History of artificial intelligence 1,2 Talk & PPT
4 Tutorial-1 1,2 Practice
5 Intelligent Agents 1,2,3 Talk & PPT
6 Agents and environments 1,2,3 Talk & PPT
7 Good behaviour 1,2,3 Talk & PPT
8 Tutorial-2 1,2 Practice
9 The concept of rationality 1,2,3 Talk & PPT
10 The nature of environments 1,2,3 Talk & PPT
11 The structure of agents 1,2,3 Talk & PPT
12 Tutorial-3 1,2 Practice
13 Applications of AI. 1,2,3 Talk & PPT
14 Gap in the syllabus 1,2,3 Seminar
15 Discussion of previous year question papers Talk & PPT
16 Unit-1 Assignments
UNIT-2
17 Solving Problem by Searching 1,2,3 Talk & PPT
18 Problem solving agents 1,2,3 Talk & PPT
19 Example problems 1,2,3 Talk & PPT
20 Tutorial-4 1,2 Practice
21 Searching for solutions 1,2,3 Talk & PPT
22 Uninformed Search Strategies 1,2,3 Talk & PPT
23 Breadth first search 1,2,3 Digital Board
24 Tutorial-5 1,2 Practice
25 Uniform-cost search 1,2,3 Digital Board
26 Depth first search 1,2,3 Digital Board
27 Depth limited search 1,2,3 Digital Board
28 Tutorial-6 1,2 Practice
29 Iterative deepening search 1,2,3 Digital Board
30 Bidirectional search 1,2,3 Digital Board
31 Tutorial-7 1,2 Practice
32 Comparing uninformed search strategies 1,2,3 Talk & PPT
33 Discussion on Question papers 1,2,3 Talk & PPT

CSE Dept, GNITC Page 10


34 Unit-2 Assignments
UNIT-3
35 Logical Agents 1,2,3 Talk & PPT
36 Knowledge-based agents 1,2,3 Talk & PPT
37 The wumpus world, logic 1,2,3 Talk & PPT
38 Propositional logic: the very simple logic 1,2,3 Talk & PPT
39 Tutorial-8 1,2 Practice
40 Knowledge representation – introduction 1,2,3 Talk & PPT
Approaches to knowledge representation-relational 1,2,3
41 Talk & PPT
knowledge
42 Knowledge represented as logic 1,2,3 Talk & PPT
43 Tutorial-9 1,2 Practice
44 Procedural knowledge 1,2,3 Talk & PPT
45 Knowledge representation using semantic networks 1,2,3 Talk & PPT
46 Inheritance in semantic net 1,2,3 Talk & PPT
47 Tutorial-10 1,2 Practice
48 Gap in the syllabus Seminar
49 Remedial class Practice
50 Test-1
UNIT-4
51 Expert System & Applications – Introduction 1,2,3 Talk & PPT
52 Phases in building expert systems-knowledge engineering 1,2,3 Talk & PPT
53 Knowledge representation 1,2,3 Talk & PPT
54 Tutorial-11 1,2 Practice
55 Expert systems architecture-knowledgebase 1,2,3 Talk & PPT
56 Inference engine, knowledge acquisition 1,2,3 Talk & PPT
57 Expert systems versus traditional systems 1,2,3 Talk & PPT
58 Tutorial-12 1,2 Practice
59 Characteristics of expert systems 1,2,3 Talk & PPT
60 Evolution of expert systems 1,2,3 Talk & PPT
61 Advantages and disadvantages of expert systems 1,2,3 Talk & PPT
62 Tutorial-13 1,2 Practice
Languages for expert system development, applications of
63 1,2,3 Talk & PPT
expert systems
64 Beyond Syllabus Seminar
65 Test-2
UNIT-5
66 Machine Learning Paradigm – Introduction, 1,2,3 Talk & PPT
67 machine learning system 1,2,3 Talk & PPT
68 -components of learning system, 1,2,3 Talk & PPT

CSE Dept, GNITC Page 11


69 Tutorial-14 1,2 Practice
70 rote learning, 1,2,3 Talk & PPT
71 learning by taking advice. 1,2,3 Talk & PPT
72 Supervised & Unsupervised Learning 1,2,3 Talk & PPT
73 Tutorial-15 1,2 Practice
74 supervised concept learning, 1,2,3 Talk & PPT
75 unsupervised concept learning, 1,2,3 Talk & PPT
76 reinforcement learning. 1,2,3 Talk & PPT
77 Tutorial-16 1,2 Practice
78 Beyond syllabus
79 Test-2 1,2,3 Practice
80 Discussion of previous question papers

CSE Dept, GNITC Page 12


Teaching Lesson Plan with Blooms Taxonomy

Name of the Subject : Fundamentals of Artificial Intelligence


Subject Code : 18MC0CS01
Name of Faculty : Umar Farooq
Class & Section : III ME – 3
BTL- Blooms Taxonomy Level
Level 1 - Remembering
Level 2 - Understanding
Level 3 - Applying
Level 4 - Analyzing
Level 5 - Evaluating
Level 6 - Creating

Teaching
Cumm. Time
Topics BTL - Learning
Periods (Min)
Method
10 Attendance and Introduction of AI 1,2 Talk
1 30 Introduction – 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
2 30 What is artificial intelligence 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
3 30 Foundations of artificial Intelligence 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
4 30 Contributions from different fields 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
5 30 History of artificial intelligence 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT/NPTEL
10 Attendance and Discussion of previous topics 1,2 Talk
6 30 History of artificial intelligence 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
7 30 Intelligent Agents 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
8 30 Agents and environments 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
9 30 The concept of rationality 1,2,3 PPT
10 Discussion on topics taught 1,2 Talk
10 Attendance and Discussion of previous topics 1,2 Talk
10 30 The nature of environments 1,2 PPT
10 Discussion on topics taught 1,2 PPT

CSE Dept, GNITC Page 13


Teaching
Cumm. Time
Topics BTL - Learning
Periods (Min)
Method
10 Attendance and Discussion of previous topics 1,2 Talk
11 30 The structure of agents 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
12 30 Applications of AI 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
13 30 Solving Problem by Searching 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
14 30 Problem solving agents 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
15 30 Example problems 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
16 30 Searching for solutions 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
17 30 Uninformed Search Strategies 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
18 30 Breadth first search 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
19 30 Example 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
20 30 Breadth first search 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
21 30 Depth first search 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
22 30 Iterative deepening search 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
23 30 Bidirectional search 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT/NPTEL
10 Attendance and Discussion of previous topics 1,2 Talk
24 30 Example 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
25 30 Comparing uninformed search strategies 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
26 30 Comparing uninformed search strategies 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
Cumm. Time Teaching -
Topics BTL
Periods (Min) Learning

CSE Dept, GNITC Page 14


Method
10 Attendance and Discussion of previous topics 1,2 Talk
27 30 Logical Agents 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
28 30 Knowledge-based agents 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
29 30 The wumpus world, logic 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
30 30 Propositional logic: the very simple logic 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
31 30 Knowledge representation – introduction 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
Approaches to knowledge representation-relational
32 30 1,2,3 PPT
knowledge
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
33 30 Knowledge represented as logic 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
34 30 Procedural knowledge 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
35 30 Knowledge representation using semantic networks 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
36 30 Inheritance in semantic net 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
37 30 Expert System & Applications – Introduction 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
38 30 Phases in building expert systems-knowledge engineering 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
39 30 Knowledge representation 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
40 30 Expert systems architecture-knowledgebase 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
41 30 Inference engine, knowledge acquisition 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
42 30 Expert systems versus traditional systems 1,2 PPT
10 Discussion on topics taught 1,2 PPT
Teaching
Cumm. Time
Topics BTL - Learning
Periods (Min)
Method

CSE Dept, GNITC Page 15


10 Attendance and Discussion of previous topics 1,2 Talk
43 30 Characteristics of expert systems 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
44 30 Evolution of expert systems 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
45 30 Advantages and disadvantages of expert systems 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
Languages for expert system development, applications of
46 30 1,2,3 PPT
expert systems
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
47 30 Machine Learning Paradigm – Introduction 1,2 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
48 30 machine learning system 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
49 30 Components of learning system 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
50 30 Rote learning 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
51 30 Learning by taking advice 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
52 30 Supervised & unsupervised learning 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
53 30 Supervised concept learning 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
54 30 Unsupervised concept learning 1,2,3 PPT
10 Discussion on topics taught 1,2,3 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
55 30 Reinforcement learning 1,2,3 PPT
10 Discussion on topics taught 1,2 PPT
10 Attendance and Discussion of previous topics 1,2 Talk
56 30 Comparison of learning 1,2 PPT
10 Discussion on topics taught 1,2,3 PPT

CSE Dept, GNITC Page 16


QUESTION BANK WITH BLOOMS TAXONOMY

Name of the Subject: Fundamentals of Artificial Intelligence


Subject Code : 18MC0CS01
Name of the Faculty: Umar Farooq
Class : III year I Semester ME-3

BTL- Blooms Taxonomy Level:


Level 1: Remembering
Level 2: Understanding
Level 3: Applying
Level 4: Analyzing
Level 5: Evaluating
Level 6: Creating

PART - A
Course
Q. No. Question BTL
Outcome
UNIT - 1
1 Generalize what is a rational agent? 1 CO1
2 Define Artificial Intelligence? 1 CO1
3 What are the applications of AI? 1 CO1
4 Define an agent? Give example. 1 CO1
5 List the agent types. 1 CO1
6 Write the limitations of AI. 3 CO1
7 Access what is meant by Turing Test? 1 CO1
8 What is specialty of Total Turing Test? 1 CO1
9 Analyze how to measure the performance of an agent? 1 CO1
10 List he properties of environments. 1 CO1

UNIT - 2
1 State the advantages of Breadth First Search. 1 CO2
Define the following terms:
2 1 CO2
1)Goal test 2) Path 3) Successor function 4) Abstraction
3 What is search? What are the steps for problem solving? 1 CO2
4 Define 1) Initial state 2) state space 3) Path cost 1 CO2
5 Compare BFS and DFS. 3 CO2
6 List the properties of DFS. 1 CO2
7 Give examples for Real World and Toy problems. 1 CO2
8 Express the ways to formulate a problem. 1 CO2
9 List the uninformed search techniques. 1 CO2
10 Write about depth limited search. 3 CO2
UNIT - 3
1 What is Tautology? Give example. 1 CO3
2 List the elements of propositional logic. 1 CO3
3 Write about parts of knowledge-based agent. 3 CO3

CSE Dept, GNITC Page 17


4 Write the properties of good knowledge representation. 3 CO3
5 Give steps to apply declarative for KBA. 1 CO3
Express ‘I will visit my friend’s house if and only if she visits me’ in
6 1 CO3
propositional logic
7 Define semantic net. Give example. 1 CO3
8 What are the various approaches for knowledge representation? 1 CO3
Translate the sentence into proposition formulae: I spend money only when
9 I buy clothes or I buy vegetables. 2 CO3

10 List the operations knowledge-based agent 1 CO3


UNIT - 4
1 List out the expert system applications 1 CO4
2 Give characteristics of an expert system. 1 CO4
3 What is knowledge acquisition? 1 CO4
4 Define expert system with components. 1 CO4
5 What is case history? 1 CO4
6 Summarize the capabilities of expert system. 2 CO4
7 How inference engine different from knowledge base? Give reasons. 1 CO4
How many phases in building expert systems? Justfy with one
8 1 CO4
example.
9 List the tasks and responsibilities of knowledge Engineer. 1 CO4
10 Write the advantaged and disadvantages of expert systems. 3 CO4
UNIT - 5
1 Define Rote learning 1 CO5
2 What is learning by taking advice? 1 CO5
3 Define supervised learning. 1 CO5
4 Define unsupervised learning. 1 CO5
5 Define reinforcement learning. 1 CO5
6 What do you understand by training set and test set? 1 CO5
7 What do you understand by machine learning? 1 CO5
8 What is memorization? 1 CO5
9 How is classification different from regression? 1 CO5
10 What is learning? 1 CO5

PART - B
Q. Course
Question BTL
No. Outcome
UNIT - 1
1 Design a medical diagnosis system using PEAS factors. 6 CO1
2 Illustrate utility- based agent with an example. 3 CO1
3 Explain environment types with an example. 2 CO1
4 Describe the fundamental concepts of AI. 2 CO1
5 Explain the history of AI. 2 CO1

CSE Dept, GNITC Page 18


6 Describe learning agents. 2 CO1
7 a) Differentiate between fully observable Vs. partially observable. 4 CO1
b) Explain simple reflex agents with example. 2 CO1
8 What is agent program? Discuss different types of agent programs. 2 CO1
9 Summarize Model-based reflex agent. 2 CO1
10 a) Write about goal-based agent. 1 CO1
b) Distinguish between deterministic Vs. Stochastic. 4 CO1
UNIT - 2
1 Explain BFS with an example? 2 CO2
2 Explain DFS with an example? 2 CO2
3 Explain Depth limited search with an example? 2 CO2
4 Describe iterative deepening depth first search. 2 CO2
5 Explain 8-Queen problem 2 CO2
6 Illustrate the Vaccum world problem formulation? 3 CO2
7 Explain infrastructure for search algorithms. 2 CO2
8 Discuss about solution tree with example. 2 CO2
Write short notes on:
9 3 CO2
a) Touring problem b) VLSI Layout c) Robot Navigation
10 a) Write about Problem-solving agent 3 CO2
b) Compare informed and uninformed search. 4 CO2
UNIT - 3
1 Differentiate Procedural and Declarative Knowledge. 4 CO3
2 Explain knowledge-based agents. 2 CO3
3 Describe Wumpus world. 2 CO3
4 Explain in detail the connectives used in propositional logic. 2 CO3
Draw and describe the semantics network representation with
5 2 CO3
example
Write short notes on:
6 3 CO3
a) completeness b) grounding c) model
Write short notes on:
7 3 CO3
a) Syntax b) Semantics
8 Describe inheritance in semantic network. 2 CO3
9 Explain knowledge represented as logic with example. 2 CO3
Write about programming languages used for knowledge
10 3 CO3
representation.
UNIT - 4
1 Draw the Expert systems architecture. Explain in detail. 3 CO4
List out development languages for system development along with
2 1 CO4
example.
3 Explain applications of Expert systems with example. 2 CO4
Write short notes on
4 i. Capabilities of the Expert System 3 CO4
ii. Limitations of Expert System

CSE Dept, GNITC Page 19


Write short notes on
i) Inference engine
5 ii) knowledge acquisition 3 CO4
iii) Knowledge base System

6 Describe phases in building expert systems. 2 CO4


7 Write about explanation module. 3 CO4
8 Distinguish between Expert systems Vs Traditional system. 4 CO4
9 Discuss guidelines for Expert system. 2 CO4
Write short notes on:
10 3 CO4
a)User interface b) Special interface
UNIT - 5
What are the differences between supervised and unsupervised
1 4 CO5
learning
2 Explain Reinforcement learning concept with the help of example 2 CO5
3 Write the various application of machine learning 3 CO5
4 Describe the different types of methods in the learning. 2 CO5
How is artificial intelligence and machine learning related? Justify
5 4 CO5
with examples.
6 Draw the diagram of learning system and explain its components. 2 CO5
Write short notes on:
7 3 CO5
a) inductive methodology b) deductive methodology
Write short notes on:
8 3 CO5
a) clustering b) self-organizing map c) ART
9 Explain supervised concept learning with example. 2 CO5
10 Describe unsupervised concept learning with example. 2 CO5

CSE Dept, GNITC Page 20


PART – A Solutions

UNIT-I

Question Bank Solutions


[PART-A]
UNIT-1

1. Generalize what is a rational agent?

For each possible percept sequence, a rational agent should select an action that is
expected to maximize its performance measure, given the evidence provided by the
percept sequence and whatever built-in knowledge the agent has.

2. Define Artificial Intelligence?

Artificial Intelligence is an inter-disciplinary field aiming at developing techniques and


tools for solving problems that people at good at.

3. What are the applications of AI?

1. AI in Astronomy 2.AI in Healthcare 3. AI in Gaming 4. AI in Finance 5. AI in Data


Security 6. AI in Social Media 7. AI in Travel & Transport 8. AI in Automotive Industry 9.
AI in Robotics. 10. AI in Entertainment 11. AI in Agriculture 12. AI in E-commerce 13.
AI in education.

4. Define an agent? with an example.

• An agent is anything that can be viewed as perceiving its environment through


sensors and acting upon that environment through actuators.

• Human agent: eyes, ears, and other organs for sensors; hands,legs, mouth, and
other body parts for actuators.

5. List the agent types.


Four basic types in order of increasing generality:
1. Simple reflex agents
2. Model-based reflex agents
3. Goal-based agents
4. Utility-based agents

6. What are the limitations of AI.

• Cannot understand natural language robustly( read & understand News paper)

• Interpret an arbitrary visual scene

• Learn a natural language

CSE Dept, GNITC Page 21


• Construct a plan in dynamic real-time domain

• Exhibit true autonomy and intelligence

7. Access what is meant by Turing test?


The Turing Test is a deceptively simple method of determining whether a machine
can demonstrate human intelligence: If a machine can engage in a conversation
with a human without being detected as a machine, it has demonstrated human
intelligence.
8. What is the specialty of Total Turing Test?
Total Turing Test specialty:
1. Includes a video signal- to test subject’s perceptual abilities
2. Computer vison – to perceive objects
3. Robotics – to manipulate objects and move about
9. Analyze how to measure the performance of an agent?
 The performance measures, which determine the degree of success.
 Agent’s Percept Sequence till now.
 The agent’s prior knowledge about the environment.
 The actions that the agent can carry out.
10. List the properties of environments.
1. Fully observable vs Partially Observable.
2. Static vs Dynamic.
3. Discrete vs Continuous.
4. Deterministic vs Stochastic.
5. Single-agent vs Multi-agent.
6. Episodic vs sequential.
UNIT-2
1.State the advantages of Breadth First Search

1. Used to find the shortest path between vertices


2. Always finds optimal solutions.
3. There is nothing like useless path in BFS,since it searches level by level.
4. Finds the closest goal in less time
2. Define the following tearms 1)Goal test 2) Path 3)Successor function 4)
Abstraction.

1)Goal test : Determines if a given state is the goal state.

2) Path : Sequence of actions leading from one state in the state space to another.

3) Successor function : Describe the set of possible actions

4) Abstraction: The process of removing detail from a representation is called


abstraction.

CSE Dept, GNITC Page 22


3. what is search? What are the steps for problem solving?

An agent with several immediate options of unknown value can:

– decide what to do by examining different possible sequences of actions that


lead to states of known value then choosing the best one.This process is
called a search.

4.Define 1) Initial state 2) state space 3)path cost 4)Goal test

1) Initial state: starting point from which the agent sets out

2) state space : set of all states reachable from the initial state by any sequence of actions

3) Path Cost – assigns numerical cost to each path

5. Compare BFS and DFS.

Sl.No. Key BFS DFS


Definition BFS, stands for Breadth DFS, stands for Depth First
1
First Search. Search.

Data structure BFS uses Queue to find the DFS uses Stack to find the
2
shortest path. shortest path.

Source BFS is better when target is DFS is better when target is


3
closer to Source. far from source.

Suitablity for decision As BFS considers all DFS is more suitable for
tree neighbour so it is not decision tree. As with one
suitable for decision tree decision, we need to traverse
4
used in puzzle games. further to augment the
decision. If we reach the
conclusion, we won.

5 Speed BFS is slower than DFS. DFS is faster than BFS.

Time Complexity Time Complexity of BFS = Time Complexity of DFS is


6 O(V+E) where V is also O(V+E) where V is
vertices and E is edges. vertices and E is edges.

6. List the properties of DFS.

 Complete: Yes (if b is finite)

 Time: 1+b+b2+b3+… +bd + b(bd-1) = O(bd+1)

 Space: O(bd+1) (keeps every node in memory)

 Optimal: Only if cost = 1 per step; not true in general

CSE Dept, GNITC Page 23


Space is the bigger problem (more so than time, but time is still a problem)

7. Give example for real world and toy problems.

Sl.No. Toy problem Real world problem


1 vacuum world route finding
2 8-puzzle touring problems
3 8-queens traveling salesperson
4 cryptarithmetic VLSI layout
5 vacuum agent robot navigation
6 missionaries and assembly sequencing
cannibals

8. Express the ways to formulate a problem?


A problem is defined by four items:
1. initial state
2. actions or successor function
3. goal test (explicit or implicit)
4. path cost (∑ c(x,a,y) – sum of step costs)

9. List the uninformed search techniques.


1. Breadth-first search
2. Uniform-cost search
3. Depth-first search
4. Depth-limited search
5. Iterative deepening search

10. Write about the depth-limited search.

A depth-limited search algorithm is similar to depth-first search with a


predetermined limit. Depth-limited search can solve the drawback of the infinite
path in the Depth-first search. In this algorithm, the node at the depth limit will
treat as it has no successor nodes further. Depth-first search with depth limit l, i.e.,
nodes at depth l have no successors.

Advantages:

Depth-limited search is Memory efficient.

Disadvantages:

o Depth-limited search also has a disadvantage of incompleteness.


o It may not be optimal if the problem has more than one solution.

CSE Dept, GNITC Page 24


UNIT-3

1.What is Tautology? Give example

A formula is a tautology as it is true under all interpretations.

Example a formula P and ~P is a tautology as it is true under all interpretations

2. List the elements of propositional logic?

Simple sentences which are true or false are basic propositions. Larger and more
complex sentences are constructed from basic propositions by combining them
with connectives. Thus propositions and connectives are the basic elements of
propositional logic. Though there are many connectives, we are going to use the
following five basic connectives here:
NOT, AND, OR, IF_THEN (or IMPLY), IF_AND_ONLY_IF.

They are also denoted by the symbols: , , , , respectively.

3. Write about the parts of knowledge based agents?

Knowledge-based agents are composed of two main parts:

 Knowledge-base : Knowledge-base is a central component of a


knowledge-based agent, it is also known as KB. It is a collection of
sentences. These sentences are expressed in a language which is
called a knowledge representation language.
 Inference system : Inference means deriving new sentences from
old. Inference system allows us to add a new sentence to the
knowledge base.

4. What are the properties of good knowledge representation system?

The following properties should be possessed by a knowledge representation


system.

 Representational Adequacy -- the ability to represent the required


knowledge.
 Inferential Adequacy - the ability to manipulate the knowledge
represented to produce new knowledge corresponding to that inferred from
the original.
CSE Dept, GNITC Page 25
 Inferential Efficiency - the ability to direct the inferential mechanisms
into the most productive directions by storing appropriate guides.
 Acquisitional Efficiency - the ability to acquire new knowledge using
automatic methods wherever possible rather than reliance on human
intervention.
5. Give steps to apply declarative approach for KBA?
Declarative approach: We can create a knowledge-based agent by initializing
with an empty knowledge base and telling the agent all the sentences with
which we want to start with. This approach is called Declarative approach.
Declarative knowledge is to know about something.

 It includes concepts, facts, and objects.


 It is also called descriptive knowledge and expressed in declarativesentences.
 It is simpler than procedural language.

6. Express ‘I will visit my friend’s house if and only if she visits me’ in
propositional logic.
P: I will visit my friend’s house, Q: she visits me
Propositional logic : P↔Q
7. Define Semantic net. Give example.
A semantic network is a knowledge base that represents semantic relations
between concepts in a network. This is often used as a form of knowledge
representation. It is a directed or undirected graph consisting of vertices, which
represent concepts, and edges, which represent semantic relations between
concepts, mapping or connecting semantic fields.
Example: a graph database or a concept map.

8. What are the various approaches for knowledge representation?


There are three basic approaches for knowledge representation. They are:
a) Relational knowledge – comprises of objects consisting of attributes
and associated values. Facts are stored as table.
b) Knowledge represented as logic – helps in inferencing easily.
c) Procedural knowledge – encoding of knowledge is done in the form of
procedures to carry our specific tasks based on relevant knowledge.

9. Translate the sentence into proposition formulae: I spend money only when I buy
clothes or I buy vegetables.

CSE Dept, GNITC Page 26


P : I spend money , Q : when i buy clothes , R : I buy vegetables.
P↔(QVR)

10. List operations of Knowledge base agent.

Following are three operations which are performed by KBA in order to show the
intelligent behavior:

1. TELL: This operation tells the knowledge base what it perceives from the
environment.
2. ASK: This operation asks the knowledge base what action it should
perform.
3. Perform: It performs the selected action.

UNIT-IV

1. List out the expert system applications.

Application Description

Design Domain Camera lens design, automobile design.

Diagnosis Systems to deduce cause of disease from


Medical Domain
observed data, conduction medical operations on humans.

Comparing data continuously with observed system or


Monitoring Systems with prescribed behavior such as leakage monitoring in
long petroleum pipeline.

Process Control Systems Controlling a physical process based on monitoring.

Knowledge Domain Finding out faults in vehicles, computers.

Detection of possible fraud, suspicious transactions, stock


Finance/Commerce
market trading, Airline scheduling.

2.Give Characteristics of Expert systems.

1. High level Performance 2. Domain Specificity 3. Good Reliability 4.


Understandable 5. Adequate Response time 6. Use symbolic representations 7.
Linked with Meta knowledge 8. Expertise knowledge 9. Justified Reasoning 10.
Explaining capability 11. Special Programming Languages

CSE Dept, GNITC Page 27


3. What is Knowledge acquisition?

Knowledge acquisition is the process of extracting, structuring an


organizing knowledge from one source, usually human experts, so it can be used in
software such as an Expert System.

4. Define Expert system with components.

An Expert System is an interactive and reliable computer-based decision-making


system which uses both facts and heuristics to solve complex decision-making
problem. Key components of an Expert System are 1) User Interface 2) Inference
Engine 3) Knowledge Base.

5. What is case history?


Case history stores the files created by inference engine using the dynamic
database and is used by the learning module to enrich its knowledge base. Different
cases with solutions are stored in Case Base system and these cases are used for
solving the problems using Case Base-Reasoning(CBR).

6. Summarize the capabilities of expert system.


The expert systems are capable of −

 Advising
 Instructing and assisting human in decision making
 Demonstrating
 Deriving a solution
 Diagnosing
 Explaining
 Interpreting input
 Predicting results
 Justifying the conclusion
 Suggesting alternative options to a problem

7.How inference engine different from knowledge base? Give reasons.

A knowledge base is an organized collection of facts about the system’s domain. An


inference engine interprets and evaluates the facts in the knowledge base in order to
provide an answer.

8. How many phases in building expert systems? Justfy with one example.

CSE Dept, GNITC Page 28


Phase 1: Project initialization

Phase 2: System analysis and design

Phase 3: Rapidprototyping

Phase 4: System development

Phase 5: Implementation

Phase 6: Post-implementation

9. List the tasks and responsibilities of knowledge engineer.

 Ensuring that computer has all the knowledge needed to solve a problem.
 Choosing one or more forms to represent the required knowledge.
 Ensuring efficient usage of reasoning method by computer

10. Write the advantaged and disadvantages of expert systems


Advantages:

 Provides consistent answers for repetitive decisions, processes and tasks.


 Fastens the pace human professional
 Provides improved quality of decision making
 Leads to internal cost saving in companies
 Never forgets to ask a question

Disadvantages:

 Unable to create unusual responses like human beings


 Lacks common sense needed in some decision making.

Unit-V

1.Define Rote Learning.

Rote learning is defined as the memorization of information based on repetition. The


two best examples of rote learning are the alphabet and numbers. Slightly more
complicated examples include multiplication tables and spelling words.

2. What is learning by taking advice?

 This type is the easiest and simple way of learning.

CSE Dept, GNITC Page 29


 In this type of learning, a programmer writes a program to give some instructions to
perform a task to the computer. Once it is learned (i.e. programmed), the system will be
able to do new things.

3. Define supervised learning

Supervised learning is an approach to creating artificial intelligence (AI), where the


program is given labeled input data and the expected output results. In supervised
learning, the aim is to make sense of data toward specific measurements. Example is
a pair consisting of an input object and a desired output value.

4. Define unsupervised learning

Unsupervised learning is the training of machine using information that is neither


classified nor labeled and allowing the algorithm to act on that information without
guidance. Here the task of machine is to group unsorted information according to
similarities, patterns and differences without any prior training of data.

5. Define reinforcement learning

Reinforcement learning is the training of machine learning models to make a sequence


of decisions. The agent learns to achieve a goal in an uncertain, potentially complex
environment. In reinforcement learning, an artificial intelligence faces a game-like
situation.

6. What do you understand by training set and test set

 Training set—a subset to train a model. The process of determining the


ideal parameters comprising a model.

 Test set—a subset to test the trained model.

7.What do you understand by machine learning

Machine learning is an application of artificial intelligence (AI) that provides systems the
ability to automatically learn and improve from experience without being explicitly
programmed.

8.What is memorization

Memorization is the process of committing something to memory. Mental process


undertaken in order to store in memory for later recall items such as experiences, names,

CSE Dept, GNITC Page 30


appointments, addresses, telephone numbers, lists, stories, poems, pictures, maps,
diagrams, facts.

9. How is classification different from regression

Classification is the process of finding or discovering a model or function which helps


in separating the data into multiple categorical classes i.e. discrete values. In
classification, data is categorized under different labels according to some parameters
given in input and then the labels are predicted for the data.

Regression is the process of finding a model or function for distinguishing the data into
continuous real values instead of using classes or discrete values.

10.What is learning?

Learning is a process that improves the knowledge of an AI program by making


observations about its environment. AI learning processes focused on processing a
collection of input-output pairs for a specific function and predicts the outputs for new
inputs.

CSE Dept, GNITC Page 31


Tutorial Class Topics (Sections 1 TO 5)

S. No. Date Topic delivered Teaching AID


Unit-1 Introduction
1 List AI applications. Practice

2 Define ideal rational agent. Practice

Define Turing test. Practice


3
Unit -2 Solving Problem by Searching
4 What is a bidirectional search Practice
algorithm?
5 What is a uniform cost search Practice
algorithm?
6 What is a depth-first search Practice
algorithm?
7 Write the advantages and Practice
disadvantages of uninformed search
Unit-3 Logical agents and Knowledge Representation
8 Write about Representing Simple Practice
Facts in Proposition Logic
Write about various approaches to Practice
9 Knowledge Representation
10 Explain Knowledge Representation Practice
using Semantic net
Unit-4 Expert System & Applications
11 What are expert system? Practice

12 List the characteristics of an expert Practice


system.

13 List the application of Expert Practice


systems

Unit-5 Machine Learning Paradigm


14 What is learning? Practice

15 Define classification. Practice

16 What is rote learning? Practice

CSE Dept, GNITC Page 32


ASSIGNMENT QUESTIONS
Course
Q. No. Question BTL
Outcome
Unit-1
1 Design a medical diagnosis system using PEAS factors. 6 CO1
2 Illustrate utility- based agent with an example. 3 CO1
3 Explain environment types with an example. 2 CO1
4 Describe the fundamental concepts of AI. 2 CO1
5 Explain the history of AI. 2 CO1
Unit-2
1 Explain 8-Queen problem 2 CO2
2 Illustrate the Vaccum world problem formulation? 3 CO2
3 Discuss about solution tree with example. 2 CO2
Write short notes on:
4 3 CO2
a) Touring problem b) VLSI Layout c) Robot Navigation
5 a) Write about Problem-solving agent 3 CO2
b) Compare informed and uninformed search. 4 CO2
Unit-3
1 Describe Wumpus world. 2 CO3
2 Explain in detail the connectives used in propositional logic. 2 CO3
Draw and describe the semantics network representation with
3 2 CO3
example
Write short notes on:
4 3 CO3
a) completeness b) grounding c) model
Write about programming languages used for knowledge
5 3 CO3
representation.
Unit-4
List out development languages for system development along with
1 1 CO4
example.
2 Distinguish between Expert systems Vs Traditional system. 4 CO4
3 Discuss guidelines for Expert system. 2 CO4
Write short notes on:
4 3 CO4
a)User interface b) Special interface
Write short notes on
a) Inference engine
5 3 CO4
b) knowledge acquisition
c) Knowledge base System
Unit-5
1 Explain Reinforcement learning concept with the help of example 2 CO5
2 Draw the diagram of learning system and explain its components. 2 CO5
3 Explain supervised concept learning with example. 2 CO5
4 Describe unsupervised concept learning with example. 2 CO5
How is artificial intelligence and machine learning related? Justify
5 4 CO5
with examples.

CSE Dept, GNITC Page 33


OBJECTIVE TYPE QUESTIONS

UNIT-1

1.Which particular generation of computers is associated with artificial intelligence?

a. Second
b. Fourth
c. Fifth
d. Third
2. The characteristics of the computer system capable of thinking, reasoning and learning
is known is

a. machine intelligence
b. human intelligence
c. artificial intelligence
d. virtual intelligence

3. Which of the following is not Properties of Environment?

a. Discrete / Continuous
b. Static / Dynamic
c. Deterministic / Non-deterministic
d. No agent / Multiple agents

4. What among the following is/are not the example of the intelligent agents ?

a. Human
b. Robot
c. Autonomous spacecraft
d. Hardware

5. Chess is example of which properties ?

a. Discrete
b. Continuous
c. Episodic
d. Non-deterministic

CSE Dept, GNITC Page 34


6. The conference that launched the AI revolution in 1956 was held at:

a. Dartmouth
b. Harvard
c. New York
d. Stanford

7. An agent is composed of ________

a. Architecture
b. Agent Function
c. Perception Sequence
d. Architecture and Program

8. Which of the following is considered to be a pivotal event in the history of AI

a. 1949, Donald O, The organization of Behaviour,


b. 1950, Computing Machinery and Intelligence.
c. 1956, Dartmouth University Conference Organized by John McCarthy
d. 1961, Computer and Computer Sense.

9. Which of the given language is not commonly used for AI?

a. LISP
b. PROLOG
c. Python
d. Perl

10. Turing is an example of _______.

a. Systems that thinks like human


b. Systems that thinks rationally.
c. Systems that act like human
d. Systems that act rationally

11. What is an AI?

a. Making a Machine intelligent

CSE Dept, GNITC Page 35


b. Putting your intelligence into Computer
c. Programming with your own intelligence
d. putting more memory into Computer

12. What is meant by agent's percept sequence?

a. Used to perceive the environment


b. Complete history of actuator
c. Complete history of perceived things
d. None of the mentioned

13. Which environment is called as semi dynamic?

a. Environment does not change with the passage of time


b. Agent performance changes
c. Environment will be changed
d. Environment does not change with the passage of time, but Agent
performance changes

14. What kind of environment is crossword puzzle?

a. Static
b. Dynamic
c. Semi Dynamic
d. None of the mentioned

15. The first AI programming language was called :

a. BASIC
b. FORTRAN
c. IPL
d. LISP

16. Rational agent always does the right things.

a. Yes
b. No

CSE Dept, GNITC Page 36


17. A.M. Turing developed a technique for determining whether a computer could or
could not demonstrate the artificial Intelligence, Presently, this technique is called
__________

a. Turing Test
b. Algorithm
c. Boolean Algebra
d. Logarithm

18. What is the action of task environment in artificial intelligence?

a. Problem
b. Solution
c. Agent
d. Observation

19. Which of these is agent's perceptual inputs at a given instance.

a. Behavior of Agent
b. Percept
c. Percept Sequence
d. Agent Function

20. In Artificial Intelligence (AI), which agent deals with happy and unhappy state?

a. Simple reflex agent


b. Model based agent
c. Learning agent
d. Utility based agent

21. Which were built in such a way that humans had to supply the inputs and interpret
the outputs?

a. Agents
b. AI system
c. Sensor
d. Actuators

22. In which year John McCarthy coined the term Artificial Intelligence?

CSE Dept, GNITC Page 37


a. 1950
b. 1953
c. 1956
d. 1959

23. What is Artificial intelligence?

a. Making a Machine intelligent


b. Playing a Game
c. Putting your intelligence into Computer
d. Programming with your own intelligence

24. A major thrust of AI is in the development of computer functions associated with


human intelligence.

a. TRUE
b. FALSE
c. AI is not associated with human intelligence
d. None of the Above

25. The main tasks of an AI agent are_______.

a. Input and Output


b. Moment and Humanly Actions
c. Perceiving, thinking, and acting on the environment
d. None of the above

26. The conference that launched the AI revolution in 1956 was held at: *

a. Dartmouth
b. Harvard
c. New York
d. Stanford

27. Chess is example of which properties ?

a. Discrete
b. Continuous
c. Episodic

CSE Dept, GNITC Page 38


d. Non-deterministic

28. Satellite Image Analysis System is

a. Episodic
b. Semi-Static
c. Single agent
d. Partially Observable

29. Rationality of an agent does not depends on?

a. performance measures
b. Percept Sequence
c. reaction
d. actions

30. Which of the following areas can not contribute to build an intelligent system?

a. Neuron science
b. Maths
c. Computer Science
d. Geology

31. What among the following is/are not the example of the intelligent agents ?

a. Human
b. Robot
c. Autonomous spacecraft
d. Hardware

32. An AI agent perceives and acts upon the environment using___.

a. Sensors
b. Perceiver
c. Actuators
d. Data

33. What are Agent?

a. An agent is anything that can perceive its environment through sensors

CSE Dept, GNITC Page 39


b. An agent is anything that can change its environment through sensors
c. An agent is anything that can control its environment through sensors
d. None of the Above.

34. If a robot is able to change its own trajectory as per the external conditions, then the
robot is considered as the__

a. Mobile
b. Non-Servo
c. Open Loop
d. Intelligent

35. How many types of agents are there in artificial intelligence?


a. 1
b. 2
c. 3
d. 4

36. A in the term PEAS stands for ________________

a. Angle
b. Acid
c. Actuator
d. Agent

37. Which of the following is not an application of AI?

a. Intelligent robot
b. data security
c. social media
d. content mining

38. A technique that was developed to determine whether a machine could or could not
demonstrate the artificial intelligence known as the___

a. Boolean Algebra
b. Turing Test
c. Logarithm
d. Algorithm

CSE Dept, GNITC Page 40


39. The application/applications of Artificial Intelligence is/are

a. social media
b. astronomy
c. science
d. none

40. LISP was created by

a. John McCarthy
b. Marvin Minsky
c. Alan Turing
d. Allen Newell and Herbert Simon

UNIT-II

1. Which search is implemented with an empty first-in-first-out queue?

a. Depth-first search
b. Breadth-first search
c. Bidirectional search
d. Depth limited search

2. Which search implements stack operation for searching the states?

a. Depth-limited search
b. Depth-first search
c. Breadth-first search
d. Uniform cost search

3. State space is…

a. Representing your problem with variable and parameter


b. Problem you design
c. Your Definition to a problem
d. The whole problem

4. Breadth-first search always expands the ______ node in the current fringe of the
search tree.

CSE Dept, GNITC Page 41


a. Shallowest
b. Child node
c. Deepest
d. Minimum cost

5. The main function of problem-solving agent is to________.

a. Solve the given problem and reach the goal


b. not leading to goal state
c. Traveling salesman problem
d. Agent program

6. Which data structure conveniently used to implement BFS?

a. Stacks
b. Queues
c. Priority Queues
d. List

7. Another name for uninformed search is

a. Heuristic search
b. Uniform-cost search
c. Blind search
d. Depth limited search

8. Is optimality and completeness exist in bidirectional search algorithm?

a. Yes, Yes
b. No, Yes
c. Yes, No
d. No, No

9. Goal-based agents use more advanced _______representation.

a. Simple-action rule.
b. Structured
c. Condition-action rule
d. No rule

CSE Dept, GNITC Page 42


10. What is the main task of a problem-solving agent?

a. Solve the given problem and reach to goal


b. To find out which sequence of action will get it to the goal state
c. Both (a) and (b)
d. None of the mentioned

11. The Process of deciding what actions and states to consider given a goal is called

a. Problem formulation
b. Goal formulation
c. Solution
d. Goal-seeking

12. In which search problem, to find the shortest path, each city must be visited once
only?

a. Map coloring Problem


b. Depth-first search traversal on a given map represented as a graph
c. Finding the shortest path between a source and a destination
d. Travelling Salesman problem

13. What is the space complexity of Depth-first search?

a. O(b)
b. O(bl)
c. O(m)
d. O(bm)

14. The process of looking for a sequence of actions that reaches the goal is called _____

a. assumption
b. Model
c. Learning
d. search

15. Which of the following searching technique takes less memory?

a. Optimal search
b. Breadth-First Search

CSE Dept, GNITC Page 43


c. Linear Search
d. Depth-First Search

16. The starting position of “Play Chess” can be described as an _____.

a. 8X8 array
b. 16X16 array
c. 9X9 array
d. 10X10 array

17. People actually care about________ problems.

a. Toy
b. Real-world
c. dummy
d. game

18. One definition of AI focuses on problem solving methods that process :

a. smell
b. symbols
c. touch
d. algorithms

19. Which search algorithm imposes a fixed depth limit on nodes?

a. Depth-limited search
b. Depth-first search
c. Iterative deepening search
d. Bidirectional search
20. LIFO is ______ where as FIFO is ________
a. Stack, Queue
b. Queue, Stack
c. Priority Queue, Stack
d. Stack. Priority Queue

21. Which of the following search algorithm searches forward from initial state and
backward from goal state till both meet to identify a common state?

CSE Dept, GNITC Page 44


a. Uniform Cost Search
b. Iterative Deepening Depth-First Search
c. Bidirectional Search
d. Breadth First Search

22. Uniform-cost search expands the node n with the __________

a. Lowest path cost


a. Heuristic cost
b. Highest path cost
c. Average path cost
23. Which search algorithm imposes a fixed depth limit on nodes?

a. Depth-limited search
b. Depth-first search
c. Iterative deepening search
d. Bidirectional search

24. Iterative Deepening Search is a form of

a. Depth limited Search


b. Breadth First Search
c. Best First Search
d. Bidirectional Search

25. The 8-puzzle problem consists of _______ board.

a. 4X4
b. 3X3
c. 2X4
d. 8X8
26. Which is used to provide the feedback to the learning element?

a. Critic
b. Actuators
c. Sensor
d. Agent
27. Example for route-finding problems is _________ system.

CSE Dept, GNITC Page 45


a. Out-car
b. Agent Program
c. In-car
d. In-out car

28. 8-puzzle belongs to the family of ______________puzzles

a. Hybrid
b. Sliding-block
c. Relational
d. complete
29. There are ______ kind of formulation.

a. 3
b. 4
c. 2
d. 5

30. What is Branching Factor?

a. Length of the shortest path from initial state to goal state.


b. The average number of child nodes in the problem space graph.
c. A property of an algorithm to always find an optimal solution.
d. Goal Formulation

31. The _______ is a touring problem in which each city must be visited exactly once.
The aim is to find the shortest tour.

a. Finding shortest path between a source and a destination


b. Travelling Salesman problem
c. Map coloring problem
d. Depth first search traversal on a given map represented as a graph

32. What is the main task of a problem-solving agent?

a. Solve the given problem and reach to goal


b. To find out which sequence of action will get it to the goal state
c. Both A and B

CSE Dept, GNITC Page 46


d. None of the Above

33. How many types are available in uninformed search method?

a. 3
b. 4
c. 5
d. 6
34. A search algorithm takes _________ as an input and returns ________ as an output.

a. Input, output
b. Problem, solution
c. Solution, problem
d. Parameters, sequence of actions

35. Depth-first search always expands the ______ node in the current fringe of the search
tree.

a. Shallowest
b. Child node
c. Deepest
d. Minimum cost

36. What is Initial state + Goal state in Search Terminology?

a. Problem Space
b. Problem Instance
c. Problem Space Graph
d. Admissibility

37. When is breadth-first search is optimal?

a. When there is less number of nodes


b. When all step costs are equal
c. When all step costs are unequal
d. All of the above

38. Depth-limited search can be implemented as a _________algorithm.

a. iterative

CSE Dept, GNITC Page 47


b. simple-recursive
c. fixed
d. Utility

39. The process of removing detail from a given state representation is called ______

a. Extraction
b. Abstraction
c. Information Retrieval
d. Mining of data

40. No information given about the problems in _______ search algorithms.

a. informed
b. Semi-Static
c. iterative
d. Uninformed

UNIT-III
1. The central component of knowledge-based agent is ___.
a. logic
b. Knowledge-base
c. language
d. database
2. Instance and isa are two important attributes which supports property of ____
a) Inheritance
b) polymorphism
c) encapsulation
d) none
3. _____ is deriving new sentences from old.
a) results
b) phrases
c) pages
d) inference
4. A Semantic network is ______________.
a) A way of representing knowledge

CSE Dept, GNITC Page 48


b) Data Structure
c) Data Type
d) None of the mentioned
5. The ______ world is cave consisting of rooms connected by passageways.
a) Vaccume
b) Wumpus
c) 8-puzzle
d) toy
6. The terrible Wumpus is a ______ that eats anyone who enters its room.
a) beast
b) wild animal
c) killer tree
d) Shark
7. The _____ theory provides a good basis for understanding frame systems.
a) Goal
b) set
c) strong
d)weak
8. The agent perceives stench means, there Wumpus in nearby ________.
a) Fillers
b) pillars
c) rooms
d) values
9. The semantics define the ______of each sentence w.r.t. each possible world.
a) table
b) relation
c) case
d) truth
10. There exists _____way to infer using semantic networks.
a) 1
b)2
c)3
d)4
11. Real world problems can be easily represented as _________ propositions.

CSE Dept, GNITC Page 49


a. logical
b. physical
c. predicate
d. not
12. Prolog is developed in the year_________.
e. 1975
f. 1972
g. 1976
h. 1978
13. The relation between a sentence and another sentence is called________.
a. Logic
b. Completeness
c. Entailment
d. grounding
14. ______ is connection between logical reasoning and real-world.
a. Preserving
b. Checking
c. Understanding
d. grounding
15. ____________sentences are constructed from simpler sentences.
a. Complex
b. Common
c. Uncommon
d. allowable
16. State True or False: A semantic network is used when one has knowledge that is
best understood as a set of concepts that are related to one another.
a. True
b. false
17. In __________, information is represented as a set of nodes connected by arcs.
a. Syntax
b. Graph
c. Table
d. Semantic net
18. A square is ____________there exists a pit in neighboring square.

CSE Dept, GNITC Page 50


a. Stench
b. Breezy
c. Non-breezy
d. Non-stenchy
19. State True or False: The basic inference mechanism in semantic network is to
follow the links between the nodes.
a. True
b. false
20. An alogorithm that derives only entailed sentences is called _________
a. Check
b. Beck
c. Sound
d. ground
21. ______ handles electronic documents in web systems.
a. SGML
b. Prolog
c. Lisp
d. KL-One
22. ________ is used to construct the complex sentences.
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
23. ________ Quantifiers are there in artificial intelligence.
a) 1
b) 2
c) 3
d) 4
24. How many logical connectives are there in artificial intelligence?
a) 2
b) 3
c) 4
d) 5

CSE Dept, GNITC Page 51


25. Which is used to compute the truth of any sentence?
a) Semantics of propositional logic
b) Alpha-beta pruning
c) First-order logic
d) Both Semantics of propositional logic & Alpha-beta pruning
26. In the ______logic, knowledge is represented in the form of rules and facts.
a. Propositional
b. Predicate
c. First-order
d. relational
27. What kind of clauses are available in Conjunctive Normal Form?
a) Disjunction of literals
b) Disjunction of variables
c) Conjunction of literals
d) Conjunction of variables
28. The main function of knowledge structures is to provide_________.
a. Domain
b. Expertise
c. Represent
d. infer
29. Rule-based expert system incorporates knowledge in the form of ___and facts.
a. Models
b. Learning
c. Rules
d. methods
30. At which state does the propositional literals are complementary?
a) If one variable is less
b) If one is the negation of the other
c) All of the mentioned
d) None of the mentioned
31. Inferencing ______knowledge is not possible in relational knowledge.
a. Old
b. New
c. Logical

CSE Dept, GNITC Page 52


d. illogical
32. _____ is part of relational knowledge.
a. Row
b. Column
c. Table
d. graph
33. In the ______ approach one can verify the correctness of new statements.
a. Graphical
b. Logic
c. Model
d. table
34. The _____knowledge can be easily represented in procedural knowledge.
a. model-specific
b.domain-specific
c. Both
d. none
35. Knowledge base can be organized into ______ structure in extended KR.
a. hierarchical
b. graphical
c. table
d. model
36. ____ in semantic net represents concepts.
a. arc
b. node
c. label
d. edge
37. _____ relation relates specific members of a class.
a. isa
b. isb
c. inst
d. obj
37. Can and has relations known as _______ relations.
a. Object
b. Arc

CSE Dept, GNITC Page 53


c. Property
d. concept
38. ____________node represents objects in the semantic net.
a. Oval
b. Rectangle
c. Circle
d. square
39. Property links are shown as_________ lines for more clarity in semantic net.

a. Solid
b. Dotted
c. Dashed
d. simple

40. ____ language is used to implement semantic net.


a. Prolog

b. KL-one

c. SGML

d. lisp

UNIT-IV
1. Which of the following is not a Capabilities of Expert Systems?
a. Advising
b. Demonstrating
c. Explaining
d. Expanding

2. Which of the following are Components of Expert Systems?

a. Knowledge Base
b. Inference Engine
c. User Interface
d. All of the above

3. Which of the following is incorrect application of Expert System?

A. Design Domain
B. Monitoring Systems
C. Knowledge Domain
D. Systems domain

CSE Dept, GNITC Page 54


4. Which of the following is not a benefits of Expert Systems?

A. Availability
B. Speed
C. Time
D. Less Error Rate

5. What is the form of Knowledge representation?

A. IF-THEN
B. IF-THEN-ELSE
C. IF-ELSE
D. All of the above

6. Which of the following is not a Characteristics of Expert Systems?

A. Understandable
B. Highly responsive
C. Unreliable
D. High performance

7. Which of the following is Capabilities of Expert Systems?

A. Possessing human capabilities


B. Suggesting alternative options to a problem
C. Refining their own knowledge
D. Substituting human decision makers

8. How many Components of Knowledge Base are there?

A. 2
B. 3
C. 4
D. 5

9. Which of the following is incorrect Expert Systems Limitations?

A. Limitations of the technology


B. Difficult knowledge acquisition
C. Easy to maintain
D. High development costs

10. A ______ is nothing but an expert system without knowledge base.

A. Tools
B. shell
C. Expert System
D. knowledge

11. Data, information, and past experience combined together are termed as __________.

CSE Dept, GNITC Page 55


A.Inference
B. Acquisition
C. vision
D. knowledge

12. Expert systems are meant to solve ______ problems.


a. Real-world
b. toy
c. maths
d. chemistry

13. The application/applications of Artificial Intelligence is/are

a) Expert Systems
b) Gaming
c) Vision Systems
d) All of the above

14. Among the given options, which is not the required property of Knowledge
representation?

a. Inferential Efficiency

b. Inferential Adequacy

c. Representational Verification

d. Representational Adequacy

15. Which of the following is an advantage of using an expert system development tool?
a) imposed structure
b) knowledge engineering assistance
c) rapid prototyping
d) all of the mentioned

16. An expert system is __


a. a computer that can answer questions like a human expert
b. a group of scientists who design computer programs
c. a method of producing new words
d. a computer that can feel emotion
17. The explanation facility of an expert system may be used to ____________
a) construct a diagnostic model
b) expedite the debugging process
c) explain the system’s reasoning process
d) explain the system’s reasoning process & expedite the debugging process

CSE Dept, GNITC Page 56


18. ---------------are knowledge based system to which present rules are applied to solve a
particular problem.
a. Expert System
b. AI
c. KBS
d.Base Rule 0

19. Which of the following is not true about expert systems ?


a. Expert systems are collection of human knowledge.
b. Expert systems are expensive too design.
c. Expert system are usually designed to run on small general purpose computers.
d. Maintenance support may be difficult to obtain for an expert system.

20. ------------- attempt to provide the same judgmental advice that human experts such as
doctors provide.
1. Expert System
2. AI
3. KBS
4. RAND

21. Expert system are part of the general area of research known as ------------
a. AI
b. ES
c. STUDENT
d. RAND
22. _____ system is used to diagnose bacterial infection.
a. Miner
b. MYCIN
c. EMYCIN
d. Puff
23. ____Phases are there in ES.
a. 4
b. 6
c. 5
d. 7

CSE Dept, GNITC Page 57


24. ________ phase is used by knowledge engineer to determine important features.
a. testing
b. conceptualization
c. formalization
d. identification
25. Building an ES process is often referred as _____ engineering.
a. chemical
b. knowledge
c. computer science
d. electrical
26. _____ phase involves evaluating performance of system.
a. modeling
b. identification
c. testing
d. verification
27. There are ___ ways of knowledge engineering.
a. different
b. same
c. logical
d. modeling
28. Knowledge engineer and domain expert ________to produce an ES.
a. fight
b. interacts
c. phase
d. creates
29. Domain expert receives _______ from knowledge engineer.
a. responses
b. rules
c. queries
d. test
30. The knowledge engineer extracts ____rules from discussion held with experts.
a. specific
b. general
c. facts and

CSE Dept, GNITC Page 58


d. goal
31. Close collaboration with ______users are must in ES.
a. multiple
b. single
c. end
d. no
32. The ________of ES is the powerful corpus of knowledge.
a. brain
b. database
c. work
d. heart
33. The ____ is another widely used representation in ES.
a. unit
b. digit
c. number
d. network
34. The current knowledge acquisition methods are _______and tedious.
a. fast
b. slow
c. moderate
d. weak
35. Case specific data is included in _______ memory.
a. volatile
b. non-volatile
c. working
d. fixed
36. ___ knowledge consists of facts and rules.
a. dynamic
b. movable
c. process
d. static
37. Forward chaining is also known as _________ method.
a. data-driven
b. goal

CSE Dept, GNITC Page 59


c. specific
d. inference
38. OPS5 is based on ______________reasoning.
a. backward-chaining
b. forward-chaining
c. both
d. none
39. Different cases with solutions are stored in ______Base System.
a. data
b. logic
c. Case
d. word
40. LISP is based on _____________calculus.
a. Differential
b. integral
c. beta
d. lambda

UNIT-5

1. What is Machine learning?


a) The autonomous acquisition of knowledge through the use of computer programs

b) The autonomous acquisition of knowledge through the use of manual programs

c) The selective acquisition of knowledge through the use of computer programs

d) The selective acquisition of knowledge through the use of manual programs

2. Which of the factors affect the performance of the learner system does not include?
a) Representation scheme used

b) Training scenario

c) Type of feedback

d) Good data structures

3. Different learning methods does not include?

CSE Dept, GNITC Page 60


a) Memorization

b) Analogy

c) Deduction

d) Introduction

4. How many things are concerned in the design of a learning element?


a) 1

b) 2

c) 3

d) 4

5. What is used in determining the nature of the learning problem?


a) Environment

b) Feedback

c) Problem

d) All of the mentioned

6. Automated vehicle is an example of ______


a) Supervised learning

b) Unsupervised learning

c) Active learning

d) Reinforcement learning

7.Which of the following is an example of active learning?


a) News Recommender system

b) Dust cleaning machine

c) Automated vehicle

d) None of the mentioned

8. In which of the following learning the teacher returns reward and punishment to learner?
a) Active learning

b) Reinforcement learning

c) Supervised learning

CSE Dept, GNITC Page 61


d) Unsupervised learning

9.Which of the following is the component of the learning system?


a) Goal

b) Model

c) Learning rules

d) All of the mentioned

10.Which of the following is also called exploratory learning?


a) Supervised learning

b) Active learning

c) Unsupervised learning

d) Reinforcement learning

11. In an Unsupervised learning ____________


a) Specific output values are given

b) Specific output values are not given

c) No specific Inputs are given

d) Both inputs and outputs are given

12. How many types of Machine Learning are there?

a) 1

b) 2

c) 3

d) 4

13. What is Machine learning?

a) The autonomous acquisition of knowledge through the use of computer programs

b) The autonomous acquisition of knowledge through the use of manual programs

c) The selective acquisition of knowledge through the use of computer programs

d) The selective acquisition of knowledge through the use of manual programs

14.Which of the factors affect the performance of the learner system does not include?
a) Representation scheme used

CSE Dept, GNITC Page 62


b) Training scenario

c) Type of feedback

d) Good data structures

15.Different learning methods does not include?


a) Memorization

b) Analogy

c) Deduction

d) Introduction

16.How many things are concerned in the design of a learning element?


a) 1

b) 2

c) 3

d) 4

17. What is used in determining the nature of the learning problem?


a) Environment

b) Feedback

c) Problem

d) All of the mentioned

18.The components of learning systems are______


a. 6

b. 5

c. 7

d. 4

19.The job of ____________is to inform performance to learning component.


a. user

b. critic

c. manager

d. tester

20. In which of the following learning the teacher returns reward and punishment to
learner?

CSE Dept, GNITC Page 63


a) Active learning

b) Reinforcement learning

c) Supervised learning

d) Unsupervised learning

21.Which of the following is the component of the learning system?


a) Goal

b) Model

c) Learning rules

d) All of the mentioned

22.Which of the following is also called exploratory learning?


a) Supervised learning

b) Active learning

c) Unsupervised learning

d) Reinforcement learning

23. In an Unsupervised learning ____________


a) Specific output values are given

b) Specific output values are not given

c) No specific Inputs are given

d) Both inputs and outputs are given

24.How many types of Machine Learning are there?


a. 1

b. 2

c. 3

d. 4

25. _______learning involves one-to-one mapping.

a. Rote

b. supervised

c. unsupervised

CSE Dept, GNITC Page 64


d. none

26. Which ONE of the following are regression tasks?

A) Predict the age of a person

B) Predict the country from where the person comes from

C) Predict whether the price of petroleum will increase tomorrow

D) Predict whether a document is related to science

27. Which of the following is a supervised learning problem?

A) Grouping people in a social network.

B) Predicting credit approval based on historical data

C) Predicting rainfall based on historical data

D) all of the above

28. One of the most common uses of Machine Learning today is in the domain of _____.

A) Expert system

B) Unsupervised learning

C) Combination of supervised and unsupervised learning

D) Robotics

29. To make the _______manageable information is generalized.

a. solution
b. problem
c. program
d. system
30. In regression the output is
A) Discrete.
B) Continuous and always lies in a finite range.

C) Continuous.
D) May be discrete or continuous.
31. What category of machine learning algorithm finds patterns in the data when the data
is not labeled?

CSE Dept, GNITC Page 65


a) Data prophecy
b) Unsupervised learning
c) Supervised learning
d) Semi Supervised learning
32. ML is the field of AI consisting of learning algorithm that

a) Improve their performance


b) At executing come task
c) Over time with experience
d) All of above
33. There are ___ basic approaches to advice taking.

a. three

b. four

c. two

d. five

34. In many programs, ____evaluation functions can be used to reduce search space.

a. static

b. dynamic

c. maths

d. engineering

35. Both inputs and ____are observed in supervised learning.

a. learning

b. testing

c. outputs

d. middle nodes

36. There is no information available about the _____outputs in the unsupervised learning.

a. wrong

b. correct

c. no

d. more

37. Arthur Samuel developed ________playing program.

CSE Dept, GNITC Page 66


a. Chess

b Tic-tac-toe

c. Checker
d. Go

38. In the ____model, the number of clusters can be varied according to the problem size.

a. SOM

b. Back-Prop

c. CNN

d. ART

39. ______ function is part of reinforcement learning.

a. goal

b. math

c. utility

d. sigmoid

40. ART networks are used in ______recognition tasks.

a. pattern

b. task

c. goal

d. letter

CSE Dept, GNITC Page 67

You might also like