State space search, heuristic evaluation, alpha-beta pruning, first-order logic, resolution, supervised/unsupervised learning, backpropagation. In the Nepal Engineering Council (NEC) licensure examination, exactly 10 questions carrying 1 mark each are set from this section with zero negative marking.
10 Marks
10% of total exam10 MCQs
1 Mark each12 Mins
72 sec / questionNone (0)
Answer all questionsAll study materials, past question papers, and solutions hosted directly for download:
A* tree search is optimal if the heuristic h(n) is admissible (never overestimates the true cost to reach the goal). For graph search, h(n) must also be consistent (monotonic).
Because the XOR function is not linearly separable in 2D space. A single linear decision boundary cannot separate the positive outputs from the negative outputs.