# UGC NET Computer Science Solved Questions December 2013 Paper 3 - Part 3

21.       Given the following statements:
S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not  equivalent.
S2:  The grammars S→ss | sss | asb | bsa | Î» and S→ss | asb | bsa | Î» are equivalent.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct
(C) S1 is not correct and S2 is correct
(D) Both S1 and S2 are not correct.
22.       What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below:
(A) 11
(B) 10
(C) 01
(D) 00
23.       High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences?
(A) Morphological
(B) Syntactic
(C) Semantic
(D) Pragmatic
24.       The objective of .................. procedure is to discover at least one ............... that causes two literals to match.
(A) unification, validation
(B) unification, substitution
(C) substitution, unification
(D) minimax, maximum
25.       If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if
(A) h* us equal to h
(B) h* overestimates h
(C) h* underestimates h
(D) none of these
26.       The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called
(A) backward planning
(B) goal stack planning
(C) operator subgoaling
27.       In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only.
(A) alpha, beta
(B) beta, alpha
(C) alpha, alpha
(D) beta, beta
28.       If A and B are two fuzzy sets with membership functions
ÂµA(X) = {0.2, 0.5, 0.6, 0.1, 0.9}
ÂµB(X) = {0.1, 0.5, 0.2, 0.7, 0.8}
Then the value of ÂµA∩B will be
(A) {0.2, 0.5, 0.6, 0.7, 0.9}
(B) {0.2, 0.5, 0.2, 0.1, 0.8}
(C) {0.1, 0.5, 0.6, 0.1, 0.8}
(D) {0.1, 0.5, 0.2, 0.1, 0.8}
Explanation:
Î¼A∩B(x) = min [Î¼A(x), Î¼B(x)]
Î¼Aá´œB(x) = max [Î¼A(x), Î¼B(x)]
ÂµA’(x) = 1 - ÂµA(x)
29.       The height of h(A) of a fuzzy set A is defined as
h(A) = sup A(x)
xÏµA
Then the fuzzy set A is called normal when
(A) h(A) = 0
(B) h(A) < 0
(C) h(A) = 1
(D) h(A) < 1