1
GATE CSE 1998
+1
-0.3
How many substrings of different lengths (non-zero) can be formed from a character string of length $$n$$ ?
A
$$n$$
B
$${n^2}$$
C
$${2^n}$$
D
$$n\left( {n + 1} \right)/2$$
2
GATE CSE 1997
+1
-0.3
$$\sum { = \left\{ {a,b} \right\},\,\,}$$ which one of the following sets is not countable.
A
Set of all strings over $$\sum {}$$
B
Set of all languages over $$\sum {}$$
C
Set of all regular languages over $$\sum {}$$
D
Set of all languages over $$\sum {}$$ accepted by Turing Machines.
3
GATE CSE 1996
+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)
4
GATE CSE 1996
+1
-0.3
Let $$L \subseteq \sum {^{^ * }\,}$$ where $$\,\sum { = \,\,\left\{ {a,b} \right\}\,\,}$$ which of the following is true?
A
$$L = \,\,\,\left\{ {\left. x \right|\,\,\,x} \right.$$ has an equal number of $$a's$$ and $$\,\left. {b's} \right\}$$ is regular
B
$$L = \left\{ {{a^n}{b^n}\left| {n \ge 1} \right.} \right\}$$ is regular
C
$$L = \,\,\,\left\{ {\left. x \right|\,\,\,x} \right.\,$$ has more $$a's$$ than $$\left. {b's} \right\}$$ is regular
D
$$L = \left\{ {{a^m}{b^n}\left| {m \ge 1,\,n \ge 1} \right.} \right\}$$ is regular
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination