 Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Tuesday, 13 February 2018

21.       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 = 1
(B) g = 0
(C) h' = 0
(D) h' = 1
22.       The transform which possesses the highest ‘energy compaction’ property is
(A) Slant transform
(B) Cosine transform
(C) Fourier transform
(D) Karhunen-Loeve transform
23.       Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal q?”
(A) if-else (G, P, q) :- !, call(G), call(P).
if-else (G, P, q) :- call(q).
(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) All of the above
24.       The ………….. memory allocation function modifies the previous allocated space.
(A) calloc( )
(B) free( )
(C) malloc( )
(D) realloc( )
25.       Which is not the correct statement(s)?
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.
(A) (i) is true, (ii) is false.
(B) (i) is true and (ii) is true.
(C) (i) is false, (ii) is false.
(D) (i) is false and (ii) is true.
26.       The mechanism that binds code and data together and keeps them secure from outside world is known as
(A) Abstraction
(B) Inheritance
(C) Encapsulation
(D) Polymorphism
27.       Identify the addressing modes of below instructions and match them :
(b) STA (2) Direct addressing
(c) CMA (3) Implied addressing
(d) SUB (4) Register addressing
(A) a – 1, b – 2, c – 3, d – 4
(B) a – 2, b – 1, c – 4, d – 3
(C) a – 3, b – 2, c – 1, d – 4
(D) a – 4, b – 3, c – 2, d – 1
28.       Which one of the following is not a Greibach Normal form grammar?
(i)            S®a|bA|aA|bB
A®a
B®b
(ii)           S®a|aA|AB
A®a
B®b
(iii)          S®a|A|aA
A®a
(A) (i) and (ii)
(B) (i) and (iii)
(C) (ii) and (iii)
(D) (i), (ii) and (iii)
29.       Which of the following IP address class is a multicast address?
(A) Class A
(B) Class B
(C) Class C
(D) Class D