edited by
210 views
1 1 vote

Match List - I with List - II.

 LIST-I LIST-II
A.Hill climbingI.$O(b^d)$
B.Best first searchII.$O(bd)$
C.A* SearchIII.$O(1)$
D.Depth first searchIV.$O(b^m)$

 

Choose the correct answer from the options given below:

  1. $\text{(A)-(III), (B)-(I), (C)-(IV), (D)-(II)}$
  2. $\text{(A)-(II), (B)-(I), (C)-(IV), (D)-(III)}$
  3. $\text{(A)-(II), (B)-(IV), (C)-(I), (D)-(III)}$
  4. $\text{(A)-(I), (B)-(III), (C)-(II), (D)-(I)}$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
934
934 views
Arjun asked Jan 2, 2019
934 views
Match List I with List II and choose the correct answer from the code given below.List IList II(a)Greedy Best-First Search(i)Selects a node for expansion if optimal path ...
2 2 votes
3 3 answers
377
377 views
Shubham Sharma 2 asked Sep 9, 2025
377 views
Which of the following is $\text{TRUE}?$The cost of searching an AVL tree is $\theta(\log n)$ but that of binary search is $0(n)$The cost of searching an AVL tree in $\th...
0 0 votes
1 1 answer
250
250 views
Shubham Sharma 2 asked Sep 9, 2025
250 views
What is the generic structure of Multi Agent System (MAS)?Single agent with multiple objectivesMultiagents with a single objectivesMultiagents with diverse objectives and...
0 0 votes
0 0 answers
167
167 views
Shubham Sharma 2 asked Sep 9, 2025
167 views
Which of the following are commonly used parsing techniques in $\textrm{NLP}$ (Natural Language Processing) for syntatic analysis.Top down parsingBottom Up parsingDepende...