[go: up one dir, main page]
Scribd
Upload
8 views2 pages

AI Exam Study Notes

The document outlines key concepts in Artificial Intelligence (AI), including its definition, history, and applications across various fields. It covers intelligent agents, problem-solving techniques, knowledge representation, reasoning, and adversarial search in games. The notes highlight the benefits and risks of AI, as well as the importance of ethical considerations in its future development.

Uploaded by

kk.da.29
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
8 views2 pages

AI Exam Study Notes

The document outlines key concepts in Artificial Intelligence (AI), including its definition, history, and applications across various fields. It covers intelligent agents, problem-solving techniques, knowledge representation, reasoning, and adversarial search in games. The notes highlight the benefits and risks of AI, as well as the importance of ethical considerations in its future development.

Uploaded by

kk.da.29
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/ 2

Artificial Intelligence - Exam Study Notes

UNIT I - INTRODUCTION TO AI
- Artificial Intelligence (AI) is the branch of computer science that aims to create machines that can

mimic human intelligence.

- Intelligent agents perceive the environment, reason, and act to achieve goals, learning from

experience.

- Examples: chatbots, self-driving cars, recommendation systems.

- AI solves problems by defining states, actions, and goals using algorithms.

- History: Turing Test (1950), Dartmouth Conference (1956), expert systems (1980s), modern ML

and DL.

- Applications: healthcare, finance, gaming, etc. Future involves ethical considerations.

- Benefits: efficiency, automation. Risks: job loss, privacy, misuse.

UNIT II - INTELLIGENT AGENTS


- Agents interact with environments through sensors and actuators.

- Rational agents act to maximize performance based on knowledge and goals.

- Performance measures evaluate success (e.g., speed, accuracy).

- Key traits: rationality, omniscience (theoretical), learning, autonomy.

- Agent types: Reflex, Model-based, Goal-based, Utility-based, Learning.

- Environment types: Observable, Deterministic, Episodic, Static, Discrete.

- Task environment = performance measure + environment + actuators + sensors.

- Agent = architecture (hardware) + program (logic).

UNIT III - PROBLEM SOLVING


- Problem-solving agents form goals and search for actions to achieve them.

- Problems defined by states, actions, transition model, goal state, path cost.

- Uninformed search: BFS (level-wise), DFS (depth-wise).


- Informed search: A* uses cost and heuristic (f(n) = g(n) + h(n)).

- Heuristics improve search efficiency. Relaxed problems generate heuristics.

- Local search: explores neighborhood (e.g., hill climbing).

- CSPs involve variables and constraints. Techniques: backtracking, forward checking, constraint

propagation.

UNIT IV - KNOWLEDGE AND REASONING


- Logical agents use a knowledge base and inference rules.

- Propositional logic uses true/false statements with logical connectives.

- Syntax = structure of expressions. Semantics = meaning.

- Inference: deriving new info. Theorem proving = proving goal statements.

- Resolution uses contradiction. CNF (conjunctive normal form) required.

- Resolution algorithm is complete. Forward/backward chaining for inference.

UNIT V - ADVERSARIAL SEARCH AND GAMES


- Game theory studies decision-making among multiple agents.

- Games classified as deterministic/stochastic, perfect/imperfect info, zero-sum.

- Strategies use game trees. Example: Prisoner's Dilemma.

- Minimax selects optimal move assuming opponent plays optimally.

- Alpha-beta pruning cuts unnecessary branches in minimax tree.

- Alpha-beta reduces complexity from O(b^d) to O(b^(d/2)).

- Limitations: high complexity, assumptions of perfect knowledge/rationality.

You might also like