Scribd
Upload
22 views2 pages

TOC Sup Nov Bca Stud

Toc

Uploaded by

msklgx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

TOC Sup Nov Bca Stud

Toc

Uploaded by

msklgx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

D 91725 (Pages: 2) Name.

sssss
Reg. No...

THIRD SEMESTER (CUCBCSS-UG) DEGREE EXAMINATION


NOVEMBER 2020

B.C.A.
BCA 3C 06-THEORY OF COMPUTATION

(2017 Admissions)
Maximum: 80 Marks
Time: Three Hours
Section A

Answer all the questions.


Each question carries 1 mark.

1. What is a transition system?


2. What is a mealy machine?

3. Explain relations. What areits properties?


4. Define one-to-one function with example.

5. Define grammar.

6. What is yield?
7. Define digraph.
8. What is derivation tree?
9. Find the regular expression for the set of all strings containing exactly 2a's if alphabet set is la, b}.

10. What are the properties of a relation?

(10x 1 10 marks)
Section B

Answer all the questions.


Each question carries 2 marks.

11. Define five postulates on binary operations.


12. Find the sets represented by the regular expression (a +6) * (aa + ab + bb + ba)*

13. Explain tree and its properties.

14. Define PDA.

Turn over
2 D 91725

15. What are the properties of transition functions ?

16. Find the derivation tree for the string 00110101 if grammar

Gis S->0B |1A, A -0 (0s|1 AA, A ->1|1s|OBB.

17. Define Turing Machine.


18. Explain various ways of describing a Set.
(8 x 2 16 marks)

Section C

Answer any six questions.


Each question carries 4 marks.

19. Explain Chomsky classification of languages.

20. Write the steps for construction of top down parser

21. Show that the grammar G is ambiguous if S+SbS|a.

22. Find L (G), if G is S- aSbsa|b.


23. Prove that the theorem: A tree withn vertices has (n - 1) edges.

24. Explain about Non Deterministic Finite State Automaton.

26. What are the identities for regular expression?


26. Explain bottom up parsing with suitable example.

27. Explain ambiguous grammars with example.


(6x 4 24 inarks)
Section D

Answer any three questions.


Each question carries 10 marks.

28. Construct a grammar in Greibach Normal Form equivalent to


the grammar S> AA|a, A > SS|b.
DFA which also accepts L.
that, If Lis the set accepted by NDFA, then there exists
a
29. Prove

30. Explain Arden's theorem.

31. Write steps for minimization of automata with suitable example.


32. Construct a DFA if the regular expression is 10+(0+11)0*1.
(3 x 10 30 marks)

You might also like