Scribd
Upload
3 views

AI IMP

The document compares Breadth First Search (BFS) and Depth First Search (DFS), highlighting their differences in data structure usage, efficiency, and application suitability. It also discusses the architecture of rule-based expert systems, emphasizing the importance of knowledge bases and knowledge engineering. Additionally, it touches on various concepts in reinforcement learning, perceptrons, genetic algorithms, and Q functions in the context of optimal policy determination.

Uploaded by

elprofessor772023
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
3 views

AI IMP

The document compares Breadth First Search (BFS) and Depth First Search (DFS), highlighting their differences in data structure usage, efficiency, and application suitability. It also discusses the architecture of rule-based expert systems, emphasizing the importance of knowledge bases and knowledge engineering. Additionally, it touches on various concepts in reinforcement learning, perceptrons, genetic algorithms, and Q functions in the context of optimal policy determination.

Uploaded by

elprofessor772023
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/ 3

1.

Difference between BFS and DFS

BFS DFS
BFS stands for Breadth First Search. DFS stands for Depth First Search.

BFS uses Queue data structure for DFS uses Stack data structure.
finding the shortest path.
BFS builds the tree level by level. DFS builds the tree sub-tree by
sub-tree.
BFS does not use the backtracking DFS uses backtracking to traverse all
concept. the unvisited nodes.
BFS is more suitable for searching DFS is more suitable when there are
vertices closer to the given source. solutions away from source.
BFS is slower than DFS. DFS is faster than BFS.
It works on the concept of FIFO It works on the concept of LIFO
(First In First Out). (Last In First Out).
In BFS, there is no problem of In DFS, we may be trapped into
trapping into finite loops. infinite loops.
It is not memory efficient as it It is memory efficient as it requires
requires more memory than DFS. less memory than BFS.
BFS is used in various applications DFS is used in various applications
such as bipartite graphs, shortest such as acyclic graphs and finding
paths, etc. strongly connected components etc.
2.Draw and explain the architecture of rule-based expert system architecture.
● “An expert system is a computer system that emulates, or acts in all respects,
with the decision-making capabilities of a human expert.”
● Expert Systems = knowledge-based systems = knowledge-based expert
systems.
● Rule bases system is same as the production system.
● When we creating and maintain the production system and find initial state
to goal state then rule base system is used.
● Learning module and history file are not common components of expert
systems when they are provided they are used to assist in building and
refining the knowledge base.

HOW EXPERT SYSTEMS WORK?


▪ The strength of an ES derives from its knowledge base - an organized collection of
facts and heuristics about the system's domain.
▪ An ES is built in a process known as knowledge engineering, during which
knowledge about the domain is acquired from human experts and other sources by
knowledge engineers.
3. Explain exploration and exploitation in Reinforcement Learning in detail.
4. what is Perceptron? Why we use Multi-Layer Perceptron? Explain Multi-Layer Perceptron
for XOR function.
5.Draw Genetic algorithm flowchart and explain all Genetic operators with example.
6.explain the concepts of crossover and mutation in genetic algorithm and provide an overview
of three different operations and one mutation operation
7.What is Policy function? Explain stationary and non-stationary policy.
8.explain all equations of Q functions for infinite horizon.what is policy and how can we find
optimal policy by using Q functions

You might also like