R

Ranjeet • 34.60K Points
Instructor I

Q. What is true aboout Iterative Deepening DFS?

  • (A) it does not perform dfs in a bfs fashion.
  • (B) it is the preferred informed search method
  • (C) it’s a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found.
  • (D) is a depth-first search with a fixed depth limit l
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The ____ language allows more than one method in a single class.

Q. symbol is used to signify write back mode.

Q. A ________ is a condition during the life of an object during which it satisfies performs some activity or waits for some event.

Q. What is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?

Q. Cryptanalysis is used

Q. A process having multiple threads of control implies

Q. The features of traditional IPSes are found in all of these modern systems, except:

Q. Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?

Q. COCOMO cost model

Q. If you pass an array as an argument to a function, what actually gets passed?

Question analytics