Tilka Manjhi Bhagalpur University 2007 M.C.A CS 23-Discrete mathematics and automata theory - Question Paper
Discrete mathematics and automata theory
COPYRIGHT RESERVED MCA-CS(23)
Time : 3 hours Full Marks : 80
Candidates are required to give their answer in their own words as far as practicable.
The questions are of equal value.
Answer any five questions choosing at least two from each group Group A'
Discuss the various set operations? Explain Cartesian product and De Morgans law in this regards.
2, What do you mean by binary relation, domain and range, solution set and graph representation, type* inverse, identify and universal.
JX'. What do you mean by relation matrix and discuss the following properties of relations - reflexiye, antijjeflexive, symmetric, transitive, nonirnsitive, equivalence.
4. In connection with Boolean algebra explain the following -negative, conjunction, disjunction, XOR, NAND, NOR. Explain SOP and POS form.
(Turn Over)
Group B
5. What is finite Automata? Describe the property of finite
Automata. Convert NFA given Transaction diagram.
|
n |
 |
/Describe the MOORE and MILEARY Machine and convert given MOORE Machine to equivalent MILEARY Machine.
J/ Describe the Ardens theorem. Find the regular Expression for transaction diagram is given below.
8. Describe the pumping Lemma/Theorem for regular Language, and prove that L={OT|i>l} is not regular or regular.
9. (a) Give the C.F.G. for Generating an alternating sequence 10
S and1S.
(b) Design a context free grammar which can produce balanced parenthesis.
throve that (1+00*1) + (1 + 00*1) (0+10*1) * (0+10*1) = 0*1 (0 + 10*1)* by using Identities for regular expression.
(3) (Turr over)
|
Attachment: |
| Earning: Approval pending. |
