FAM QUESTION BANK WITH ANSWER

CHAPTER-1- Introduction to AI(8Marks)

Q1.What is AI? And Scope of AI?(2m)
Ans- It is a branch of computer science by which we can create intelligent machines which
can behave like a human, think like humans, and able to make decisions
o SCOPE OF AI: With the help of AI, you can create such software or devices which can
solve real-world problems very easily and with accuracy such as health issues,
marketing, traffic issues, etc.

o With the help of AI, you can create your personal virtual Assistant, such as Cortana,
Google Assistant, Siri, etc.

o With the help of AI, you can build such Robots which can work in an environment
where survival of humans can be at risk.

o AI opens a path for other new technologies, new devices, and new Opportunities.

Q2. Difference between AI & ML(4M)

Artificial Intelligence Machine learning

Artificial intelligence is a technology Machine learning is a subset of AI which allows a

which enables a machine to simulate
human behavior. machine to automatically learn from past data wi
programming explicitly.

The goal of AI is to make a smart The goal of ML is to allow machines to learn from
computer system like humans to solve
complex problems. data so that they can give accurate output.

In AI, we make intelligent systems to In ML, we teach machines with data to perform a
perform any task like a human.
particular task and give an accurate result.

Machine learning and deep learning are Deep learning is a main subset of machine learnin
the two main subsets of AI.

AI has a very wide range of scope. Machine learning has a limited scope.

AI is working to create an intelligent Machine learning is working to create machines th

system which can perform various
complex tasks. can perform only those specific tasks for which th
 are trained.

AI system is concerned about maximizing Machine learning is mainly concerned about accu
the chances of success.
and patterns.

The main applications of AI are Siri, The main applications of machine learning are On
customer support using catboats,
Expert System, Online game playing, recommender system, Google search algori
intelligent humanoid robot, etc. , Facebook auto friend tagging suggestions,

On the basis of capabilities, AI can be Machine learning can also be divided into mainly
divided into three types, which
are, Weak AI, General AI, and Strong types that are Supervised learning, Unsuperv
AI. learning, and Reinforcement learning.

Q3. Differentiate between Natural(human) Intelligence and Artificial Intelligence.(4M)

Q4. What are different types of AI?(4M)

AI type-1: Based on Capabilities
1. Weak AI or Narrow AI:
o Narrow AI is a type of AI which is able to perform a dedicated task with
intelligence.The most common and currently available AI is Narrow AI in the world of
Artificial Intelligence.

o Narrow AI cannot perform beyond its field or limitations, as it is only trained for one
specific task. Hence it is also termed as weak AI. Narrow AI can fail in unpredictable
ways if it goes beyond its limits.

o Apple Siriis a good example of Narrow AI, but it operates with a limited pre-defined
range of functions.

2. General AI:
o General AI is a type of intelligence which could perform any intellectual task with
efficiency like a human.

o The idea behind the general AI to make such a system which could be smarter and
think like a human by its own.

3. Super AI:
o Super AI is a level of Intelligence of Systems at which machines could surpass human
intelligence, and can perform any task better than human with cognitive properties.
It is an outcome of general AI.

o Some key characteristics of strong AI include capability include the ability to think, to
reason, solve the puzzle, make judgments, plan, learn, and communicate by its own.

Artificial Intelligence type-2: Based on functionality

1. Reactive Machines
 o Purely reactive machines are the most basic types of Artificial Intelligence.

o Such AI systems do not store memories or past experiences for future actions.

o These machines only focus on current scenarios and react on it as per possible best
action.

2. Limited Memory
o Limited memory machines can store past experiences or some data for a short
period of time.

o These machines can use stored data for a limited time period only.

3. Theory of Mind
o Theory of Mind AI should understand the human emotions, people, beliefs, and be
able to interact socially like humans.

o This type of AI machines are still not developed, but researchers are making lots of
efforts and improvement for developing such AI machines.

4. Self-Awareness
o Self-awareness AI is the future of Artificial Intelligence. These machines will be super
intelligent, and will have their own consciousness, sentiments, and self-awareness.

o These machines will be smarter than human mind.

o Self-Awareness AI does not exist in reality still and it is a hypothetical concept.

Q5.List and Describe the components of AI.(4M)

AI is a vast field for research and it has got applications in almost all possible domain. By
keeping this in mind, research in AI has focussed mainly on the following components of AI:
1. Learning

2. Reasoning

3. Problem Solving

4. Perception

5. Knowledge representation

6. Language understanding.

1. Learning
Learning is a very essential part of AI and it happens in a number of different forms. The
simplest form of learning is by trial and error. In this form, the program remembers the
section that has given the desired output and discards the other trial actions and learns by
itself. For example, in chess (program) mate-in-one chess problems might try out moves at
random until one is found that achieves mate.
2. Reasoning
Reasoning is also called as logic or generating judgments from the given set of facts. The
reasoning is carried out based on a strict rule of validity to perform a specified task.
Reasoning can be of two types, deductive or inductive. The deductive reasoning is in which
the truth of the premised guarantees the truth of the conclusion while, in case of inductive
reasoning, the truth of the premises supports the conclusion but it cannot be fully
dependent on the premises.
3. Problem Solving
AI addresses a huge variety of problems. For example, finding out winning moves on the
board games, planning actions in order to achieve the defined task, identifying various
objects from given images, etc. Problem-solving methods are mainly divided into two types
special-purpose and general-purpose methods
4. Perception
In order to work in the environment, intelligent agents need to scan the environment
and the various objects in it by means of different sense-organs, real or artificial. Agent scans
the environment using sense organs like camera, temperature sensor, etc. This is called
perception.
5. Knowledge representation
The information obtained from the environment through sensors may not be in the
format required by the system. Hence, it needs to be represented in standard formats for
further processing like learning various patterns, deducing inference, comparing with past
objects, etc. There are various knowledge representation techniques like Prepositional logic
and First-order logic.
6. Language understanding
Natural Language Processing, involves machines or robots to understand and process
the language that human speaks, and infer knowledge from the speech input. It also involves
the active participation from a machine in the form of dialog i.e. NLP aims at the text or
verbal output from the machine or robot. The input and output of an NLP system can be
speech and written text respectively.
Q6. Explain Applications of AI?(4M)
Ans: 1. AI in Astronomy
o Artificial Intelligence can be very useful to solve complex universe problems. AI
technology can be helpful for understanding the universe such as how it works,
origin, etc.

2. AI in Healthcare
 o In the last, five to ten years, AI becoming more advantageous for the healthcare
industry and going to have a significant impact on this industry.

o Healthcare Industries are applying AI to make a better and faster diagnosis than
humans. AI can help doctors with diagnoses and can inform when patients are
worsening so that medical help can reach to the patient before hospitalization.

3. AI in Gaming
o AI can be used for gaming purpose. The AI machines can play strategic games like
chess, where the machine needs to think of a large number of possible places.

4. AI in Finance
o AI and finance industries are the best matches for each other. The finance industry is
implementing automation, chatbot, adaptive intelligence, algorithm trading, and
machine learning into financial processes.

5. AI in Data Security
o The security of data is crucial for every company and cyber-attacks are growing very
rapidly in the digital world. AI can be used to make your data more safe and secure.
Some examples such as AEG bot, AI2 Platform,are used to determine software bug
and cyber-attacks in a better way.

6. AI in Social Media
o Social Media sites such as Facebook, Twitter, and Snapchat contain billions of user
profiles, which need to be stored and managed in a very efficient way. AI can
organize and manage massive amounts of data. AI can analyze lots of data to identify
the latest trends, hashtag, and requirement of different users.

7. AI in Travel & Transport

o AI is becoming highly demanding for travel industries. AI is capable of doing various
travel related works such as from making travel arrangement to suggesting the
hotels, flights, and best routes to the customers. Travel industries are using AI-
powered chatbots which can make human-like interaction with customers for better
and fast response.

8. AI in Automotive Industry
o Some Automotive industries are using AI to provide virtual assistant to their user for
better performance. Such as Tesla has introduced TeslaBot, an intelligent virtual
assistant.

o Various Industries are currently working for developing self-driven cars which can
make your journey more safe and secure.
9. AI in Robotics:
o Artificial Intelligence has a remarkable role in Robotics. Usually, general robots are
programmed such that they can perform some repetitive task, but with the help of
AI, we can create intelligent robots which can perform tasks with their own
experiences without pre-programmed.

o Humanoid Robots are best examples for AI in robotics, recently the intelligent
Humanoid robot named as Erica and Sophia has been developed which can talk and
behave like humans.

10. AI in Entertainment
o We are currently using some AI based applications in our daily life with some
entertainment services such as Netflix or Amazon. With the help of ML/AI
algorithms, these services show the recommendations for programs or shows.

11. AI in Agriculture
o Agriculture is an area which requires various resources, labor, money, and time for
best result. Now a day's agriculture is becoming digital, and AI is emerging in this
field. Agriculture is applying AI as agriculture robotics, solid and crop monitoring,
predictive analysis. AI in agriculture can be very helpful for farmers.

12. AI in E-commerce
o AI is providing a competitive edge to the e-commerce industry, and it is becoming
more demanding in the e-commerce business. AI is helping shoppers to discover
associated products with recommended size, color, or even brand.

13. AI in education:
o AI can automate grading so that the tutor can have more time to teach. AI chatbot
can communicate with students as a teaching assistant.

o AI in the future can be work as a personal virtual tutor for students, which will be
accessible easily at any time and any place.
Q7.Draw and explain the structure of Agents?(4M)

Percepts: These are the inputs that the agent receives from the environment. They can be
sensory data, such as images or sounds, or they can be symbolic data, such as the position of
objects in the environment.
Actions: These are the outputs that the agent produces. They can be physical actions, such
as moving or picking up objects, or they can be symbolic actions, such as requesting
information from the environment.
Agent program: This is the software that controls the agent's behavior. It takes the percepts
as input and produces the actions as output. The agent program is typically implemented as
a computer program, but it can also be implemented in hardware.
Goals: These are the things that the agent is trying to achieve. Goals can be simple, such as
reaching a certain location, or they can be complex, such as winning a game.
Environment: This is the world that the agent is interacting with. The environment can be
physical, such as a room or a city, or it can be simulated, such as a computer game
Q8.What is Agent? And types of Agents?(4M)
Ans: An agent is a component of an AI system that takes actions or makes decisions based
on the information it perceives from the environment.
- For instance, a robot agent uses sensors to gather information from its surroundings to
perform specific actions.
-Similarly, a human agent uses sensory organs to perceive the environment and makes
decisions regarding actions for the body's parts.
Types of Agents:
1. Simple Reflex Agent:-- Responds to stimuli based on predefined rules and conditions.
Actions are taken without considering the history of percepts.
Example: A thermostat that turns the heater on or off based on the temperature.
2. Model-Based Reflex Agent:-- Maintains an internal model of the world to track aspects of
the environment. Uses this model to predict the outcomes of actions and make decisions
accordingly.
Example: A self-driving car that uses a map and sensor data to navigate roads.
3. Goal-Based Agent:-- Operates based on a predefined goal or set of goals. Evaluates
different actions to determine which ones will help achieve its goals.
Example: A navigation system that plans a route to a destination.
4. Utility-Based Agent:-- Considers the utility (or value) of different possible actions. Chooses
the action that maximizes its overall utility, aiming for the best possible outcome.
Example: An investment bot that chooses stocks based on their potential return and risk.
5. Learning Agent:- Improves its performance over time by learning from past experiences
and interactions.- Adapts its behavior based on feedback from the environment.
Example: A recommendation system that personalizes suggestions based on user
preferences and behavior.

Q9.What is the Turing Test in AI with a Diagram?(4M)

Ans: The Turing Test, introduced by Alan Turing in his 1950 paper "Computing Machinery
and Intelligence," is a measure of a machine's ability to exhibit intelligent behaviour
indistinguishable from that of a human. The test involves a human interrogator who engages
in a natural language conversation with both a human and a machine without knowing
which is which.
If the interrogator cannot reliably distinguish the machine from the human based on the
conversation, the machine is said to have passed the Turing Test.
Although the Turing Test has faced criticism for being anthropocentric (Human-cantered), it
remains a widely accepted benchmark for evaluating the progress of artificial intelligence.
Key Points:- Objective: To evaluate a machine's ability to mimic human-like intelligence.-
Method: A human interrogator converses with both a human and a machine in a text-based
format, without knowing which is which.
Criterion for Passing: The machine passes the test if the interrogator cannot reliably tell the
machine from the human based solely on the conversation.
Significance: Despite its criticisms, the Turing Test remains a significant benchmark in the
field of AI for assessing machine intelligence.
Q10. Explain Nature of the Environment.(4M)
Ans: In AI, the environment encompasses everything outside the agent, including the
physical world, other agents, and available information. The nature of the environment
significantly influences the complexity of the agent's tasks and the agent's design. Key
Characteristics:
1. Fully vs. Partially Observable:- Fully Observable: The agent has access to all relevant
information about the environment's current state.
Partially Observable: The agent has only partial or noisy information about the
environment.
2. Deterministic vs. Stochastic:- Deterministic: Outcomes of actions are completely
determined by the current state.
Stochastic: Outcomes involve randomness or uncertainty.
3. Episodic vs. Sequential:- Episodic: Actions are divided into separate episodes with no
dependencies between them.
Sequential: Actions have long-term impacts on future states.
4. Static vs. Dynamic:- Static: The environment remains fixed and does not change over time.
Dynamic: The environment changes over time due to the agent's actions or external factors.
These characteristics influence the agent's design, including the types of sensors and
actuators required, the models and algorithms for reasoning and planning, and the learning
algorithms used to enhance performance
Q11.What is the concept of Rationality?(2M)
Ans: The concept of rationality is central to AI research, as it provides a way to evaluate the
performance of AI agents. If an AI agent is able to act rationally, then it is likely to be successful in
achieving its goals. There are a number of different ways to formalize the concept of rationality in AI:

Utility Theory:-- Utility theory is a mathematical framework for measuring the value of different
outcomes.

In AI, utility theory can be used to define the goals of an agent and to measure the effectiveness of
different actions in achieving those goals.

Agents strive to maximize their utility, which represents their overall satisfaction or benefit from
different outcomes.

Decision Theory:-- Decision theory is a mathematical framework for making decisions under
uncertainty.

In AI, decision theory can help agents choose actions in situations where they do not know the full
state of the world.

It involves evaluating the probabilities and outcomes of various actions to make the best possible
decision under uncertainty.

CHAPTER 2.PROBLEM SOLVING(16M)

Q12. What is Search Algorithms in Artificial Intelligence?(2M)
Ans: Search algorithms in AI are systematic methods used to explore possible solutions to a
problem by navigating through the problem space. They are essential in fields like
pathfinding, game playing, and automated planning, where the goal is to find an optimal or
satisfactory solution from many possible solutions.
Examples include Breadth-First Search (BFS), Depth-First Search (DFS), and A* search.
Q13. Explain terminologies of Artificial Intelligence.(2M)
Ans: Search: The process of navigating through a problem space to find a solution.
State: A configuration of the problem at a particular point in time.
Action: An operation that transitions the system from one state to another.
Transition Model: Describes how actions transform one state into another.
Path Cost: The total cost associated with a path from the initial state to a goal state.
Solution: A sequence of actions leading from the initial state to a goal state.
Optimal Solution: The least-cost path from the initial state to a goal state.
Q14. Explain properties of Search Algorithms. (2M)
Ans: Completeness: An algorithm is complete if it guarantees finding a solution if one exists.
Optimality: An algorithm is optimal if it guarantees finding the least-cost solution among all
possible solutions.
Time Complexity: Measures the time required for the algorithm to find a solution, typically
expressed in terms of the number of nodes generated or explored.
Space Complexity: Evaluates the memory required by the algorithm during the search
process, often measured by the maximum number of nodes stored in memory at any given
time
Q15. Explain types of Search Algorithms. (4M)
Ans: There are 2 main categories of search algorithms: uninformed search and informed
search (heuristic search).

1. Uninformed Search Algorithms: Uninformed search algorithms do not use any domain-
specific knowledge or heuristics to guide the search. They rely solely on the problem
definition and explore the search space blindly.
Breadth-First Search (BFS): BFS explores the search space level by level, starting from the
root node and expanding all its children before moving to the next level. It is particularly
useful for finding the shortest path in unweighted graphs.
Depth-First Search (DFS): DFS explores as far as possible along each branch before
backtracking. It follows a path from the root node to a leaf node before exploring other
branches, making it suitable for scenarios where solutions are deep in the search tree.
Uniform Cost Search (UCS): UCSexpands the least-cost node first, prioritizing paths with
lower cumulative costs from the start node. This makes it effective for finding the least-cost
path in weighted graphs.
Depth-Limited Search: Depth-Limited Search is a variant of DFS that limits the depth of
exploration to a fixed depth limit, preventing infinite loops in infinite search spaces. It is
useful when there is prior knowledge about the depth of the solution.
Iterative Deepening Depth-First Search (IDDFS): IDDFS combines the space efficiency of DFS
and the completeness of BFS by repeatedly performing depth-limited searches with
increasing depth limits until a solution is found. It is effective for large search spaces with
unknown depth.
Bidirectional Search: Bidirectional Search simultaneously performs two searches: one
forward from the initial state and one backward from the goal state, meeting in the middle
to reduce the search space. It is efficient for finding solutions in bidirectional problems.
2. Informed Search Algorithms: Informed search algorithms use heuristics or additional
domain-specific information to guide the search process more efficiently towards the goal.
Greedy Best-First Search: Greedy Best-First Search uses a heuristic function to select the
node that appears to be closest to the goal, based on the estimated cost. It aims to reduce
search time by making informed decisions.
A* Search: A* Search combines the actual cost from the start node to the current node and
the estimated cost from the current node to the goal (heuristic) to select the path that
minimizes the total estimated cost. It is widely used for its balance of optimality and
efficiency
Q16. Define Heuristic Search techniques. (2M)
Ans: Heuristic search techniques use heuristic functions to estimate the cost from the
current state to the goal state, guiding the search process more efficiently towards the goal.
These techniques aim to reduce the search time by making educated guesses.
Q17. Explain different types of Heuristic Search techniques. (4 marks)
Ans: 1. Generate and Test: Generate and Test is a heuristic search technique that involves
generating potential solutions and testing them against the problem's constraints to see if
they are valid solutions.
Algorithm Steps:
Generate: Produce a possible solution.
Test: Check if the generated solution satisfies the problem's constraints.
Accept/Reject: If the solution meets the criteria, accept it; otherwise, generate and test
another solution.
Examples: Solving puzzles by trying different configurations. Finding a suitable candidate for
a job by reviewing various applications.
2. A* Search: A* is an informed search algorithm that finds the least-cost path from a start
node to a goal node using a heuristic to estimate the cost to reach the goal.
Key Features: Combines features of both uniform-cost search and greedy best-first search;
uses a cost function f(n) = g(n) + h(n).
Algorithm Steps:
Initialize the open list with the start node.
Loop until the open list is empty or the goal is reached.
Select the node with the lowest f(n) value.
Expand the selected node and update the costs of its neighbors.
Add the neighbors to the open list.
Repeat until the goal node is reached or the open list is empty
Examples: Pathfinding in video games. Navigation systems like GPS
3. Hill Climbing : Hill Climbing is an optimization algorithm that iteratively makes changes to a
solution to improve it, moving towards the direction of increasing value or "uphill."

Key Features: Uses a heuristic function to evaluate the value of neighbouring solutions; aims for local
optimization.

Algorithm Steps: Start with an initial solution.

Evaluate the neighbouring solutions.

Move to the neighbour with the highest value.

Repeat the process until no better neighbour is found.

Examples: Traveling Salesman Problem: improving the tour by swapping the order of cities.
Maximizing profit in a business scenario

Q18.What are the key properties of A* algorithm.(4M)

Ans: Properties of A* Algorithm:

1. Admissibility: The heuristic function must be admissible, meaning it never overestimates
the cost to the goal. This ensures that A* will always find the shortest path.
2. Efficiency: A* is efficient because it expands nodes likely to be on the shortest path. The
priority queue is sorted by the estimated cost to the goal, so nodes with the lowest
estimated cost are expanded first.
3. Flexibility: The algorithm is flexible and can solve various problems by customizing the
heuristic function. For example, in the 8-puzzle problem, the heuristic could estimate the
number of misplaced tiles.
4. Optimality: If the heuristic function is both admissible and consistent (monotonic), A* is
guaranteed to find the optimal solution. A consistent heuristic ensures that the estimated
cost is always less than or equal to the estimated cost from any neighbouring node plus the
step cost to that neighbour.
Q19. Define Generate-and-Test approach in Problem Solving.(2M)
Ans: The Generate-and-Test approach in problem-solving involves generating potential
solutions and then testing them to identify the correct one.
This method is iterative and involves systematic exploration of the solution space.
Algorithm Steps:
1. Generate: Create potential solutions using a defined method.
2. Test: Evaluate each generated solution to check if it meets the desired goal.
3. Select: If a solution meets the criteria, select it as the answer. If not, go back to the
generation step and produce new solutions.
4. Repeat: Continue the process until an acceptable solution is found or the search space is
exhausted.
Q20. How does Hill Climbing search algorithm work and what are its limitation?
Ans: Hill Climbing is a heuristic search algorithm used in optimization problems to find the
best possible solution by incrementally improving the current state. It's a simple and widely
used algorithm due to its ease of implementation and efficiency in solving certain types of
problems.
Algorithm Steps:
1. Initialize: Start with an initial solution.
2. Evaluate: Assess the current solution's value.
3. Generate Neighbours: Create neighbouring solutions by making small changes to the
current solution.
4. Select Best Neighbour: Choose the neighbour with the highest value.
5. Move: Transition to the best neighbouring solution.
6. Repeat: Continue evaluating and moving until no better neighbours are found (local
maximum)
Limitations of Hill Climbing:
1.Stuck in Local Optima: The algorithm can easily get stuck in a local maximum or minimum,
thinking it has found the best solution when a better one exists elsewhere in the solution
space.
Plateaus: Occurs when a region in the solution space has neighbouring states with equal
value.
Ridges: A ridge is a path in the solution space that leads to the global optimum but requires
movement in multiple dimensions simultaneously.
No Backtracking: Once the algorithm moves to a new state, it does not consider previous
states.
Q21. Elaborate Beyond Classical Search.
Ans: Beyond classical search encompasses advanced techniques designed to tackle problems
where classical methods are impractical due to the size or complexity of the search space.
These include local search algorithms, which iteratively improve solutions and focus on
efficiency rather than exhaustively exploring the entire search space.
Local Search Algorithms and Optimization Problems:
Local Search Algorithms: Iteratively explore the neighborhood of a current solution.
Effective for optimization problems by finding the best solution among many possibilities.
Focus on incremental improvements without complete exploration of the solution space.
Optimization Problems:Involve finding the best solution according to an objective function,
subject to constraints.
Common applications include scheduling, routing, and assignment.
Applications of Local Search Algorithms:-
Scheduling: Assigning resources or tasks to optimize efficiency (e.g., employee shifts, exam
timetables).
Routing: Finding optimal routes for delivery or communication networks (e.g., Traveling
Salesman Problem).
Assignment Problems: Matching tasks to resources (e.g., job assignments, student-project
matching)
Configuration Problems: Designing systems or products to meet specifications (e.g.,
computer systems configuration)
Different Types of Local Search Algorithms:
Hill Climbing:-- Definition: Moves towards the neighbor with the highest objective function
value. Limitation: Can get stuck in local optima.
Local Beam Search:-- Definition: Maintains multiple candidate solutions and explores their
neighborhoods. Advantage: Avoids getting stuck in local optima by exploring multiple paths.
Simulated Annealing:-- Definition: A probabilistic technique that allows worse moves to
escape local optima. Advantage: Can find global solutions by exploring a wider range of
solutions.
Local Search in Continuous Space:
Continuous Spaces: Variables can take any value within a range, unlike discrete spaces with
distinct values.
Techniques:
Gradient Descent: Moves in the direction of the steepest decrease of the objective function;
common in machine learning.
Newton's Method: Uses second-order derivatives for faster convergence but requires
computing the Hessian matrix.
Stochastic Gradient Descent: Updates parameters using randomly selected subsets of data;
efficient for large datasets and noisy data
 CHAPTER 3 KNOWLEDGE AND REASONING(12m)
Q22.Describe the architecture of a knowledge based agent in AI(4M)
Ans:

The above diagram is representing a generalized architecture for a knowledge-based agent.

The knowledge-based agent (KBA) take input from the environment by perceiving the
environment. The input is taken by the inference engine of the agent and which also
communicate with KB to decide as per the knowledge store in KB. The learning element of
KBA regularly updates the KB by learning new knowledge The knowledge-based agent (KBA)
take input from the environment by perceiving the environment.

The input is taken by the inference engine of the agent, and which also communicate with
KB to decide as per the knowledge store in KB.

The learning element of KBA regularly updates the KB by learning new knowledge.

Q23. What are the different approaches of designing a knowledge based agent?(4M)
Ans: Knowledge-Base: The central component of the knowledge-based agents is the
knowledge base. It is represented as KB. The Knowledgebase is a group of the Sentences
(Here, sentences are used as a technical term and not identical with the English language),
1. Declarative Knowledge:
Declarative knowledge is to know about something.
It includes concepts, facts, and objects.
It is also called descriptive knowledge and expressed in declarative sentences.
It is simpler than procedural language.

2. Procedural Knowledge:
It is also known as imperative knowledge.
Procedural knowledge is a type of knowledge which is responsible for knowing how to do
something.
It can be directly applied to any task.
It includes rules, strategies, procedures, agendas etc.
Procedural knowledge depends on the task on which it can be applied.

3. Meta-knowledge:
Knowledge about the other types of knowledge is called Meta-knowledge.

4. Heuristic knowledge:
Heuristic knowledge is representing knowledge of some experts in a filed or subject.
Heuristic knowledge is rules of thumb based on previous experiences, awareness of
approaches, and which are good to work but not guaranteed.

5. Structural knowledge:
Structural knowledge is basic knowledge to problem-solving.
It describes relationships between various concepts such as kind of, part of, and grouping of
something.
It describes the relationship that exists between concepts or objects.