Vital Artificial Intelligence Algorithms Interview Preparation Guide Download PDF
AI Algorithms frequently Asked Questions by expert members with experience in Artificial Intelligence Algorithms. So get preparation for the AI Algorithms job interview
57 Artificial Intelligence Algorithms Questions and Answers:
Table of Contents:
1 :: Pick out the correct option about the types of parsing:
a) Top-down and bottom-up parsing
b) Interpretation and communication
c) Roll-up and roll-down
d) None of the mentioned
a) Top-down and bottom-up parsing
Explanation:
The two types of parsing are top-down parsing and bottom-up parsing.
Explanation:
The two types of parsing are top-down parsing and bottom-up parsing.
2 :: What kind of perception is used in printing?
a) Optical character recognition
b) Speech recognition
c) Perception
d) None of the mentioned
a) Optical character recognition
Explanation:
When perception is used in printing means, It is called as optical character recognition.
Explanation:
When perception is used in printing means, It is called as optical character recognition.
3 :: What is the intentional exchange of information brought about by production and perception?
a) Hearing
b) Communication
c) Speech
d) None of the mentioned
b) Communication
Explanation:
Communication is the intentional exchange of information brought about by production and perception of signs drawn from a shared system.
Explanation:
Communication is the intentional exchange of information brought about by production and perception of signs drawn from a shared system.
4 :: What is the complex system of structured message?
a) Languages
b) Words
c) Signs
d) Speech
a) Languages
Explanation:
Language is the complex system of structured message that enables us to communicate.
Explanation:
Language is the complex system of structured message that enables us to communicate.
5 :: How many things are present in conventional communication signs?
a) 3
b) 4
c) 5
d) 6
c) 5
Explanation:
The five things present in the conventional communication system are query, inform, request, acknowledge and promise.
Explanation:
The five things present in the conventional communication system are query, inform, request, acknowledge and promise.
6 :: What is defined by set of strings?
a) Signs
b) Formal language
c) Communication
d) None of the mentioned
b) Formal language
Explanation:
A formal language is defined by set of strings that is a concatenation of terminal symbols.
Explanation:
A formal language is defined by set of strings that is a concatenation of terminal symbols.
8 :: Why the parsing is used?
a) Interpretation
b) Building a parse tree
c) Recognition
d) All of the mentioned
b) Building a parse tree
Explanation:
Parsing is the process of building a parse tree for an input string.
Explanation:
Parsing is the process of building a parse tree for an input string.
9 :: How many objects are available in closed classes?
a) 1
b) 2
c) 3
d) 4
d) 4
Explanation:
The four objects are available in closed classes are pronoun, article, preposition and conjunction.
Explanation:
The four objects are available in closed classes are pronoun, article, preposition and conjunction.
10 :: How many states are present in parsing?
a) 1
b) 2
c) 3
d) 4
c) 3
Explanation:
The three state available in parsing are initial state, successor function and goal test.
Explanation:
The three state available in parsing are initial state, successor function and goal test.
11 :: Flexible CSPs relax on:
a) Constraints
b) Current State
c) Initial State
d) Goal State
a) Constraints
Explanation:
Definition of flexible CSPs.
Explanation:
Definition of flexible CSPs.
12 :: Which approach is to pretend that a pure divide and conquer algorithm will
work?
a) Goal independence
b) Sub-goal independence
c) Both a & b
d) None of the mentioned
b) Sub-goal independence
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
13 :: The process of removing detail from a given state representation is called______.
a) Extraction
b) Abstraction
c) Information Retrieval
d) Mining of data
b) Abstraction
Explanation:
The process of removing detail from a representation is called abstraction.
Explanation:
The process of removing detail from a representation is called abstraction.
14 :: Tell me what is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state
d) None of the mentioned
b) Not any change in the literals
Explanation:
Consistent means that the completed actions will not undo any desired literals.
Explanation:
Consistent means that the completed actions will not undo any desired literals.
16 :: Which is the most straightforward approach for planning algorithm?
a) Best-first search
b) State-space search
c) Depth-first search
d) Hill-climbing search
b) State-space search
Explanation:
The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.
Explanation:
The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.
17 :: What are taken into account of state-space search?
a) Post conditions
b) Preconditions
c) Effects
d) Both b & c
d) Both b & c
Explanation:
The state-space search takes both precondition and effects into account for solving a problem.
Explanation:
The state-space search takes both precondition and effects into account for solving a problem.
18 :: How many ways are available to solve the state-space search?
a) 1
b) 2
c) 3
d) 4
b) 2
Explanation:
There are two ways available to solve the state-space search. They are forward from the initial state and backward from the goal.
Explanation:
There are two ways available to solve the state-space search. They are forward from the initial state and backward from the goal.
19 :: What is the other name for forward state-space search?
a) Progression planning
b) Regression planning
c) Test planning
d) None of the mentioned
a) Progression planning
Explanation:
It is sometimes called as progression planning, because it moves in the forward direction.
Explanation:
It is sometimes called as progression planning, because it moves in the forward direction.
20 :: How many states are available in state-space search?
a) 1
b) 2
c) 3
d) 4
d) 4
Explanation:
There are four states available in state-space search. They are initial state, actions, goal test and step cost.
Explanation:
There are four states available in state-space search. They are initial state, actions, goal test and step cost.
21 :: What is the main advantage of backward state-space search?
a) Cost
b) Actions
c) Relevant actions
d) All of the mentioned
c) Relevant actions
Explanation:
The main advantage of backward search will allows us to consider only relevant actions.
Explanation:
The main advantage of backward search will allows us to consider only relevant actions.
22 :: What is the other name of backward state-space search?
a) Regression planning
b) Progression planning
c) State planning
d) Test planning
a) Regression planning
Explanation:
Backward state-space search will find the solution from goal to the action, so it is called as Regression planning.
Explanation:
Backward state-space search will find the solution from goal to the action, so it is called as Regression planning.
23 :: What is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state
d) None of the mentioned
b) Not any change in the literals
Explanation:
Consistent means that the completed actions will not undo any desired literals.
Explanation:
Consistent means that the completed actions will not undo any desired literals.
25 :: Which approach is to pretend that a pure divide and conquer algorithm will work?
a) Goal independence
b) Sub-goal independence
c) Both a & b
d) None of the mentioned
b) Sub-goal independence
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
