1
GATE CSE 1991
Subjective
+2
-0
Match the pairs in the following question by writing the corresponding letters only. GATE CSE 1991 Operating Systems - Memory Management Question 65 English
2
GATE CSE 1991
True or False
+1
-0
Indicate the following statement true or false :

A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation.
A
TRUE
B
FALSE
3
GATE CSE 1991
True or False
+1
-0
Indicate the following statement true or false:

Although C does not support call by name parameter passing, the effect can be correctly simulated in C.
A
TRUE
B
FALSE
4
GATE CSE 1991
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$
A
It could be un-decidable
B
It is Turing-machine recognizable
C
It is a regular language
D
It is a context-sensitive language
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12