A cryptarithmetic problem of the type
SEND
+ MORE
---------------
MONEY
---------------
Can be solved efficiently using
| A. | depth first technique |
| B. | breadth first technique |
| C. | constraint satisfaction technique |
| D. | bidirectional technique |
|
Option: C Explanation : Click on Discuss to view users comments. |
A* algorithm is guaranteed to find an optimal solution if
| A. | h' is always 0. |
| B. | g is always 1. |
| C. | h' never overestimates h. |
| D. | h' never underestimates h. |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. | (i) is true and (ii) is true. |
| B. | (i) is true and (ii) is false. |
| C. | (i) is false and (ii) is true. |
| D. | (i) is false and (ii) is false |
|
Option: B Explanation : Click on Discuss to view users comments.
(i) ∀x ∀y Z ∃ θ(x, y, z)
(ii) ∃Z ∀x ∀y θ(x, y, z)
Where x, y, z are real numbers. Then which one of the following is correct ?
|
