# Math for Computer science Questions and Answers 191 to 200

## Math for Computer science

### Questions  191 to 200

191.
A Finite State Machine can be represented using
 (a) Grammar (b) Vocabulary (c) State Table (d) Output String (e) Input String.
192.
Type 1 grammars are called
 (a) Context Sensitive Grammar (b) Regular Grammar (c) Phrase Grammar (d) Context Free Grammar (e) Context Grammar.
193.
The numbers of the form 2n–1 ≡ 1 (mod n)  are called
 (a) Prime numbers (b) Relatively prime numbers (c) Pseudo prime numbers (d) Pseudo prime numbers to the base 2 (e) Pseudo prime numbers to the base b.
194.
Pseudo Random numbers  are generated by
 (a) Reccusive methods (b) Integer methods (c) Systematic methods (d) Sematic methods (e) Search methods.
195.
Dividend (a), Divisor(d) and Reminder(r) can be expressed in the form of
 (a) d = r Mod a (b) r = a Mod d (c) a = r Mod d (d) a = d Mod r (e) r =  d Mod a.
196.
According to Pascal’s Identity,
 (a) C(n+1, k) = C(n, k) + C(n-1, k) (b) C(n+1, k) = C(n-1, k-1) + C(n, k) (c) C(n+1, k) = C(n, k-1) + C(n, k) (d) C(n+1, k) = C(n, k-1) + C(n+1, k) (e) C(n+1, k) = C(n-k, k-1) + C(n+1, k).
197.
Let F(x) : x is a rose , P(x) :x is beautiful.
The statement “All roses are beautiful” equivalent to
 (a) (b) (c) (d) (e) .
198.
Type 3 grammars are called
 (a) Context Sensitive Grammar (b) Regular Grammar (c) Phrase Grammar (d) Context Free Grammar (e) Context Grammar.
199.
A Relation is said to be a function if
 (a) Every element of the second set is mapped to all elements of the first set (b) Every element of the second set is mapped to an element of the first set (c) Every element of the first  set is mapped to no element in second set (d) Every element of the first set is not mapped to atleast an element in second set (e) Every element of the first set is mapped to atleast an element in the second set.
200.
The symmetric closure of a relation is defined by
 (a) (b) (c) (d) (e) .

#### Answers

 191 Answer : (c) Reason:  by the definition of state table 192 Answer : (a) Reason:  by the definition of type 1 grammar 193 Answer : (d) Reason:  by the definitiion of pseudo random numbers to the base 2 194 Answer : (c) Reason:  By the definition of systematic methods 195 Answer : (b) Reason:  by the definition of mod function 196 Answer : (c) Reason:  by the definition of  Pascal’s Identity 197 Answer : (d) Reason:  for all x if x is rose then x is beautiful so the  English sentence All roses are beautiful has the equivalent form as 198 Answer : (b) Reason:  by the definition of type 3 grammar 199 Answer : (e) Reason:  By definition of a function Every element of the first set is mapped to atleast one element in second set. 200 Answer : (c) Reason:  by the definition of  symmetric closure

#### No comments :

What you think about these Questions and Answers ? Let me know in comments.