Artificial Intelligence - Important Questions With Detailed Explanations
Artificial Intelligence - Important Questions With Detailed Explanations
● 1950s: Alan Turing developed the concept of the Turing Test to measure machine
intelligence.
● 1980s: Expert Systems became popular, e.g., MYCIN for medical diagnosis.
● 1997: IBM's Deep Blue defeated world chess champion Garry Kasparov.
● 2010s–Present: Rise of deep learning, big data, and AI in everyday applications (voice
assistants, recommendation systems).
● Inference Engine: Applies logical rules to the knowledge base to deduce new
information.
● Learning Component: Allows the system to improve over time based on experience.
● Model-based Reflex Agents: Maintain internal state to deal with partial observability.
● Goal-based Agents: Make decisions based on a desired goal (e.g., route planning).
● Learning Agents: Can learn from interactions and improve performance (e.g.,
recommendation engines).
● Agent: An entity that perceives its environment through sensors and acts upon it using
actuators.
Example: A robot vacuum (agent) senses dirt (environment) and cleans it.
● A rational agent chooses actions that maximize expected performance measure based
on its knowledge.
● Fully vs Partially Observable: Can the agent access the complete state?
● Static vs Dynamic: Does the environment change while the agent is deliberating?
○ Learning Element
○ Performance Element
● Breadth-First Search (BFS): Explores all nodes at the present depth level before
moving on to the next level. It guarantees finding the shortest path in an unweighted
graph.
● Depth-Limited Search: A variant of DFS where a depth limit is set to avoid infinite loops
in deep graphs.
● Greedy Best First Search: Chooses the path that appears to lead most directly to the
goal, based on heuristic information.
● A Search*: Combines the features of BFS and greedy search by using both the cost to
reach a node and the estimated cost to the goal.
● Hill Climbing: Moves towards the direction of the steepest ascent, but may get stuck in
local maxima.
● Genetic Algorithms: Use concepts of natural selection and evolution to find solutions to
optimization problems.
● Game Playing: Involves two agents (players) competing against each other. Minimax
Search is used to determine the best possible move.
● Min-Max Search: Explores all possible moves to determine the best strategy by
minimizing the opponent’s maximum payoff.
● Alpha-Beta Pruning: An optimization technique to Minimax search that reduces the
number of nodes evaluated.
● Propositional Logic: A form of logic where statements are either true or false. It’s used
for simple deduction in AI systems.
● Belief Networks: Represent uncertain knowledge using nodes for variables and edges
for dependencies. Inference is performed to calculate probabilities.
5.1 Planning
● State Space Search: The problem is modeled as a search through a space of states to
find the most optimal solution.
5.2 Learning
A. Introduction to NLP
● Language Models: These models predict the probability of a sequence of words and
are crucial for tasks like speech recognition and text generation.
● Grammars and Parsing: Understanding the structure of sentences through rules and
parsing techniques, aiding in machine understanding of natural language.
B. Robotics
● Robot Hardware: Involves sensors (e.g., cameras, LIDAR), actuators (e.g., motors),
and control systems.
C. AI Applications
● Banking: AI aids in fraud detection, loan approvals, and customer service automation.