1
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.
A
1 and 2 only
B
2 and 3 only
C
3 and 4 only
D
1 and 3 only
2
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
In the context of modular software design, which one of the following combinations is desirable?
A
High cohesion and high coupling
B
High cohesion and low coupling
C
Low cohesion and high coupling
D
Low cohesion and low coupling
3
GATE CSE 2014 Set 3
Numerical
+1
-0
The length of the shortest string NOT in the language (over $$\sum { = \left\{ {a,\,\,b} \right\}}$$) of the following regular expression is ____________. $$a{}^ * b{}^ * \left( {ba} \right){}^ * a{}^ *$$\$
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the following languages over the alphabet $$\sum { = \left\{ {0,\,1,\,c} \right\}:}$$
\eqalign{ & {L_1} = \left\{ {{0^n}\,{1^n}\,\left| {n \ge } \right.0} \right\} \cr & {L_2} = \left\{ {wc{w^r}\,\left| {w \in \left\{ {0,\,1} \right\}{}^ * } \right.} \right\} \cr & {L_3} = \left\{ {w{w^r}\,\left| {w \in \left\{ {0,\,1} \right\}{}^ * } \right.} \right\} \cr}

Here, $${w^r}$$ is the reverse of the string $$w.$$ Which of these languages are deterministic Context- free languages?

A
None of the languages
B
$$(B)$$ Only $${L_1}$$
C
Only $${L_1}$$ and $${L_2}$$
D
All the three languages.
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12