a) Top-down and bottom-up parsing
Explanation:
The two types of parsing are top-down parsing and bottom-up parsing.
a) Optical character recognition
Explanation:
When perception is used in printing means, It is called as optical character recognition.
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.
b) Formal language
Explanation:
A formal language is defined by set of strings that is a concatenation of terminal symbols.
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.
11. Flexible CSPs relax on:
a) Constraints
b) Current State
c) Initial State
d) Goal State
a) Constraints
Explanation:
Definition of flexible CSPs.
b) Sub-goal independence
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
b) Abstraction
Explanation:
The process of removing detail from a representation is called abstraction.
b) Not any change in the literals
Explanation:
Consistent means that the completed actions will not undo any desired literals.
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.
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.
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.
c) Relevant actions
Explanation:
The main advantage of backward search will allows us to consider only relevant actions.
a) Regression planning
Explanation:
Backward state-space search will find the solution from goal to the action, so it is called as Regression planning.
b) Not any change in the literals
Explanation:
Consistent means that the completed actions will not undo any desired literals.
b) Sub-goal independence
Explanation:
Sub-goal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
c) Both a) and b)
Explanation:
The problem-solving agents are one of the goal-based agents.
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.
a) True
Explanation:
Refer to the definition of problem-solving agent.
b) Problem, solution
Explanation:
A search algorithm takes input as a problem and returns a solution to the problem as an output.
a) Initial state & b) Goal test
Explanation:
A problem has four components initial state, goal test, set of actions, path cost.
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.
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.
d) Mars Hover (Robot Navigation)
Explanation:
Problem-solving approach works well for toy problems and real-world problems.
b) Travelling Salesman problem
Explanation:
Refer the TSP problem.