Question:
Match List I with List II. LIST I LIST II (A) A* Algorithm (I) Space complexity is O4, where d = depth of the deepest optimal solution. (B) Recursive Best First Search (II) Incomplete even if the search space is finite. (C) Recursive Best First Search (III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution. (D) SMA* Algorithm (IV) Computation and space complexity is too high.
Choose the correct answer from the options given below:
Match List I with List II.
Choose the correct answer from the options given below:
| LIST I | LIST II |
|---|---|
| (A) A* Algorithm | (I) Space complexity is O4, where d = depth of the deepest optimal solution. |
| (B) Recursive Best First Search | (II) Incomplete even if the search space is finite. |
| (C) Recursive Best First Search | (III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution. |
| (D) SMA* Algorithm | (IV) Computation and space complexity is too high. |
Show Hint
Remember that A* is optimal and complete if the heuristic is admissible and consistent, while greedy search is incomplete in finite spaces.
Updated On: Dec 29, 2024
- (A) - (II), (B) - (IV), (C) - (III), (D) - (I)
- (A) - (III), (B) - (II), (C) - (I), (D) - (IV)
- (A) - (II), (B) - (III), (C) - (I), (D) - (IV)
- (A) - (IV), (B) - (I), (C) - (III), (D) - (II)
Hide Solution
Verified By Collegedunia
The Correct Option is C
Solution and Explanation
(A) Greedy best first search → (II) Incomplete even if the search space is finite. (B) A* → (III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution. (C) Recursive best first search → (I) Space complexity is o(d) where d is the depth of the deepest optimal solution. (D) SMA* → (IV) Computation and space complexity is too high.
Was this answer helpful?
0
0
Top Questions on Algorithm
- Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is:
- Match List I with List II;Choose the correct answer from the options given below:
LIST I LIST II (A) Bucket sort (I) O(n²) (B) Matrix chain multiplication (II) O(n³) (C) Huffman codes (III) O(n log n) (D) Dijkstra’s Algorithm (IV) O(n) - Rank the following functions by order of growth (Highest running time to lowest running time):
1. n × 3^n
2. 2^log(n)
3. n^(2/3)
4. 4^n
5. 4^log(n)
Choose the correct answer from the options given below: - Let A be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3, and B be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?
- A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst-case running time of this computation is:
View More Questions
Questions Asked in CUET PG exam
- Match List I with List II:Choose the correct answer from the options given below:
LIST I (Plant) LIST II (Active Principle) A Oleander I Nerin B Betel Nut II Arecoline C Aconite III Pseudaconitine D Tobacco IV Nicotine - CUET (PG) - 2024
- Forensic Toxicology
- Match List I with List II:Choose the correct answer from the options given below:
LIST I (Branches) LIST II (Study area) A Podogram I Footprints B Cheiloscopy II Fingerprints C Palatoscopy III Lip prints D Dactylography IV Palatal rugae - CUET (PG) - 2024
- Forensic Science
- For a certain establishment, the total revenue function $R$ and the total cost function $C$ are given by \[ R = 83x - 4x^2 - 21 \quad \text{and} \quad C = x^2 - 12x + 48x + 11, \] where $x$ is the output. Obtain the output for which profit is maximum.
- CUET (PG) - 2024
- Microeconomics
- Match the following African novels in List I with the authors in List II:
List I (\(\text{African\ Novels}\)) List II (\(\text{Authors}\)) A. Things Fall Apart I. Chimamanda Ngozi Adichie B. Petals of Blood II. Tayeb Salih C. Season of Migration to the North III. Ngũgĩ wa Thiong’o D. Half of a Yellow Sun IV. Chinua Achebe - CUET (PG) - 2024
- Comparative Literature and Translations Studies
Match List I with List II:
List I List II A. Spinal poison I. Carbon monoxide B. NH2- II. Linear C. NH4+ III. Tetrahedral D. [PtCl4]- IV. Square planar Choose the correct answer from the options given below:
- CUET (PG) - 2024
- Coordination chemistry
View More Questions