Math for Computer science
Questions 161 to 170
161.

Which of the
following statement is false?


Denote (p Ù (not q) Ù (not r)) by f. Choose the correct statement from
the following:


Let R be the
relation on {1, 2, 3, 4} defined by “x is less than y”. R is


Let R be a
relation from the set A to set B. Which of the following is correct?


The symbols of
vocabulary which cannot be replaced by other symbols are called


The two Finite
State Automata are called equivalent if they recognize


An algorithm in
which it solves a problem by reducing it to an instance of the same problem
with smaller inputs.


The value of
f(3) given f(0) = f(1) = 1 and f(n + 1) = f(n) – f(n – 1) is


If 7 ≡ 2 (Mod 5)
and 11≡ 1(Mod 5), then

170.

Suppose that A is a
subset if V*. Then the set consisting of concatenations of arbitrarily many
strings from A represented by A* is called
(a) Symmetric closure (b)
Reflexive closure
(c) Kleene closure
(d)
Finite closure (e) Finite state closure.

161. (c) ,162 . (e) , 163 (b) , 164(a) , 165(a),166(c),167(c),168(d),169(b),170(c)
ReplyDeletethanks for your suggestions.
Delete