Explanation: At each level of tree DFS is performed. Main drawback of this algorithm is shallow nodes are expanded again and again. 5. LIFO is ______ where as FIFO is ________?
A. Stack, Queue
B. Queue, Stack
C. Priority Queue, Stack
D. Stack. Priority Queue
Answer:A
Explanation: At each level of tree DFS is performed. Main drawback of this algorithm is shallow nodes are expanded again and again. 5. LIFO is ______ where as FIFO is ________?
A. Stack, Queue B. Queue, Stack C. Priority Queue, Stack D. Stack. Priority Queue
Explanation: LIFO is last in first out – Stack. FIFO is first in first out – Queue. 6. When the environment of an agent is partially observable in search space following problem/problems could occur.