Math for Computer science
Questions 191 to 200
191.

A
Finite State Machine can be represented using


Type
1 grammars are called


The
numbers of the form 2^{n–1 }≡
1 (mod n) are called


Pseudo Random numbers
are generated by


Dividend
(a), Divisor(d) and Reminder(r) can be expressed in the form of


According
to Pascal’s Identity,


Let
F(x) : x is a rose , P(x) :x is beautiful.
The
statement “All roses are beautiful” equivalent to


Type
3 grammars are called


A
Relation is said to be a function if


The
symmetric closure of a relation is defined by

Answers
191.

Answer
: (c)
Reason: by the definition of state table

Answer
: (a)
Reason: by the definition of type 1 grammar


Answer
: (d)
Reason: by
the definitiion of pseudo random numbers to the base 2


Answer
: (c)
Reason: By
the definition of systematic methods


Answer
: (b)
Reason: by the definition of mod function


Answer
: (c)
Reason: by the definition of Pascal’s Identity


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 _{}


Answer
: (b)
Reason: by the definition of type 3 grammar


Answer
: (e)
Reason: By definition of a function Every element of
the first set is mapped to atleast one element in second set.


Answer
: (c)
Reason: by the definition of symmetric closure

No comments :
Post a Comment