Scribd
Upload
14 views

Theory of Computation Nov 2021

This document appears to be an exam for a Theory of Computation course, consisting of 3 sections with multiple choice and written answer questions. Section A has 12 multiple choice questions worth 3 marks each, for a total of 24 marks. Section B has 5 written answer questions worth 5 marks each, for a total of 25 marks. Section C has 2 written answer questions, one worth 11 marks. The questions cover topics such as sets, functions, grammars, parsing, automata, graphs, and Turing machines.

Uploaded by

Michael godson
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
14 views

Theory of Computation Nov 2021

This document appears to be an exam for a Theory of Computation course, consisting of 3 sections with multiple choice and written answer questions. Section A has 12 multiple choice questions worth 3 marks each, for a total of 24 marks. Section B has 5 written answer questions worth 5 marks each, for a total of 25 marks. Section C has 2 written answer questions, one worth 11 marks. The questions cover topics such as sets, functions, grammars, parsing, automata, graphs, and Turing machines.

Uploaded by

Michael godson
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

1

137219

4
D 11994 (Pages : 2) Name.........................................

Reg. No.....................................

1
THIRD SEMESTER (CBCSS–UG) DEGREE EXAMINATION
NOVEMBER 2021

1
B.C.A.
BCA 3C 06—THEORY OF COMPUTATION
(2019—2020 Admissions)

Time : Two Hours Maximum : 60 Marks


Section A
Answer atleast eight questions.

1
Each question carries 3 marks.
All questions can be attended.
Overall ceiling 24.

4
1. What is Set and explain various ways of describing a set ?
2. What is a mealy machine ?
3. Explain relations. What are its properties ?

1
4. Define one-to-one function with example.
5. Define Grammar.

1
6. Explain parse tree in detail.
7. Define top down parsing.
8. Define Pushdown automata.

9. If n ≥ 1, show that 1.1! + 2 .2! + ... + n. n! = (n + 1)! – 1.


10. What are the identities for regular expression ?
11. What is a transition system ?

12. Show that f : R → R − {1} given by f (x) = (x + 1)/(x – 1) is onto.

1
(8 × 3 = 24 marks)
Section B

4
Answer atleast five questions.
Each question carries 5 marks.
All questions can be attended.

1
Overall ceiling 25.

13. Show that a connected graph G with n vertices and n – 1 edges ( n ≥ 3 ) has at least one leaf.

1
14. Explain Chomsky classification of languages.

Turn over

137219
1
137219

4
2 D 11994

15. Explain tree and its properties.

1
16. Explain ambiguous grammars. If G is the grammar S → SbS|a, check G is ambiguous or not.
17. Explain Normal Forms for Context free Grammars.

1
18. Prove the theorem by induction : A tree with n vertices has (n – 1) edges.
19. Define Turing Machine.
(5 × 5 = 25 marks)
Section C
Answer any one question.
Each question carries 11 marks.
20. Prove that the theorem, if L is then there set accepted by NDFA, then there exists a DFA which

1
also accepts L.
21. Define Chomsky normal form. Find a grammar in CNF equivalent to :

S → aAD, A → aB|bAB, B → b, D → d.

4
(1 × 11 = 11 marks)

1 1
1 41
1
137219

You might also like