Explore topic-wise InterviewSolutions in .

The correct answer is (a) SPACE, Time

The explanation is: NONE.

Correct CHOICE is (a) By maintaining a LIST of VISITED vertices

Best EXPLANATION: Other techniques are costly.

Right CHOICE is (a) Stack, Queue

The BEST I can explain: LIFO is last in FIRST out – Stack. FIFO is first in first out – Queue.

The correct choice is (b) When all STEP COSTS are equal

The EXPLANATION is: It always expands the shallowest unexpanded NODE.

The correct choice is (b) False

For explanation: Breadth-first SEARCH is OPTIMAL when all step costs are equal, because it always EXPANDS the shallowest unexpanded node. If the solution exists in shallowest node no IRRELEVANT nodes are expanded.

The CORRECT answer is (a) O(bd+1) and O(bd+1)

Explanation: We CONSIDER a hypothetical state space where every state has b successors. The root of the search tree generates b nodes at the first level, each of which generates b more nodes, for a total of b2 at the second level. Each of these generates b more nodes, yielding b3 nodes at the third level, and so on. Now suppose that the solution is at depth d. In the worst case, we would expand all but the LAST node at level d (SINCE the goal itself is not expanded), generating bd+1- b nodes at level d+1.

Right answer is (b) Queues

Easy explanation: Queue is the most convenient data STRUCTURE, but memory USED to store nodes can be REDUCED by using CIRCULAR queues.

The correct choice is (d) All of the mentioned

The best I can EXPLAIN: Several UNINFORMED search TECHNIQUES INCLUDES BFS, DFS, Uniform-cost, Depth-limited, Bidirectional search etc.

Right CHOICE is (d) Informed & HEURISTIC Search

To explain I would say: STRATEGIES that know whether one non-goal STATE is “more promising” than another are CALLED informed search or heuristic search strategies.

Correct answer is (B) UNINFORMED Search

Best explanation: In CASE of uninformed search no ADDITIONAL information except the PROBLEM definition is given.

The CORRECT CHOICE is (a) Depth-limited search

For EXPLANATION I would say: NONE.

The correct ANSWER is (b) Depth-first search

To ELABORATE: It IMPLEMENTS stack operation because it always expands the deepest node in the current tree.

Right ANSWER is (d) 4

Easy EXPLANATION: The four parts of the problem are initial STATE, SET of actions, goal test and PATH cost.

The correct CHOICE is (d) O(BM)

Easy explanation: O(bm) is the space complexity where B is the branching factor and m is the maximum depth of the SEARCH TREE.

Right ANSWER is (a) 1

Explanation: Each PARTIALLY EXPANDED node remembers which SUCCESSOR to generate next because of these conditions, it uses less memory.

Correct option is (b) When all STEP costs are equal

Easy explanation: Because it ALWAYS EXPANDS the shallowest unexpanded NODE.

Correct CHOICE is (c) 5

Explanation: The FIVE TYPES of UNINFORMED SEARCH method are Breadth-first, Uniform-cost, Depth-first,Depth-limited and Bidirectional search.

The correct CHOICE is (a) Uninformed SEARCH

The best EXPLANATION: In BLIND search, We can search the STATES without having any additional information. So uninformed search method is blind search.

The correct answer is (a) Depth-First Search

To EXPLAIN I would say: Depth-First Search takes less MEMORY since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has GENERATED MUST be stored.

The CORRECT option is (C) SET of Rule & SEQUENCE of steps

To elaborate: When you are TRYING to solve a problem, you should design how to get a step-by-step solution with constraints condition to your problem, e.g Chess board problem.

Right choice is (a) Intelligent goal-based agent

The BEST explanation: Web Crawling is type of search for a RELEVANT document from given seed documents. Focused crawlers exists, HELPS to improvise the search efficiency.

Right answer is (d) All of the mentioned

Explanation: For BEST PERFORMANCE consideration of all component is NECESSARY.

The CORRECT CHOICE is (a) True

The explanation is: Refer to the definition of problem-solving AGENT.

The correct option is (a) True

Easiest 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.

Right ANSWER is (c) Successor function, which TAKES current action and returns next immediate state

The EXPLANATION is: 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.

Correct OPTION is (a) INITIAL STATE

For explanation I would say: A problem has four components initial state, goal test, set of actions, PATH cost.

Right ANSWER is (B) Problem, solution

The EXPLANATION is: A search algorithm takes INPUT as a problem and returns a solution to the problem as an output.

Correct answer is (d) Representing your problem with variable and parameter

The best 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. eg. 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 gallon jug and y represents the quantity of water in the 3-gallon jug.

Right ANSWER is (C) All of the mentioned

For EXPLANATION I would say: The problem-solving agents are ONE of the goal-based agents.