1
GATE CSE 2014 Set 3
+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
2
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{}^ *$$\$
3
GATE CSE 2014 Set 3
+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.
4
GATE CSE 2014 Set 3
+1
-0.3
Let $$\sum \,$$ be a finite non - empty alphabet and let $${2^{\sum {{}^ * } }}$$ be the power set of $$\sum {{}^ * .\,}$$ Which one of the following is TRUE?
A
Both $${2^{\sum {{}^ * } }}$$ and $$\sum {^ * }$$ are countable
B
$${2^{\sum {{}^ * } }}$$ is countable and $$\sum {^ * }$$ is uncountable
C
$${2^{\sum {{}^ * } }}$$ is uncountable and $$\sum {^ * }$$ is countable
D
Both $${2^{\sum {{}^ * } }}$$ and $$\sum {^ * }$$ are uncountable
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