EXCEL ENGINEERING COLLEGE
(Autonomous)
B.Tech – Information Technology
VI SEMESTER
20IT402 COMPUTAIONAL INTELLIGENCE
Regulations 2020
Question Bank with Answers
UNIT – I INTRODUCTION
PART- A
Q.No Questions Marks CO BL
What is an agent function? Differentiate an agent function and an agent program
An agent function is an abstract mathematical mapping from percept sequences to
1 actions; an agent program is a specific implementation in a system. An agent function 2 CO1 R
processes information from the agent's sensors; an agent program controls the agent's
actuators.
What is a task environment? How it is specified?
A task environment can be described as a directed graph where the nodes are states and 2
2 the links are actions. Some links will lead to final states that represent completion of the CO1 R
task.
What are the four different kinds of agent programs?
2
3 CO1 R
1. Simple Reflex Agent.
2. Model-based reflex agent.
3. Goal-based agents.
4. Utility-based agent.
List the steps involved in simple problem solving agent.
The process of problem-solving using searching consists of the following steps.
Define the problem.
2
4 Analyze the problem. CO1 R
Identification of possible solutions.
Choosing the optimal solution.
Implementation
5 2 CO1 R
Define search algorithm.
Search algorithms are algorithms that help in solving search problems. A search problem
consists of a search space, start state, and goal state. These algorithms are important
because they help in solving AI problems and support other systems such as neural
, networks and production systems.
What are the components of well-defined problems?
Well-defined (well-structured) problems are those that contain a clear specification of 2
6 CO1 R
three elements of the problem space: the initial state (the problem situation), the set of
operators (rules and strategies) to solve the problem, and the goal state (the solution).
Differentiate toy problems and real world problems.
Basically, there are two types of problem approaches: Toy Problem: It is a concise and
2
7 exact description of the problem which is used by the researchers to compare the CO1 U
performance of algorithms. Real-world Problem: It is real-world based problems which
require solutions.
List the criteria to measure the performance of different search strategies.
8 Completeness, Time complexity, Space complexity, Optimality are criteria to 2 CO1 R
measure the performance of different search strategies.
Compare Uninformed Search (Blind search) and informed Search (Heuristic Search)
Strategies.
Parameters Informed Search Uninformed Search
2
9 It is also known as Heuristic CO1 U
Known as Search. It is also known as Blind Search.
Using It uses knowledge for the It doesn’t use knowledge for the
Knowledge searching process. searching process.
It finds a solution more It finds solution slow as
Performance quickly. compared to an informed search.
10 What is A* search? 2 CO1 R
, It is a searching algorithm that is used to find the shortest path between an initial and a
final point. A* is an informed search algorithm, or a best-first search, meaning that it is
formulated in terms of weighted graphs: starting from a specific starting node of a graph, it
aims to find a path to the given goal node having the smallest cost
What are optimization problems?
2
11 A computational problem in which the object is to find the best of all possible solutions. CO1 R
More formally, find a solution in the feasible region
What is Hill-climbing search?
Hill Climbing is a heuristic search used for mathematical optimization problems in the field
2
12 of Artificial Intelligence. Given a large set of inputs and a good heuristic function, it tries to CO1 R
find a sufficiently good solution to the problem. This solution may not be the global optimal
maximum.
Describe simulated annealing search.
Simulated annealing (SA) is a probabilistic technique for approximating the global 2
13 CO1 U
optimum of a given function. Specifically, it is a meta heuristic to approximate global
optimization in a large search space for an optimization problem.
What are crypt arithmetic problem? Give an example.
Cryptarithmetic problems are mathematical puzzles in which the digits are replaced by
letters of the alphabets.
2
14 CO1 U
So we must have E = 5 and N = 6. This means D + E = 7 + 5 = 12, and thus Y = 2. So we
have solved for all the letters! SEND + MORE = 9567 + 1085 = 10652.
(Autonomous)
B.Tech – Information Technology
VI SEMESTER
20IT402 COMPUTAIONAL INTELLIGENCE
Regulations 2020
Question Bank with Answers
UNIT – I INTRODUCTION
PART- A
Q.No Questions Marks CO BL
What is an agent function? Differentiate an agent function and an agent program
An agent function is an abstract mathematical mapping from percept sequences to
1 actions; an agent program is a specific implementation in a system. An agent function 2 CO1 R
processes information from the agent's sensors; an agent program controls the agent's
actuators.
What is a task environment? How it is specified?
A task environment can be described as a directed graph where the nodes are states and 2
2 the links are actions. Some links will lead to final states that represent completion of the CO1 R
task.
What are the four different kinds of agent programs?
2
3 CO1 R
1. Simple Reflex Agent.
2. Model-based reflex agent.
3. Goal-based agents.
4. Utility-based agent.
List the steps involved in simple problem solving agent.
The process of problem-solving using searching consists of the following steps.
Define the problem.
2
4 Analyze the problem. CO1 R
Identification of possible solutions.
Choosing the optimal solution.
Implementation
5 2 CO1 R
Define search algorithm.
Search algorithms are algorithms that help in solving search problems. A search problem
consists of a search space, start state, and goal state. These algorithms are important
because they help in solving AI problems and support other systems such as neural
, networks and production systems.
What are the components of well-defined problems?
Well-defined (well-structured) problems are those that contain a clear specification of 2
6 CO1 R
three elements of the problem space: the initial state (the problem situation), the set of
operators (rules and strategies) to solve the problem, and the goal state (the solution).
Differentiate toy problems and real world problems.
Basically, there are two types of problem approaches: Toy Problem: It is a concise and
2
7 exact description of the problem which is used by the researchers to compare the CO1 U
performance of algorithms. Real-world Problem: It is real-world based problems which
require solutions.
List the criteria to measure the performance of different search strategies.
8 Completeness, Time complexity, Space complexity, Optimality are criteria to 2 CO1 R
measure the performance of different search strategies.
Compare Uninformed Search (Blind search) and informed Search (Heuristic Search)
Strategies.
Parameters Informed Search Uninformed Search
2
9 It is also known as Heuristic CO1 U
Known as Search. It is also known as Blind Search.
Using It uses knowledge for the It doesn’t use knowledge for the
Knowledge searching process. searching process.
It finds a solution more It finds solution slow as
Performance quickly. compared to an informed search.
10 What is A* search? 2 CO1 R
, It is a searching algorithm that is used to find the shortest path between an initial and a
final point. A* is an informed search algorithm, or a best-first search, meaning that it is
formulated in terms of weighted graphs: starting from a specific starting node of a graph, it
aims to find a path to the given goal node having the smallest cost
What are optimization problems?
2
11 A computational problem in which the object is to find the best of all possible solutions. CO1 R
More formally, find a solution in the feasible region
What is Hill-climbing search?
Hill Climbing is a heuristic search used for mathematical optimization problems in the field
2
12 of Artificial Intelligence. Given a large set of inputs and a good heuristic function, it tries to CO1 R
find a sufficiently good solution to the problem. This solution may not be the global optimal
maximum.
Describe simulated annealing search.
Simulated annealing (SA) is a probabilistic technique for approximating the global 2
13 CO1 U
optimum of a given function. Specifically, it is a meta heuristic to approximate global
optimization in a large search space for an optimization problem.
What are crypt arithmetic problem? Give an example.
Cryptarithmetic problems are mathematical puzzles in which the digits are replaced by
letters of the alphabets.
2
14 CO1 U
So we must have E = 5 and N = 6. This means D + E = 7 + 5 = 12, and thus Y = 2. So we
have solved for all the letters! SEND + MORE = 9567 + 1085 = 10652.
