Master of Computer Application (MCA) Semester 5 MC0082 Theory of Computer Science 4 Credits (Book ID: B0970

)

Assignment Set 1 (60 Marks) Each Question Carries 10 Marks 10 X 6 = 60 Marks 1. Define the concept of equivalence relation. Give atleast two examples of equivalence relation.

For Complete Solved SMU Assignment @ 1500 Rs Email: mba8182@gmail.com Ph: 09873669404
2. Prove by Mathematical Induction that 4 ) 1( .... 3 2 1 2 2 3 3 3 3       n n n 3. Prove that a graph G is connected if and only if it has a spanning tree. 4. Prove that is an equivalence relation. ) (modmba  5. Explain the concept of a Transition graph. 6. Explain the steps of conversion of Mealy machine into Moore machine

Master of Computer Application (MCA) Semester 5 MC0082 Theory of Computer Science 4 Credits (Book ID:B0970) Assignment Set 2 (60 Marks)

Each Question Carries 10 Marks 10 X 6 = 60 Marks 1. Construct a grammar for the language .  ji j i b a L j i   , 1, / 2.

For Complete Solved SMU Assignment @ 1500 Rs Email: mba8182@gmail.com Ph: 09873669404
2. Write short notes on Deterministic Finite Automata. 3. Describe the technique of conversion from NDFA to DFA. 4. Prove by Mathematical Induction that 6 ) 12 )(1( ..... 3 2 1 2 2 2 2        n n n n 5. Find a regular expression to accept a language consisting of strings of a s and b s of odd length. 6. State and prove Pumping Lemma.

Sign up to vote on this title
UsefulNot useful