APCE/IQAC/QB/1

Om Sakthi
ADHIPARASAKTHI COLLEGE OF ENGINEERING
(NAAC ACCREDITED)
G.B. NAGAR, KALAVAI – 632 506, RANIPET DISTRICT

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

QUESTION BANK

SUBJECT CS3452-THEORY OF
CLASS I IYEAR–4TH SEM CSE
CODE&TITLE COMPUTATION
2023-2024
COURSE IN-CHARGE Mrs.S.SUGANYA AY
(EVEN SEM)

Vision:
 The vision of Information Technology department is to make the students recognized as an
international leader in engineering education, research and application of knowledge to benefit
society globally.

Mission:
 We make every decision to support the career and personal development of our students. Our
curriculum, teaching and services demonstrate that we value the diverse profiles of our learners.

Course Outcomes:
CO1 Construct automata theory using Finite Automata
CO2 Write regular expressions for any pattern
CO3 Design context free grammar and Pushdown Automata
CO4 Design Turing machine for computational functions
CO5 Differentiate between decidable and undecidable problems

Blooms Taxonomy:
REMEMBERING UNDERSTANDING APPLYING ANALYSING EVALUATE CREATE
R U A AN E C
 UNIT I– AUTOMATA AND REGULAR EXPRESSIONS

Q. No. Questions BT CO

PART–A

1 Define Hypothesis R CO1

2 Define inductive proof or State the principle of induction R CO1
3 What is structural induction? U CO1
4 What is proof by contradiction? R CO1
5 Define deductive proof R CO1
6 Define Set, Infinite and Finite Set. AN CO1
7 Prove 1+2+3+………………+n= n(n+1)/2 using induction method U CO1
Write down the operations on set.
i) A U B is Union Operation
8 R CO1
ii) A ∩ B is Intersection operation
iii) A – B is the difference operation
9 What is a finite automaton? AN CO1
10 Draw transition diagram for an identifier. AN CO1
Define Deterministic Finite Automata.
11 A CO1

12 Define Non-Deterministic Finite Automata. C CO1

13 Define NFA with € transition. A CO1

14 Design FA which accepts odd number of 1’s and any number of 0’s. A CO1

15 State the difference between NFA & DFA. C CO1

16 Define the term Epsilon(€) transition. U CO1

17 Define ξ –Closure (q) with an example. E CO1

18 Draw a NFA to accept strings containing the substring 0101. E CO1

19 Design FA to check whether given binary number is divisible by three. R CO1

20 Design FA which accepts odd number of 1’s and any number of 0’s. U CO1

PART- B
Prove the following by induction for all n≥0 R CO1
1 i. 1 2 +22 +32 +42 +…….+n2 =(n(n+1)(2n+1))/6
ii. 1 3 +23 +….+n3 =(n2 (n+1)2 )/4
 Prove A i. S(n)=52n -1 is divisible by 24 for n>0 R
ii. 1+2+……+n=(n(n+1))/
2 R CO1

If a Regular language ‘L‘ is accepted by a Non – deterministic Finite

3 U CO1
automata then there exist a Deterministic Finite Automata that accepts L
A Language ‘L‘ is accepted by some ε – NFA if and only if L is accepted
4 A CO1
by NFA without ε transition
5 Prove that L={0 2 i / i is an integer; i>0} is not regular. U CO1
Convert to a DFA, the following NFA

6 R CO1

(i) Compose that a language L is accepted by some ε–NFAif

and only if L is accepted by some DFA. (6)
(ii)Consider the following ε–NFA. Compute the ε–closure ofeach state
and find it‟ s equivalent DFA. (7)
7 ε a b C R CO1
p ф {p} {q} {r}
q {p} {q} {r} ф
*r {q} {r} ф {p}
Consider the following ε-NFA for an identifier. Consider the ε-closure of
each state and find it‘s equivalent DFA.

8 A CO1

Design a NFA accept the following strings over the alphabets {0,1} that
9 begins with 01 and ends with 11. Check for the validity of 01111 and U CO1
0110 strings.
Minimize the FA shown in fig below and show both the given and the
reduced one are equivalent.

10 A CO2

Write and explain the algorithm for minimization of a DFA. Using the
11 U CO2
above algorithm minimize the following DFA.
 Minimize the following automaton

12 R CO2

PART - C
1. (i) Draw and Explain the transition diagram for recognizing the set CO2
of all operators in c Language.(8)
Evaluate a DFA from the given NFA(7) M=({qo,q1},{a,b},δ,q0,{q1}
with the state table diagram for δ given below:
E

2. Construct the following ε-NFA to DFA.(15) CO2

3. Infer the DFA which is accepting the following language over the CO2
alphabet{0,1}.The set of all the strings beginning with a1 that
wheninterrupted as a binary integer , is multiple of 5, For example A
strings 101,1010 and 1111 are in the language 0,100 and 111 are not.(15)
4. Rewrite the basic approach to convert from NFA to regularexpression. C CO2
Illustrate with an example(15)

UNIT II– REGULAR EXPRESSIONS AND LANGUAGES

Q. No. Questions BT CO
PART–A
1 Differentiate regular expression and regular language R CO2
2 Give the regular expression for set of all strings ending in 00. R CO2
3 State pumping lemma for regular language. AN CO2
Give the regular expression for the following
4 L1= set of all strings of 0 and 1 ending in 00 R CO2
L2= set of all string 0 and 1 beginning with 0 and ending with 1
5 Name any four CFG R CO2
6 Is regular set is closed under complement? Justify. AN CO2
Construct NFA for the regular expression (0+1)01

7 U CO2

8 Prove or disprove that (r+s)*=r*+s*. A CO2

9 Give English description of the following language (0+10)*1*. AN CO2
10 Write RE for the set of strings over {0,1} that have atleast one. U CO2
Show whether a language L=(0^n 1^2^n/n>0} is regular or not using
11 R CO2
pumping Lemma
12 Create RE to describe an identifier and positive integer. C CO2
13 List the operators of Regular Expressions R CO2
14. Construct RE for the language over the set z={a,b} in which C CO2
total number of a’s are divisible by 3.
15. Construct a DFA for the regular expression aa*bb*. A CO2
16. Find out the language generated by the regular expression(0+1)*. E CO2
17. Is it true the language accepted by any NFA is different fromthe regular A CO2
language? Justify your answer.
18. Illustrate a regular expression for the set of all the strings have odd number A CO2
of 1’s R.E=1(0+11)*
19. Differentiate between regular expression and regular R CO2
20 State the precedence of RE operator. E CO2
PART B
State and explain the conversion of DFA into R.E using Arden‘s theorem. CO2
1 R
Illustrate with an example
i. Define regular expression. CO2
2 AN
ii. Show that (1+00*1)+(1+00*1)(0+10*1)*(0+10*1)=0*1(0+10*1)*
 CO2
3 Obtain minimized finite automata for the R.E (b/a)*baa E

Prove that there exists an NFA with €- transition that accepts the regular CO2
4 AN
expression r.
Which of the following language is regular? Justify.
CO2
5 i. L={ an b m /n,m>0} U
ii. ii. L={ an b n /n,>0}
Convert the following NFA into a R.E
CO2
6 R

Write and explain the algorithm for minimization of a DFA. Using the
CO2
7 above algorithm minimize the following DFA. U

Construct NFA with epsilon for the R.E=(a/b)*ab and convert into DFA and CO2
8 C
further find the minimized DFA.
Prove that the following languages are not regular:
i. {w€{a,b}*/w=w^r } CO2
9 A
ii. Set of string of 0‘s and 1‘s beginning with a 1, whose value treated as
binary number is a prime.
10 Demonstrate how the set L= {abn/n>=1} is not a regular.(13) CO2
E
11 Express that the regular languages are closed under:(13) (a)union CO2
(b)intersection(c)Kleene Closure(d)Complement (e)Difference E
PART C

1. (i) Deduce into regular expression that denotes the language accepted CO2
by following DFA.(7)
q1 q2
a
(ii) Evaluate the equalities for the following RE and prove for the same
(8)
E
a. b+ab* +aa*b+aa*ab*
b. a*(b+ab*).
a(a+b)*+aa(a+b)*+aaa(a+b)*
2. Set the algorithm for minimization of a DFA. Develop a minimized C CO2
DFA for the RE (a+b)(a+b)* and trace for the
(iii) string baaaab.(15)
3. Point out about the regular exression and regular Language. (15) A CO2

4. Develop the procedure for minimizing DFA with example (15) C CO2
 UNIT III – CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA

Q. No. Questions BT CO

PART A

1 Define CFG .Give an example. R CO3

2 What is CFL? R CO3

3 What is derivation? U CO3

4 What are the 2 types of derivation? R CO3

5 What is parse tree (or) derivation tree? R CO3

What is ambiguous grammar? Or When do you say grammar is
6 AN CO3
ambiguous?
For the grammar defined by the productions recognize the string 1001
7 U CO3
and also construct the parse tree.
Consider the alphabet Σ = { a,b,(,),+,*,-, . ,ξ }. Construct a CFG that
8 generate all the strings in Σ* that are regular expression on the R CO3
alphabet, Σ.
9 Find LMD & RMD, parse tree for the following grammar. AN CO3

10 Define sentential form AN CO3

Let G = ( {S,C}, {a,b}, P,S} where P consists of S ->aCa, C-
11 A CO3
>aCa,Find L(G))?
Write a grammar to recognize all prefix expressions involving all
12 binary arithmetic operators. Construct the parse tree for the sentence C CO3
“-*+abc/de” from your grammar.
Write the CFG for the following CFL L(G) = { a^m b^n c^p/ m+n=p,
13 A CO3
m&n>1}
What is the language generated by the grammar G=(V,T,P,S) where
14 A CO3
P={S->aSb, S->ab}?
15 If S->aSb | aAb , A->bAa , A->ba .Find out the CFL C CO3

16 Find the language generated by :S->0S1 | 0A | 0 |1B | 1 U CO3

17 Construct the grammar for the language L={ an b an | n>=1}. E CO3

Construct a grammar for the language L which has all the strings
18 E CO3
which are all palindrome over _={a, b}
19 Differentiate sentences Vs sentential forms. R CO3

20 What is a formal language? U CO3

21 Give the general forms of CNF. U CO3

 PART B
1. (i)Describe and draw the parse tree for the string 1+2*3Given
the grammar G=(V,  ,R,E)where V={E,D,1,2,3,4,5,6,7,9,0,+,-
,*,/,9,)}
 ={1,2,3,4,5,6,7,8,9,0,+,-,*,/,(,)} where R contains the
following rules :
E D|(E)|E+E|E-E|E/E C
D 0|1|2|…9 (6) CO3

(ii)Let G=(V,T,P,S) be a Context Free Grammar then prove that if the

recursive inference procedure call tells us that terminal string W is in
the language of variable A ,then there isa parse tree with a root A and
yield w. (7)
2. (i) Identify that deterministic PDA is less powerful than non CO3
nondeterministic PDA.(7)
Construct a PDA accepting {anbman / m, n>=1} by empty R
stack. Also tell the corresponding context-free grammar
accepting the same set.(6)
3. (i)Define Non Deterministic Push Down Automata. Is it truethat CO3
DPDA and NDPDA are equivalent in the sense oflanguage
acceptance is concern? Justify Your answer.(5) (ii)Convert PDA
to CFG.PDA is given by
P=({p,q},{0,1},{X,Y},δ,q,Z}, δ is defined by
δ(p,1,z)={(p,XZ)}, R
δ(p,ε,Z)={p, ε)},
δ(p,1,X)={(p,XX)},
δ(q,1,X)={(q, ε)},
δ(p,0,X)={(q,X0}
δ(q,0,Z)={(p,Z)} (8)
4. (i) Define PDA. Give an Example for a language accepted CO3
byPDA by empty stack.(7)
(ii) Convert the grammar S -
U
>0S1|A
A ->1A0|S| εinto PDA that accepts the same language by the
empty stack .Check whether 0101 belongs to N(M).(6)
5. (i) Analyze the theorem: If L is Context free language thenprove CO3
that there exists PDA M such that L=N (M). (7) A
Prove that if there is PDA that accepts by the final statethen
there exists an equivalent PDA that accepts by Null State.(6)
6. Solve the following grammar CO3
SaAa | bBb | BB
A C B S |
A
C  S | ε for the string abaaba .Give E
i) Left most derivation(3)
ii)Right most derivation(3)
 iii)Derivation Tree(3)
iv) For the string abaabbba, find the right most derivation.(4)
8. (i) ExamineConstruct the grammar for the following PDAM. CO3
M=({q0, q1},{0,1},{X,z0},δ,q0,Z0,Φ) and where δis given by
δ(q0,0,z0)={(q0,XZ0)},
δ(q0,0,X)={(q0,XX)},
δ(q0,1,X)={(q1, ε)}, A
δ(q1,1,X)={(q1, ε)},
δ(q1,ε,X)={(q1, ε)},δ(q1,
ε, Z0)=
{(q1, ε)}. (7)
Prove that if L is N(M1) for some
PDA M1 then L is L(M2 ) for some
PDA M2. (6)
9. Construct a PDA that recognizes and analyzesthe language CO3
{aibjck| i,j,k>0 and i=j or i=k}. A
Explain about PDA acceptance
i) From empty Stack to final state. (6)
From Final state to Empty Stack. (7)
10. Examine and construct a CFG G which accepts N(M), where CO3
M=({q0, q1},{a,b},{z0,z},δ,q0,z0,Φ) and where δis given by
δ(q0,b,z0)={(q0,zz0)}
δ(q0, ε,z0)={(q0, ε)}
δ(q0,b,z)={(q0,zz)}
δ(q0,a,z)={(q1,z)} R
δ(q1,b,z)={(q1, ε)
δ(q1,a,z0)={(q0,z0)}
Show that anbncn is not context free language i.e show that theset
of strings of a’ s and b’s and c’s with an equal number of each is
not context free(13)
11. (i) Describe the PDA that accept the given CFG (7) CO3
S→xaax U
X→ax/bx/€
Express a PDA for the language anbman+m (6)
12. (i) Illustratea PDA for the language {WCWR/W€{0,1}}.(7) A CO3
(ii) Illustrate a CFG for the constructed PDA. (6)
13. (i) Identify CFG for the language L={0 i1j 0k | j>i+k} (7) CO3
Define derivation tree. Explain its uses with anexample.(6) A
14. (i) Discuss about PDA and CFL Prove the equivalence of PDAand CO3
CFL.(6) U
(ii) If L is Context free language then prove that there exists
PDA M such that L=N(M). (7)
15. CO3
(i) Describe the different types of acceptance of a PDA. Are they
equivalent in sense of language acceptance? Justify youranswer. R
(7)
Design a PDA to accept {0n1n|n>1}.Draw the transition diagram for
the PDA and identify the instantaneous description(ID)of the PDA
 which accepts the string ‘0011.(6)

16. (ii) Identify that deterministic PDA is less powerful than non CO3
nondeterministic PDA.(7)
Construct a PDA accepting {anbman / m, n>=1} by emptystack. Also R
tell the corresponding context-free grammar accepting the same
set.(6)
PART - C

1. (i) Design and Explaina PDA to accept each of the following CO3
language E
{aibjck|i=j or j=k}(7)
The set of all string with twice as many 0’s and 1’s. (8)
2. (i) Let P be a PDA with empty stack language L=N(P) and suppose CO3
that ε is not in L. Designhow you would modify P so that it accepts C
L U { ε} by empty stack.(8).
Design a DPDA for even length palindrome.(7)
3. CO3
(i) Convert the following CFG to PDA and analyze the answer (a+b)
and a++. (8)
Ia|b|Ia|Ib|I0|I1 A
EI|E+E|E*E|(E)
(ii) Convert the following CFG to PDA by empty stack.(7)
S0S1/A;
A1A0/S/ ε Infer whether 0101 belongs to N(M).
4. (i)If L is a CFL then prove that there exists PDA M, such that L=N(M) C CO3
, language accepted by empty stack .(7) (ii)Construct a PDA empty
store , L= {am bn|n<m}.(8)

UNIT – IV NORMAL FORMS AND TURING MACHINES

Q. No. Questions BT CO

PART A

1 What are the three ways to simplify a context free grammar? R CO4

2 What are the closure properties of CFG? R CO4

3 State the pumping lemma for CFL. U CO4

4 Give the steps to eliminate useless symbols. R CO4

5 Show that CFLs are closed under substitutions R CO4

6 Show that L={a^p / P is prime } is not context free AN CO4

7 List the closure properties of CFL. U CO4

8 Define Turing Machine R CO4
What are the required fields of an instantaneous description or
9 AN CO4
configuration of a TM?
10 What is multiple tracks Turing machine? AN CO4

11 What is multidimensional Turing machine? A CO4

12 When is a function f said to be Turing computable? C CO4

13 What is off line Turing machine? A CO4

14 List out the different techniques for TM construction. A CO4

15 What is Universal Turing machine? C CO4

16 Define multitape TM. U CO4

17 List the primary objectives of TM. E CO4

What are the differences between a Finite automata and a Turing
18 E CO4
machine?
19 What is halting problem. R CO4

20 Write short note on chomskian hierarchy of languages E CO4

21 Give the configuration of Turing Machine A CO4

22 Differentiate multihead and multi tape Turing machine. U CO4

PART B
1. Express the following grammar G into Greibach Normal CO4
Form(GNF) (13)
SXA|BB R
Bb|SBXb Aa
2. Use the CFL pumping lemma to show how each of these languages U CO4
not to be context-free{aibjck| i<j<k} (13)
3. (i) Discussa TM to accept the language LE={1n 2n 3n|n >= 1}(6) CO4
Construct a turing machine that estimate unarymultiplication (Say U
111 X 11 = 11111) (7)
4. (i) Illustrate the Turing machine for computing f(m, n)=m-n( CO4
proper subtraction). (7)
A
Demonstrate a Turing Machine to compute f(m+n)=m+n, m,n>=0
and simulate their action on the input 0100. (6)
5. (i) Examinethe role of checking off symbols in a Turing CO4
Machine.(6) R
Describe a Turing Machine M to implement the function
“multiplication” using the subroutine copy(7)
6. (i) Demonstrate the implications of halting problem.(7) A CO4
Show that if a language is accepted by a multitapeturing machine ,it is
accepted by a single-tape TM .(6)
7. (i) Summarize in detail about multihead and multitape TMwith CO4
an example.(7) E
Construct a Turing Machine to accept palindromes in analphabet
set ∑={a,b}.Trace the strings “abab” and “baab”.(6)
8. (i) Explain the TM as computer of integer function with an A CO4
example.(7)
Design a TM to implement the function f(x)= x+1. (6)
9. (i) Design a TM to accept the set of all strings {0,1} with 010as C CO4
substring.(7)
Write shot notes on Two –way infinite tape TM.(6)
10. (i)Describe computing a partial function with a TM.(6) (ii)Design a R CO4
TM to accept the language LE={anbncn |n >1}.(7)
11. (i) Define Turing machine for computing f(m, n)=m*n,n€N. (7) R CO4
Write notes on Partial solvability.(6)
12. (i) Construct a TM to reverse the given string {abb}. (6) CO4
Explain Multi tape and Multi head Turing machine withsuitable U
example.(7)
13. (i) Analyze and Construct a TM to compute a function f(w) CO4
=WR where W€{a,b}.(7) A
Construct Turing machine (TM) that replace all occurence of 111 by
101 from sequence of 0’s and 1’s.(6)
14. (i) Infer the Chomsky grammar classification with necessary CO4
example. (6) A
Explain a TM with no more than three states that accepts the
language. a(a+b) *.Assume €={a,b}. (7)
PART C CO4

1. (i) Compose the limitation of automata for Type 3, Type 2, type 0 CO4
languages.(7)
Consider two-tape Turing Machine (TM) and determine whether the C
TM always writes a nonblank symbol on its secondtape during the
computation on any input string ‘w’. Formulatethis problem as a
language and show it is undecidable.(8)
2. i) Define pumping lemma for CFL. Show that L={aibjck, i<j<k} is CO4
not context free and Judge your answer.(6)
ii) Construct a TM to move an input string over the alphabet A= E
{a} to the right one cell. Consider that the tape head starts
somewhere on a blank cell to the left of the input string to theright one
cell , leaving all the remaining cell blank.(9)
3. (i) Design and explain a TM to compute f(m,n) = m*n , for allm,n€ A CO4
N.(6)
Explain how a multi track in a TM can be used for testinggiven
positive integer is a prime or not(9).
4. (i) Prepare a subroutine to move a TM head from its current CO4
position to the right, skipping over all 0’s until reaching a 1 or a
blank. If the current position does not hold 0, then the TM should
halt. You may assume that there are no tape symbol otherthan 0,1 and C
B(blank). Then , use this subroutine to design to TM that accepts all
strings of 0’s and 1’s that do not have two 1’s in a row.(8)
Write short notes on checking off symbols(7)
 UNIT-V- UNDECIDABILITY
Q. No. Questions BT CO
PART A
1 When a language is said to be recursively enumerable? R CO5
2 Define Non Recursive language. R CO5
3 When a language is said to be recursive? U CO5
4 Define decidable problems R CO5
5 Define undecidable problems. R CO5
6 Define universal language. AN CO5
7 Define problem solvable in polynomial time. C CO5
8 Define the class P and NP. R CO5
9 Define NP – Complete Problem AN CO5
10 Write the Significance of NP-Complete Problem. AN CO5

11 What are tractable problems? A CO5

What are the properties of recursively enumerable sets which are
12 U CO5
undecidable?
What are the properties of recursive and recursively enumerable
13 A CO5
language?
14 Mention the difference between decidable and undecidable problems A CO5

15 Show that any PSPACE-hard language is also NP-hard. R CO5

16 Mention the difference between P and NP problems. U CO5
When we say a problem is decidable? Give example of undecidable
17 E CO5
problem.

18 Give examples for NP – Complete Problem E CO5

19 Differentiate Recursive and Non-recursive language. C CO5

CO5
20 When is a Recursively Enumerable language said to be Recursive? A

Identify whether 'Tower of Hanoi' problem is tractable or intractable. CO5

21 A
Justify your answer.
22 What is primitive recursive function? U CO5

PART B
1. (i)Describe about the tractable and intractable problems.(7) R CO5
(ii)Identify that “MPCP reduce to PCP”.(6)
2. (i) Describe about Recursive and Recursive Enumerable languages R CO5
with example.(7)
State and describe RICE theorem.(6)
3. (i) Summarize diagonalization language.(6) CO5
Discuss the significance of universal turing machine and also U
construct a turing machine to add two numbers and encode it .(7)
4. Discuss post correspondence problem .Let ∑={0,1}.Let A andB be U CO5
the lists of three strings each ,defined as
(i) Does the PCP have a solution?(7)
i. Prove that the universal language is
recursivelyenumerable.(6)
5. (i)Explain computable functions with suitable example.(6) A CO5
(ii)Explain in detail notes on Unsolvable Problems.(7)
6. (i) Describe in detail notes on universal Turing machines with CO5
example.(7) R
Collectand write the short notes on NP-complete
problems.(6)
7. (i) Show that the diagonalization language (Ld) is not a A CO5
recursively enumerable.(7)
Illustrate about unsolvability.(6)
8. (i)Compare the difference between recursive and recursively E CO5
enumerable languages.(7) (ii)Explain about PCP.(6)
9. (i) Explain about Universal Turing machine and show that the C CO5
universal language (Lu) is recursively enumerable but not
recursive. Generalize your answer(8)
Design and explain how to measure and classifycomplexity.(5)
10. (i) Explain about the recursively Enumerable Language with CO5
example.(6) A
Point out that the following problem is undecidable. Given two CFGs
G1 and G2 is L(G1) L(G2) =∅.(7)
11. (i) Show that the characteristic function of the set of all even CO5
number is recursive .(7) A
Illustrate in detail notes on primitive recursive functionswith
examples.(6)
12. (i)Point out the Measuring and Classifying Complexity.(7) A CO5
(ii)Does PCP with two lists x=(b,b ab3,ba) and y=(b3,ba,a)
have a solution. Analyze your answer.(6)
13. (i) Discuss in detail about Time and Space Computing of a CO5
Turing Machine(6)
U
Express two languages which are not recursivelyenumerable.(7)
14. (i) Describe in detail Polynomial Time reduction and NP- CO5
completeness.(7) R
List out the short notes on NP-Hard Problems.(6)
PART C CO5
1. Consider and find the languages obtained from the following CO5
operations:
(i) Union of two recursive languages.(5) E
(ii) Union of two recursively enumerable languages.(5)
L if L and complement of L are recursively enumerable.(5)
2. Prove that the universal language is recursively enumerable but C CO5
not recursive. Generalize your answer.(15)
3. (i) Plan and explain on decidable and un-decidable problems CO5
with an example(7) C
Design and prove that for two recursive languages L1 andL2
their union and intersection is recursive.(8)

COURSE IN-CHARGE HOD PRINCIPAL