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.

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.

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.

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.

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.

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.

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.

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.

Download Interview PDF

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

27. What is state space?
a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter
e) A space where you know the solution

d) Representing your problem with variable and parameter
Explanation:
Because state space is mostly concerned with a problem, when you try to solve a problem, we have to design a mathematical structure to the problem, which can only be through variables and parameters. for example, you have given a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4 gallons.Here the state space can defined as set of ordered pairs integers(x,y),such that x=0,1,2,3 or 4 and y=0,1,2 or 3;X represents the number of gallons in 4 gallons jug and y represents quantity of water in the 3 gallons jug.

29. A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output
b) Problem, solution
c) Solution, problem
d) Parameters, sequence of actions

b) Problem, solution
Explanation:
A search algorithm takes input as a problem and returns a solution to the problem as an output.

30. A problem in a search space Is defined by:
a) Initial state
b) Goal test
c) Intermediate states
d) All of the above

a) Initial state & b) Goal test
Explanation:
A problem has four components initial state, goal test, set of actions, path cost.

31. The set of actions for a problem in a state space is formulated by a ___________.
a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned

c) Successor function, which takes current action and returns next immediate state
Explanation:
The most common formulation for actions uses a successor function. Given a particular state x, SUCCESSOR-FN(x) returns a set of (action, successor) ordered pairs, where each action is one of the legal actions in state x and each successor is a state that can be reached from x by applying the action.

32. A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false.
a) True
b) False

a) True
Explanation:
A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the lowest path cost among all solutions.

33. A problem solving approach works well for:
a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)

d) Mars Hover (Robot Navigation)
Explanation:
Problem-solving approach works well for toy problems and real-world problems.