AI MCQ
1- ITERATIVE BROADENING IS SOMETIMES USED AS AN ALTERNATIVE TO
DEPTH FIRST SEARCH (DFS) FOR:
A) Less memory and run time
B) Less memory
C) Less run time
D) none
2. An Artificial Intelligence system that permit an interactive dialogue about a
domain he called blocks-world.
A) SIMD
B) STUDENT
C) SHRDLU
D) BACON
3- LIST EACH POSSIBLE CANDIDATE SOLUTION AND CHECK TO SEE IF IT SATISFIES
THE CONSTRAINTS
A) Tree
B) Generate and test
C) Graph
D) None
2. What is Artificial Intelligence?
a) A field that aims to make humans more intelligent
b) A field that aims to improve the security
c) A field that aims to develop intelligent machines
d) A field that aims to mine the data
8. Based on which parameter AI is categorized?
a) Based on functionally only
b) Based on capabilities only
c) Based on capabilities and functionally
d) It is not categorized
10. What is the function of an AI “Agent”?
a) Mapping of goal sequence to an action
b) Work without the direct interference of the people
c) Mapping of precept sequence to an action
d) Mapping of environment sequence to an action
16. Which of the following machine requires input from the humans but can interpret the
outputs themselves?
a) Actuators
b) Sensor
c) Agents
d) AI system
33. What is an AI ‘agent’?
a) Takes input from the surroundings and uses its intelligence and performs the desired
operations
b) An embedded program controlling line following robot
c) Perceives its environment through sensors and acting upon that environment through
actuators
d) All of the mentioned
42. Which of the following search method takes less memory?
a) Optimal-Linear Search
b) Binary search
c) Breadth-First search
d) Depth-First Search
5. What kind of behavior does the stochastic environment posses?
a) Deterministic
b) Primary
c) Local
d) Rational
1. A search algorithm takes _________ as an input and returns ________ as an output.
a) Problem, solution
b) Parameters, sequence of actions
c) Input, output
d) Solution, problem
3. Which search strategy is also called as blind search?
a) Simple reflex search
b) Uninformed search
c) Informed search
d) All of the mentioned
6. The search strategy the uses a problem specific knowledge is known as ___________
a) Heuristic Search
b) Informed Search
c) Best First Search
d) All of the mentioned
7. In many problems the path to goal is irrelevant, this class of problems can be solved
using ____________
a) Informed & Uninformed Search Techniques
b) Local Search Techniques
c) Informed Search Techniques
d) Uninformed Search Techniques
4. _______________ Is an algorithm, a loop that continually moves in the direction of
increasing value – that is uphill.
a) Up-Hill Search
b) Hill-Climbing
c) Hill algorithm
d) Reverse-Down-Hill search
4. The Depth First Search traversal of a graph will result into?
a) Linked List
b) Tree
c) Graph with back edges
d) Array
5. A person wants to visit some places. He starts from a vertex and then wants to visit every
vertex till it finishes from one vertex, backtracks and then explore other vertex from same
vertex. What algorithm he should use?
a) Depth First Search
b) Breadth First Search
c) Trim’s algorithm
d) Kruskal’s Algorithm
9. In Depth First Search AND BFS, how many times a node is visited?
a) Once
b) Twice
c) Equivalent to number of indegree of the node
d) Thrice
3. The Data structure used in standard implementation of Breadth First Search is?
a) Stack
b) Queue
c) Linked List
d) Tree
4. Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search
d) None of the mentioned
4. The Breadth First Search traversal of a graph will result into?
a) Linked List
b) Tree
c) Graph with back edges
d) Arrays
5. A person wants to visit some places. He starts from a vertex and then wants to visit every
place connected to this vertex and so on. What algorithm he should use?
a) Depth First Search
b) Breadth First Search
c) Trim’s algorithm
d) Kruskal’s algorithm
6. Which search uses only the linear space for searching?
a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of the mentioned
8. Which search is complete and optimal when h(n) is consistent?
a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search
9. Which is used to improve the performance of heuristic search?
a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned
10. Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned
2. A* algorithm is based on ___________
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
3. The search strategy the uses a problem specific knowledge is known as ___________
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned
2. What is the evaluation function in A* approach?
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
10. Which search implements stack operation for searching the states?
a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of the mentioned
In which of the following situations might a blind search be acceptable?
A. real-life situation
B. complex game
C. small search space
D. All of the above
What is Branching Factor?
A. Length of the shortest path from initial state to goal state.
B. The average number of child nodes in the problem space graph.
C. A property of an algorithm to always find an optimal solution.
D. None of the Above
15. When is breadth-first search is optimal?
A. When there is less number of nodes
B. When all step costs are equal
C. When all step costs are unequal
D. All of the above
19. When will Hill-Climbing algorithm terminate?
A. Stopping criterion met
B. Global Min/Max is achieved
C. No neighbor has higher value
D. All of the above
What is the name of the computer program that contains the distilled knowledge of an
expert?
A. Data base management system
B. Management information System
C. Expert system
D. Artificial intelligence
E. None of the above
1. An Artificial Intelligence system developed by Terry A. Winograd to permit an
interactive dialogue about a domain he called blocks-world.

SIMD

STUDENT

SHRDLU
BACON



7. Weak AI is

a set of computer programs that produce output that would be considered to
reflect intelligence if it were generated by humans.
the study of mental faculties through the use of mental models implemented on a
computer.


the embodiment of human intellectual capabilities within a computer.

All of the above
17. Which is true?

All formal languages are like natural language

Not all formal languages are context-free
23. Which of following search algorithm requires less memory?

Optimal Search

Breadth-First Search

Depth First Search

Linear Search
25. A heuristic is a way of trying

To search and measure how far a node in a search tree seems to be from a goal

To discover something or an idea embedded in a program

To compare two nodes in a search tree to see if one is better than the other

All are correct
27. Which is the following is most straightforward approach for planning algorithm?
Best-first search

Depth First Search

State space search
Binary Search

34. Strong AI is ................


The embodiment of human intellectual capabilities within a computer.
The study of mental faculties through the use of mental models implemented on a
computer.

Both A & B

None of the above
A Search Tree is an efficient way to represent ,how a search algorithm traverses the state space.
State problem : evaluation will only depend on the node ev(n).
Path Problem: evaluation will depend on the node and the path to the node
ev(n,p).