Which one of the following is a correct implementation of the meta predicate "not" in PROLOG (Here G represents a goal) ?
A. | not(G):- !, call(G), fail . not (G) |
B. | not(G):- call(G), ! fail. not(G). |
C. | not(G):- call(G), fail, ! not(G). |
D. | not(G):- call(G), fail. not(G):-! |
Option: B Explanation : Click on Discuss to view users comments. |
Which one of the following is not an informed search technique
A. | Hill Climbing Search |
B. | Best First Search |
C. | A* search |
D. | Depth First Search |
Option: D Explanation :
Uninformed search strategies Click on Discuss to view users comments. |
If we convert
∃u ∀v ∀x ∃y (P ( f (u),v, x, y) → Q ( u , v ,y )) to
∀ v∀x (P(f(a),v, x, g(v,x)) → Q ( a , v ,g ( v , x ) ) )
This process is known as
A. | Simplification |
B. | Unification |
C. | Skolemization |
D. | Resolution |
Option: C Explanation : Click on Discuss to view users comments. |
Given two jugs of capacities 5 litre and 3 litre with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water wili be
A. | 3 |
||||||||||||||||||||||||||||||||
B. | 4 |
||||||||||||||||||||||||||||||||
C. | 5 |
||||||||||||||||||||||||||||||||
D. | 7 |
||||||||||||||||||||||||||||||||
Option: D Explanation :
Click on Discuss to view users comments. |