1. Web Crawler is a/an ____________
a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent
Explanation: Web Crawling is type of search for a relevant document from given seed documents. Focused crawlers exists, helps to improvise the search efficiency.
2. What is the major component/components for measuring the performance of problem solving?
a) Completeness
b) Optimality
c) Time and Space complexity
d) All of the mentioned
Explanation: For best performance consideration of all component is necessary.
3. A production rule consists of ____________
a) A set of Rule
b) A sequence of steps
c) Set of Rule & sequence of steps
d) Arbitrary representation to problem
Explanation: 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.
4. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
Explanation: 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.
5. Which is the best way to go for Game playing problem?
a) Linear approach
b) Heuristic approach (Some knowledge is stored)
c) Random approach
d) An Optimal approach
Explanation: 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.
6. Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned
Explanation: In blind search, We can search the states without having any additional information. So uninformed search method is blind search.
7. Which search is implemented with an empty first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of the mentioned
Explanation: Because of FIFO queue, it will assure that the nodes that are visited first will be expanded first.
8. How many types are available in uninformed search method?
a) 3
b) 4
c) 5
d) 6
Explanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.
9. When is breadth-first search is optimal?
a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned
Explanation: Because it always expands the shallowest unexpanded node.
10. How many successors are generated in backtracking search?
a) 1
b) 2
c) 3
d) 4
Explanation: Each partially expanded node remembers which successor to generate next because of these conditions, it uses less memory.