Scribd
Upload
30 views5 pages

Toc Unit 4 QB

toc

Uploaded by

Nehru V Assistant Professor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views5 pages

Toc Unit 4 QB

toc

Uploaded by

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

UNIT 4

PART A

1. The format: A->aB refers to which of the following? (CO4)(K1)


a) Chomsky Normal Form
b) Greibach Normal Form
c) Backus Naur Form
d) None of the mentioned

2. Which of the following does not have left recursions?(CO4)(K1)


a) Chomsky Normal Form
b) Greibach Normal Form
c) Backus Naur Form
d) All of the mentioned

3. Every grammar in Chomsky Normal Form is (CO4)(K1)


a) regular
b) context sensitive
c) context free
d) all of the mentioned

4. Which of the production rule can be accepted by Chomsky grammar?(CO4)(K1)


a) A->BC
b) A->a
c) S->e
d) All of the mentioned

5. Which of the following grammars are in Chomsky Normal Form:(CO4)(K1)


a) S->AB|BC|CD, A->0, B->1, C->2, D->3
b) S->AB, S->BCA|0|1|2|3
c) S->ABa, A->aab, B->Ac
d) All of the mentioned

6. Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in
___________.(CO4)(K1)
a) restricted form
b) parsed form
c) normal form
d) all of the mentioned

7. Which of the following is called Bar-Hillel lemma? (CO4)(K1)


a) Pumping lemma for regular language
b) Pumping lemma for context free languages
c) Pumping lemma for context sensitive languages
d) None of the mentioned

8. Which of the expressions correctly is an requirement of the pumping lemma for the context free
languages? (CO4)(K1)
a) uvnwxny
b) uvnwnxny
c) uv2nwx2ny
d) All of the mentioned

9. Using pumping lemma, which of the following cannot be proved as ‘not a CFL’? (CO4)(K1)
a) {aibici|i>=0}
b) {ss|s∈{a,b}*}
c) The set legal C programs
d) None of the mentioned

10. The pumping lemma is often used to prove that a language is: (CO4)(K1)
a) Context free
b) Not context free
c) Regular
d) None of the mentioned

11. Which of the following does not obey pumping lemma for context free languages ? (CO4)(K1)
a) Finite languages
b) Context free languages
c) Unrestricted languages
d) None of the mentioned

12. The context free languages are closed under: (CO4)(K1)


a) Intersection
b) Complement
c) Kleene
d) None of the mentioned

13. Which of the following is/are CFL not closed under? (CO4)(K1)
a) Reverse
b) Homomorphism
c) Inverse Homomorphism
d) All of the mentioned

14. Which of the following can be used to prove a language is not context free? (CO4)(K1)
a) Ardens theorem
b) Power Construction method
c) Regular Closure
d) None of the mentioned

15. A turing machine is a (CO4)(K1)


a) real machine
b) abstract machine
c) hypothetical machine
d) more than one option is correct

16. A turing machine operates over: (CO4)(K1)


a) finite memory tape
b) infinite memory tape
c) depends on the algorithm
d) none of the mentioned
17. Which of the functions are not performed by the turing machine after reading a symbol? (CO4)
(K1)
a) writes the symbol
b) moves the tape one cell left/right
c) proceeds with next instruction or halts
d) none of the mentioned

18. The ability for a system of instructions to simulate a Turing Machine is called ______(CO4)(K1)
a) Turing Completeness
b) Simulation
c) Turing Halting
d) None of the mentioned

19. A turing machine that is able to simulate other turing machines: (CO4)(K1)
a) Nested Turing machines
b) Universal Turing machine
c) Counter machine
d) None of the mentioned

20. Which of the problems are unsolvable? (CO4)(K1)


a) Halting problem
b) Boolean Satisfiability problem
c) Both (a) and (b)
d) None of the mentioned

21. Which of the following a turing machine does not consist of? (CO4)(K1)
a) input tape
b) head
c) state register
d) none of the mentioned

22. The value of n if turing machine is defined using n-tuples: (CO4)(K1)


a) 6
b) 7
c) 8
d) 5

23. If d is not defined on the current state and the current tape symbol, then the machine(CO4)(K1)
a) does not halts
b) halts
c) goes into loop forever
d) none of the mentioned

24. Which of the following are the models equivalent to Turing machine? (CO4)(K1)
a) Multi tape turing machine
b) Multi track turing machine
c) Register machine
d) All of the mentioned
25. A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents:
(CO4)(K1)
a) input alphabet
b) tape alphabet
c) shift symbols
d) none of the mentioned

26. According to Chomsky hierarchy, which of the following is adopted by Recursively


Ennumerable language? (CO4)(K1)
a) Type 0
b) Type 1
c) Type 2
d) Type 3

27. A multitape turing machine is ________ powerful than a single tape turing machine. (CO4)(K1)
a) more
b) less
c) equal
d) none of the mentioned

28. Which of the following is a multi tape turing machine? (CO4)(K1)


a) Post turing Machine
b) Wang-B Machine
c) Oblivious turing Machine
d) All of the mentioned

29. Which of the following does not exists? (CO4)(K1)


a) Turing Machine with Multiple heads
b) Turing Machine with infinite tapes
c) Turing machine with two dimensional tapes
d) None of the mentioned

30. Every language accepted by a k-tape TM is _____ by a single-tape TM. (CO4)(K1)


a) accepted
b) not accepted
c) generated
d) not generated

PART B

1. Describe the closure properties of context free language. (CO4)(K2)


2. Design a PDA to accept the language {wwR | w€{0,1}*}(CO4)(K3)
3. Conclude the procedure for converting CNF to GNF with an example(CO4)(K2)
4. Outline the multitape Turing Machine. (CO4)(K2)
5. Illustrate the Instantaneous Description of Turing Machine (CO4)(K2)
6. Illustrate the Basic Turing Machine model and explain in one move. What are the actions take
place in TM? (CO4)(K3)
7. Design Turing machine to accept language L={0n1n | n >=1}(CO4)(K3)
8. Design Turing machine to compute addition of two numbers. Assume unary notation for
number representation. (CO4)(K3)
9. Explain the significance of universal Turing machine. (CO4)(K2)
10. Outline the general notations for productions of each formal language from Chomsky
hierarchy. (CO4)(K2)
11. Show that normal single tape Turing machine can perform computations performed by multi-
tape Turing machine(CO4)(K3)
12. Design a TM to compute the 2’s complement of a binary string (CO4)(K3)

PART - C (12 marks)

13. Construct the following grammar G into GNF (CO4)(K3)


S→ CA | BB
B→ b | SB
C→b
A→a
14. Consruct the following grammar G into CNF. (CO4)(K3)
S→ ASB | €
A→ aAS | a
B →SbS | A | bb
15. Explain in detail about Pumping lemma for CFL with an example. (CO4)(K2)
i) Show that if a language is accepted by a multi tape Turing machine, it is accepted by a
single-tape TM . (6)
ii). Design a TM using multiple tracks to check whether the given input number is prime or
not (6)
16. Illustrate the various techniques for Turing machine Construction. (CO4)(K3)
17. Design a TM to perform the multiplication function f(m,n)=m*n using subroutine. (CO4)(K3)
18. i) Construct the Turing machine for the language L={anbncn} where n>=1. ()
19. ii)Construct the Turing machine for concatenation of two strings of unary numbers. (CO4)
(K3)
20. i) Design a turing machine for the language L The set of strings with an equal number of 0’s
and 1’s.
ii)Prove the equivalence of CFG and PDA. (CO4)(K3)

You might also like