Artificial Intelligence Questions & Answers – Uninformed Search Strategy

«
»

This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Uninformed Search Strategy”.

1. Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned
View Answer

Answer: a
Explanation: In blind search, We can search the states without having any additional information. So uninformed search method is blind search.
advertisement

2. How many types are available in uninformed search method?
a) 3
b) 4
c) 5
d) 6
View Answer

Answer: c
Explanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.

3. 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
View Answer

Answer: b
Explanation: Because of FIFO queue, it will assure that the nodes that are visited first will be expanded first.
advertisement
advertisement

4. 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
View Answer

Answer: b
Explanation: Because it always expands the shallowest unexpanded node.

5. How many successors are generated in backtracking search?
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: a
Explanation: Each partially expanded node remembers which successor to generate next because of these conditions, it uses less memory.
advertisement

6. What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
View Answer

Answer: d
Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree.

7. How many parts does a problem consists of?
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: d
Explanation: The four parts of the problem are initial state, set of actions, goal test and path cost.
advertisement

8. Which algorithm is used to solve any kind of problem?
a) Breadth-first algorithm
b) Tree algorithm
c) Bidirectional search algorithm
d) None of the mentioned
View Answer

Answer: b
Explanation: Tree algorithm is used because specific variants of the algorithm embed different strategies.

9. Which search algorithm imposes a fixed depth limit on nodes?
a) Depth-limited search
b) Depth-first search
c) Iterative deepening search
d) Bidirectional search
View Answer

Answer: a
Explanation: None.
advertisement

10. Which search implements stack operation for searching the states?
a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of the mentioned
View Answer

Answer: b
Explanation: It implements stack operation because it always expands the deepest node in the current tree.

Sanfoundry Global Education & Learning Series – Artificial Intelligence.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

advertisement
advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn | Youtube | Instagram | Facebook | Twitter