Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
In lexicographic ordering, comparison is done from left to right.
Given order is:
$0<1$
Now compare the given strings:
$0001$ comes before $001$ because at the third position, $0<1$.
So,
$0001<001$
Now,
$001<010$ because at the second position, $0<1$.
Also,
$010<0101$ because $010$ is a prefix of $0101$.
Now compare $0101$ and $011$:
First digit is same.
Second digit is same.
Third digit gives:
$0<1$
So,
$0101<011$
Therefore, the correct lexicographic order is:
$0001<001<010<0101<011$
Given order is:
$0<1$
Now compare the given strings:
$0001$ comes before $001$ because at the third position, $0<1$.
So,
$0001<001$
Now,
$001<010$ because at the second position, $0<1$.
Also,
$010<0101$ because $010$ is a prefix of $0101$.
Now compare $0101$ and $011$:
First digit is same.
Second digit is same.
Third digit gives:
$0<1$
So,
$0101<011$
Therefore, the correct lexicographic order is:
$0001<001<010<0101<011$
Solution
Greedy Best-First Search selects the node that appears closest to the goal according to heuristic value.It may get trapped and can be incomplete even if the search space is finite.
So, (A) matches with II.
$A^*$ search is optimal and complete under proper conditions, but its computation and space complexity are very high because it stores many generated nodes.
So, (B) matches with IV.
Recursive Best-First Search uses limited memory and its space complexity is linear in depth.
So, (C) matches with I.
$SMA^*$ means Simplified Memory-Bounded $A^*$.
It is optimal if the optimal solution is reachable within available memory; otherwise, it returns the best reachable solution.
So, (D) matches with III.
Final matching is:
A-II, B-IV, C-I, D-III
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
