FPC
Logic
Groups
Relations
Finite Automata
100
n!
What is the product of first n natural numbers?
100
T F F F
Write the truth table of conjunction.
100
An algebraic system with 1. Closure Law 2. Associative Law 3. Identity Law with an identity element
Define Monoid.
100
Reflexive Property Irreflexive Property Symmetric Property
Properties of relations.
100
The number of stacks are zero
Finite automaton requires ________ number of stacks.
200
n!
What is nPn?
200
Agra city is in bombay or Rose is sweet smelling
What is the disjunction of following statements? p: Agra city is in bombay q: Rose is sweet smelling
200
A monoid with inverse law
Define group.
200
A relation is reflexive, symmetric and transitive
An equivalence relation
200
Extended transition function
What δ* denotes?
300
A committee of 5 members to be chosen from a group of 12 people.
Give an example of a combinations.
300
If he wins in the election then he will be the leader of the party.
An example of Implication (Conditional)
300
The group which satisfies commutative law
When group becomes an abelian group.
300
Whenever (a,b) and (b,a) are in a relation R, then a must be equal to b.
state antisymmetric property.
300
∑+= ∑* - ε
Represent kleene plus in terms of kleene star and epsilon.
400
A child has 8 frocks and 4 pairs of shoes. Number of ways the child can dress herself is 32
is an example of permutation
400
The expression which contain the idea of quantity.
What is a quantifier?
400
An example of algebraic system because the set of natural numbers is closed w.r.t + and *
400
Each element in the co-domain B appears as the image of at least one element of the domain A.
Onto or Surjective function.
400
DFA
Which machine has got 5 components?
500
n(n-3)/2
What is the number of diagonals in a polygon?
500
If p->q and q->r are true statements, then p->r is true.
State the rule of syllogism.
500
If there exists an element g E G such that every element of G can be written as some power of g.
Definition of cyclic group
500
2mn
What is the Number of different relation from a set with n elements to a set with m elements?
500
A state for which there exists transitions to itself for all the input symbols chosen.
What is a trap state?
M
e
n
u