Table of Content

UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)


Question 1
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.
To find a path involving the fewest number of steps, we should set -
A
g = 0
B
h' = 0
C
g = 1
D
h' = 1
Question 2
The transform which possesses the highest ‘energy compaction’ property is
A
Fourier transform
B
Slant transform
C
Karhunen-Loeve transform
D
Cosine transform
Question 3
Which one of the following prolog programs correctly implement ?
if G succeeds then 
    execute goal P 
else 
    execute goal q
A
All of the above
B
if-else (G, P, q) :- call(G), call(P), !.
if-else (G, P, q) :- call(q).
C
if-else (G, P, q) :- call(G), !, call(P).
if-else (G, P, q) :- call(q).
D
if-else (G, P, q) :- !, call(G), call(P).
if-else (G, P, q) :- call(q).
Question 4
The _______ memory allocation function modifies the previous allocated space.
A
free( )
B
malloc( )
C
realloc( )
D
calloc( )
Question 5
Which is not the correct statement(s) ?
  1. Every context sensitive language is recursive.
  2. There is a recursive language that is not context sensitive.
A
(1) is false, (2) is false
B
(1) is true, (2) is true
C
(1) is false, (2) is true
D
(1) is true, (2) is false