Other / Removed from syllabus

List I                          List II
(i)   Context free languages    (a) Closed under union
(ii)  Recursive languages       (b) Not closed under complementation
(iii) Regular languages         (c) Closed under intersection

One or more correct

• A(i) – (a), (ii) – (b), and (iii) – (c)
• B(i) – (b), (ii) – (a), and (iii) – (c)
• C(i) – (b), (ii) – (c), and (iii) – (a)
• D(i) – (a), (ii) – (c), and (iii) – (b)

Single correct

• AI only
• BI and III only
• CI and IV only
• DI, II and III only

Answer key coming soon

Single correct

• ADeterministic finite automata (DFA) and Non-deterministic finite automata (NFA)
• BDeterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)
• CDeterministic single-tape Turing machine and Non-deterministic single-tape Turing machine
• DSingle-tape Turing machine and multi-tape Turing machine

Answer key coming soon