CS607P Midterm MCQs 2024 by Miss Mehwish

Past Papers for Mids./Finals are also Available

 Which searching algorithm among the following takes less memory?

 The DepthFirst Search algorithm is implemented in recursion with

UFO. UFA FIFO ✔️ FILA

•  among the following is incorrect for DFS and BFS. BFS is equivalent to level order traversal in trees BFS is implemented using Queue DFS is equivalent to post order traversal in trees ✔️ DFS and BFS code have the same time complexity

 What is true about Artificial Intelligence?

The Ability to act Rationally All of the Given ✔️ The Ability to Solve Problems The Ability to act like human beings

•  A search algorithm imposes a fixed depth limit on nodes. Depth Limited Search ✔️

Q1. What is the space complexity of Depthfirst search?

O(m) O(bm) ✔️ O(b)

2. Among the mentioned below attributes, which one is true about Iterative Deepening DFS? It is considered as the preferred informed search method

It is a depthfirst search with a fixed depth limit It does not perform DFS in a BFS fashion It's a Depth First Search Algorithm, but it does it one level at a time by gradually increasing the limit until a goal is found ✔️

Q3. Which searching algorithm among the following takes less memory?

4. AOE algorithm is used in the Game tree to make decisions of Win and Lose. Greedy Search Algorithm

Heuristic Search Algorithm DFS/BFS algorithm Min/Max Algorithm ✔️

5. Depth First Search is equivalent to ________ of the traversal in Binary Trees.

Q6. What will be the time complexity of the iterative depthfirst search traversal code, where V = No. of Vertices, E = No. of Edges?

O(V+E) ✔️ O(v) O(V\E) O(E)

7. A search algorithm requires less memory than __________ algorithm. Brute Force Search, Depth First Search

Breadth First Search, Depth First Search ✔️ Breadth First Search, Optimal Search Depth First Search, Breadth First Search