UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)admin
A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where -
- g is a measure of the cost of getting from initial state to the current node and the function
- h' is an estimate of the cost of getting from the current node to the goal state.
g = 0
h' = 0
g = 1
h' = 1
The transform which possesses the highest ‘energy compaction’ property is
Which one of the following prolog programs correctly implement ?
if G succeeds then execute goal P else execute goal q
All of the above
if-else (G, P, q) :- call(G), call(P), !. if-else (G, P, q) :- call(q).
if-else (G, P, q) :- call(G), !, call(P). if-else (G, P, q) :- call(q).
if-else (G, P, q) :- !, call(G), call(P). if-else (G, P, q) :- call(q).
The _______ memory allocation function modifies the previous allocated space.
Which is not the correct statement(s) ?
- Every context sensitive language is recursive.
- There is a recursive language that is not context sensitive.
(1) is false, (2) is false
(1) is true, (2) is true
(1) is false, (2) is true
(1) is true, (2) is false