C073_AI_Assignment1

Assignment 1
1.Define Artificial Intelligence (AI).
Artificial Intelligence (AI) refers to the simulation of human intelligence processes by

machines, particularly computer systems. These processes include learning (the acquisition
of information and rules for using it), reasoning (using rules to reach approximate or
definite conclusions), and self-correction.
Applications of AI:
 Healthcare: AI systems assist in diagnostics (e.g., analyzing medical images) and

personalizing treatment plans.
 Finance: AI algorithms detect fraudulent transactions and manage investment
portfolios.
 Transportation: Self-driving cars use AI to navigate and make real-time decisions.
 Customer Service: AI chatbots provide 24/7 support by answering common
inquiries.
Key Concepts:
 Modelling: Creating representations of systems or environments to understand their

behavior. For example, a model of weather patterns can predict future conditions.
 Inference: The process of drawing conclusions from available information. For
instance, an AI system might infer the likelihood of a disease based on patient
symptoms.
 Learning: Refers to algorithms that improve performance based on experience,
such as reinforcement learning in gaming environments.
Real-World Examples of Intelligent Agents:
 Personal Assistants: Siri and Alexa analyze voice commands to perform tasks or
provide information.
 Recommendation Systems: Netflix and Amazon use AI to suggest movies or
products based on user preferences.
2. Discuss the concept of Intelligent Agents.
Intelligent Agents are entities that perceive their environment through sensors and act
upon that environment through actuators.
Rationality of Agents: An agent is rational if it acts to maximize its expected performance

measure based on its perceptions and knowledge. This involves selecting actions that lead
to the best outcome.
Structure of Agents:
1. Architecture: The hardware or software that the agent runs on.
2. Agent Program: The program that implements the agent's behavior.
Properties of Task Environments:
 Fully vs. Partially Observable: In a chess game (fully observable), the agent
knows all positions. In stock trading (partially observable), the agent does not have
complete information about the market.
 Deterministic vs. Stochastic: Chess is deterministic (outcomes are predictable),
while weather forecasting is stochastic (involves uncertainty).
 Discrete vs. Continuous: A game of tic-tac-toe is discrete, while driving in a city
involves continuous actions.
Examples:
 Robotic Vacuum: Perceives room layout and obstacles, deciding on cleaning paths.
 Autonomous Drones: Use sensors to navigate and avoid obstacles while delivering
packages.
3. Explain Uninformed Search Strategies.
Uninformed search strategies do not have any additional information about the goal's
location beyond the problem definition.
Comparisons:
Breadth-First Search (BFS):
→ Explores all nodes at the present depth before moving to the next level.
→ Guarantees the shortest path in an unweighted graph.
→ Use when the solution is likely to be found at shallow depths.
Depth-First Search (DFS):
→ Explores as far down a branch as possible before backtracking.

→ Can be more memory efficient but may get stuck in deep or infinite
branches.
→ Use when the solution is deep or when memory is a constraint.
Uniform Cost Search:
→ Expands the least costly node (based on path cost).

→ Guarantees the least cost solution in weighted graphs.
→ Use when path costs vary significantly.
4. Describe the Minimax Algorithm in Adversarial Search.

The Minimax Algorithm is used in decision-making and game theory for minimizing the
possible loss in a worst-case scenario. It’s particularly useful for two-player zero-sum
games.
Optimal Decisions:
 Each player aims to maximize their minimum gain (hence "minimax"). The
algorithm evaluates game states, assigning values based on the potential outcomes.
Alpha-Beta Pruning:
 A technique to reduce the number of nodes evaluated in the Minimax algorithm. It

prunes branches in the search tree that won’t affect the final decision. By keeping
track of two values (alpha and beta), the algorithm can ignore certain paths,
improving efficiency without sacrificing accuracy.
5. What is Knowledge Representation?
Knowledge Representation is a field in AI that focuses on how to formally think about the
world in a way that a computer can utilize to solve complex tasks.
Propositional Logic:
 Represents facts as propositions that can be true or false. For example, "It is
raining" is a proposition.
First-Order Logic (FOL):
 Extends propositional logic by including quantifiers and predicates, allowing for a

richer representation of facts and relationships. For instance, "All humans are
mortal" can be expressed using FOL.
Inference Systems:
 Forward Chaining: Starts from known facts and applies inference rules to derive
new facts until a goal is reached.
 Backward Chaining: Starts with the goal and works backward to determine if the
known facts support it. This is often used in rule-based systems.

C073_AI_Assignment1

Uploaded by

Copyright:

Available Formats

C073_AI_Assignment1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

C073_AI_Assignment1

Uploaded by

Copyright:

Available Formats

Assignment 1

1.Define Artificial Intelligence (AI).

Artificial Intelligence (AI) refers to the simulation of human intelligence processes by

 Healthcare: AI systems assist in diagnostics (e.g., analyzing medical images) and

 Modelling: Creating representations of systems or environments to understand their

Real-World Examples of Intelligent Agents:

2. Discuss the concept of Intelligent Agents.

Rationality of Agents: An agent is rational if it acts to maximize its expected performance

Properties of Task Environments:

3. Explain Uninformed Search Strategies.

Breadth-First Search (BFS):

Depth-First Search (DFS):

→ Explores as far down a branch as possible before backtracking.

Uniform Cost Search:

→ Expands the least costly node (based on path cost).

4. Describe the Minimax Algorithm in Adversarial Search.

 A technique to reduce the number of nodes evaluated in the Minimax algorithm. It

5. What is Knowledge Representation?

First-Order Logic (FOL):

 Extends propositional logic by including quantifiers and predicates, allowing for a

You might also like