0% found this document useful (0 votes)
13 views2 pages

Theory-of-Computation-2018

This document is an examination paper for the B.C.A. degree in Theory of Computation, consisting of multiple sections with questions of varying marks. It includes questions on set operations, automata, regular expressions, and grammar transformations. The exam is structured into four sections, with specific instructions for answering each section.

Uploaded by

Shiji Mathew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
13 views2 pages

Theory-of-Computation-2018

This document is an examination paper for the B.C.A. degree in Theory of Computation, consisting of multiple sections with questions of varying marks. It includes questions on set operations, automata, regular expressions, and grammar transformations. The exam is structured into four sections, with specific instructions for answering each section.

Uploaded by

Shiji Mathew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
D51307 (Pages : 2) 10. uM 12. 13. 14. 15. ee nreee ep p THIRD SEMESTER B.C.A. DEGREE EXAMINATION NOVEMBER 2018 (CUCBCSS—UG) Complementary Course BCA 8C 06—THEORY OF COMPUTATION (2017 Admissions) : Three Hours Maximum : 80 Marks Section A Answer all the questions. Each question carries 1 mark. ‘What are the operations on sets ? What are the characteristics of automaton ? Define onto fanetion with example. ‘What you meant by complement of a set ? Define Finite automaton. Define Parse Tree. Define graph. Find R* if, R = (a,b), (6, ©), (c,a)) is a relation in (a, b,c. = What is the regular expression for the set of all strings containing at least 2a's if alphabet set is {a,b}. Define relation. (10 x 1 = 10 marks) Section B. Answer all the questions. Each question carries 2 marks. Explain various ways of describing a Set. Differentiate between Mealy machine and Moore machine. Explain derivation trees. Find the sets represented by the regular expression (aa)* + (aaa)*. Explain representation of a digraph. 16. 17. 18, 19. 20. ate 22. 23. 24. 25. 26. 27. 28. 29. 30. 35 32. 2 D 51307 Find the left most derivation for the string 00110101 if grammar G is : S— 0B|1A, A > 0]0S|1AA, A> 1/18 |OBB. Explain the properties of trees. Find R¢ , if R = ((1, 2), (2, 3), (2, 4) be a relation in (1, 2, 3, 4). (8x 2= 16 marks) Section © Answer any six questions. Each question carries 4 marks. Explain algebraic laws for regular expression. Define top down parsing. Prove that the number of vertices of odd degree in any graph is even. Write the steps to replace ,-movés froma transition system. Find L(G), if G = (S, C}, (a, 6), (S > aCa, C > aCalo}. Explain the procedure for transforming a mealy machine into a moore machine. Prove that every monotonic grammar G is equivalent a type 1 grammar. Construct a regular grammar G generating the regular set represented by P = a*b (a + b)*. Prove the following theorem by Induction: 1+2+34...+n=n(n+1)2. (6x 4 = 24 marks) Section D Answer any three questions. Each question carries 10 marks. How an NFA is converted to its equivalent DFA. Explain Arden’s theorem. Explain Chomsky classification of languages. Construct a grammar in Greibach Normal Form equivalent to the grammar S AB, A + BS|b,B +SA|a. Construct a finite automaton equivalent to the regular expression (0 + 1) * (00 + 11) (0 + 1)*. (8 x 10 = 30 marks)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy