1
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The correct matching for the following pairs is

List - I
(A) Activation record
(B) Location counter
(C) Reference counts
(D) Address relocation

List - II
(1) Linking loader
(2) Garbage collection
(3) Subroutine call
(4) Assembler

A
A – 3 B – 4 C – 1 D - 2
B
A – 4 B – 3 C – 1 D - 2
C
A – 4 B – 3 C – 2 D - 1
D
A – 3 B – 4 C – 2 D - 1
2
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
If $${L_1}$$ and $${L_2}$$ are context free languages and $$R$$ a regular set, one of the languages below is not necessarily a context free language. Which one?
A
$${L_1}$$$${L_2}$$
B
$${L_1}\, \cap \,{L_2}$$
C
$${L_1}\, \cap \,R$$
D
$${L_1}\, \cup \,{L_2}$$
3
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
A
The halting problem for Turing machine is un-decidable
B
Determining whether ambiguity a context free grammar is un-decidable
C
Given two arbitrary context free grammars $${G_1}$$ and $${G_2}$$ whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$
D
Given two regular grammars $${{G_1}}$$ and $${{G_2}},$$ it is un-decidable whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$
4
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which two of the following four regular expressions are equivalent?
(i) $${\left( {00} \right)^ * }\left( {\varepsilon + 0} \right)$$
(ii) $${\left( {00} \right)^ * }$$
(iii) $${0^ * }$$
(iv) $$0\,\,{\left( {00} \right)^ * }$$
A
(i) and (ii)
B
(ii) and (iii)
C
(i) and (iii)
D
(iii) and (vi)