Information Retrival Techniques MCQs | Page - 20

 a problem has four components initial state, goal test, set of actions, path cost.

 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.

 the process of removing detail from a representation is called abstraction.

 refer the tsp problem.

 web crawling is type of search for a relevant document from given seed documents. focused crawlers exists, helps to improvise the search efficiency.

 for best performance consideration of all component is necessary.

 when you are trying to solve a problem, you should design how to get a step-

 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.

 we use a heuristic approach, as it will find out brute force computation, looking at hundreds of thousands of positions. e.g chess competition between human and ai based computer.

 architecture of software depends on requirements.