GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by Praveen Saini
User Praveen Saini
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Praveen Saini
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE2014AE6
Find the odd one in the following group: $ALRVX$,$EPVZB$,$ITZDF$,$OYEIK$ A). $ALRVX$ B). $EPVZB$ C). $ITZDF$ D). $OYEIK$
answer selected
Jun 2
in
Verbal Ability

153
views
gate2014ae
oddone
verbalreasoning
verbalability
2
answers
2
ISRO20178
Which symbol denote derived attributes in ER Model? Double ellipse Dashed ellipse Squared ellipse Ellipse with attribute name underlined
answer selected
May 8
in
Databases

1.1k
views
isro2017
databases
erdiagram
4
answers
3
ISRO201775
Choose the most appropriate HTML tag in the following to create a numbered list <dl> <list> <ul> <ol>
answer selected
May 8
in
Web Technologies

776
views
isro2017
webtechnologies
html
nongate
5
answers
4
GATE20095, ISRO201757
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
answer selected
May 7
in
Digital Logic

484
views
gate2009
digitallogic
numberrepresentation
isro2017
2
answers
5
ISRO201758
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
answer selected
May 7
in
IS&Software Engineering

920
views
isro2017
is&softwareengg
nongate
4
answers
6
GATE2014319, ISRO201778
In the context of modular software design, which one of the following combinations is desirable? High cohesion and high coupling High cohesion and low coupling Low cohesion and high coupling Low cohesion and low coupling
answer selected
May 7
in
IS&Software Engineering

730
views
gate20143
is&softwareengg
easy
isro2017
1
answer
7
Regular expression describe the same set of string as Grammar
answered
May 7
in
Theory of Computation

132
views
theoryofcomputation
regularexpressions
4
answers
8
Finit Automata
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different) a) n b) n+1 c) n+2 d) n1 please explain.
commented
May 6
in
Theory of Computation

66
views
2
answers
9
GATE 2016208
Let, $x_{1} ⊕ x_{2} ⊕ x_{3} ⊕ x_{4}= 0$ where $x_{1}, x_{2}, x_{3}, x_{4}$ are Boolean variables, and $⊕$ is the XOR operator. Which one of the following must always be TRUE? $x_{1}x_{2}x_{3}x_{4} = 0$ $x_{1}x_{3} + x_ ... ;oplus; \bar{x}_{3} = \bar{x}_{2} ⊕ \bar{x}_{4}$ $x_{1} + x_{2} + x_{3} + x_{4} = 0$
commented
May 6
in
Digital Logic

1.2k
views
gate20162
digitallogic
booleanalgebra
normal
1
answer
10
Gate Practice Question
An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ?
answer selected
May 5
in
Theory of Computation

67
views
nfa
regularlanguages
dfa
1
answer
11
Cyclomayic complexity
What is the cyclomatic complexity of given code? while(i<3 AND j>9){.....} A. 1 B. 2 C. 3 D. 4
commented
May 5
in
Others

43
views
1
answer
12
Thegate book
Q. If n number of variables how many dual expression is possible?
answer selected
May 5
in
Digital Logic

54
views
digitallogic
0
answers
13
TOC TM
closed
May 4
in
Theory of Computation

36
views
theoryofcomputation
decidability
0
answers
14
toc fsm
commented
May 4
in
Theory of Computation

28
views
theoryofcomputation
dfa
2
answers
15
GATE200632, ISRO201635
Consider the following statements about the context free grammar $$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$ $G$ is ambiguous $G$ produces all strings with equal number of $a$& ... below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
commented
May 3
in
Compiler Design

3k
views
gate2006
compilerdesign
grammar
normal
isro2016
2
answers
16
Finite Automata
How to convert Regular Grammar to Deterministic Finite Automata directly?
commented
Apr 28
in
Theory of Computation

53
views
theoryofcomputation
3
answers
17
GATE201039
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
commented
Apr 27
in
Theory of Computation

1.1k
views
gate2010
theoryofcomputation
regularexpressions
normal
5
answers
18
Regular expression for given FA
commented
Apr 27
in
Theory of Computation

188
views
theoryofcomputation
regularexpressions
finiteautomata
2
answers
19
Is dead state included in Minimum DFA
commented
Apr 27
in
Theory of Computation

77
views
theoryofcomputation
6
answers
20
GATE2017225
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$  $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left  w_{1} \right  = 2, \left  w_{2} \right \geq 3$} is ______________ .
answer reshown
Feb 19
in
Theory of Computation

1.1k
views
theoryofcomputation
gate20172
dfa
numericalanswers
4
answers
21
GATE2017227
If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT? $wz+w(x+y)+x(x_y) = x+wy$ $\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + \bar{y}z$ $(w \bar{x}(y+x\bar{z}) + \bar{w} \bar{x}) y = x \bar{y}$ $(w+y)(wxy+wyz) = wxy+wyz$
answer selected
Feb 14
in
Digital Logic

1k
views
gate20172
digitallogic
booleanexpressions
normal
3
answers
22
GATE2017128
The value of $\lim_{x\rightarrow 1} \frac{x^{7}2x^{5}+1}{x^{3}3x^{2}+2}$ (A) is 0 (B) is 1 (C) is 1 (D) does not exist
answer selected
Feb 14
in
Calculus

619
views
gate20171
calculus
limits
normal
4
answers
23
GATE2017232
Consider the following expression grammar G: E > ET $\mid$ T T > T + F $\mid$ F F > (E) $\mid$ id Which of the following grammars is not left recursive, but is equivalent to G? E > ET $\mid$ T T > T +F $\mid$ F F > (E) $ ... (E) $\mid$ id E > TX X > TX $\mid$ $\epsilon$ T > +FY $\mid$ $\epsilon$ F > (E) $\mid$ id
answer selected
Feb 14
in
Compiler Design

930
views
gate20172
2
answers
24
GATE20171GA4
Find the smallest number $y$ such that $y$ x 162 is a perfect cube. (A) 24 (B) 27 (C) 32 (D) 36
answer selected
Feb 14
in
Numerical Ability

584
views
gate20171
2
answers
25
GATE2007IT46
The two grammars given below generate a language over the alphabet {x, y, z} G1 : S → x  z  x S  z S  y B B → y  z  y B  z B G2 : S → y  z  y S  z S  x B B → y  y S Which one of the following choices ... No y appears after any x G2 : Every x is followed by at least one y G1 : No y appears after any x G2 : Every y is followed by at least one x
commented
Dec 31, 2016
in
Theory of Computation

277
views
gate2007it
theoryofcomputation
normal
1
answer
26
GATE 2008 IISC Baanglr Paper
Three values of x and y are to be fitted in a stright line in the form of y=a+bx by the method of least squares Given SIGMA x =6 SIGMA y=21 SIGMA x*x = 14 SIGMA xy = 46 Find the values of a and b
commented
Dec 31, 2016
in
Probability

166
views
1
answer
27
GATE1998_4
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language: $L=\{w \in \{0, 1\}^* \mid w$ interpreted as binary number (ignoring the leading zeros) is divisible by five $\}.$
commented
Dec 24, 2016
in
Theory of Computation

491
views
gate1998
theoryofcomputation
minimalstateautomata
normal
1
answer
28
GATE200779
Consider the CFG with $\left\{S, A, B\right\}$ as the nonterminal alphabet, $\{a, b\}$ as the terminal alphabet, S as the start symbol and the following set of production rules: S $\rightarrow$aB S$\rightarrow$bA B $\rightarrow$ b ... rightarrow$ aS B $\rightarrow$ aBB S $\rightarrow$ bAA For the string $aabbab$, how many derivation trees are there? 1 2 3 4
commented
Dec 17, 2016
in
Compiler Design

258
views
gate2007
compilerdesign
grammar
normal
2
answers
29
GATE2006IT31
Which of the following languages is accepted by a nondeterministic pushdown automaton (PDA) but NOT by a deterministic PDA? $\{a^nb^nc^n \mid n ≥ 0\}$ $\{a^lb^mc^n \mid l ≠ m \text{ or } m ≠ n\}$ $\{a^nb^n \mid n ≥ 0\}$ $\{a^mb^n \mid m, n ≥ 0\}$
commented
Dec 17, 2016
in
Theory of Computation

506
views
gate2006it
theoryofcomputation
pda
normal
3
answers
30
GATE20152_35
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding nonterminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 ... strings in $X_0$? 10(0*+(10)*)1 10(0*+(10)*)*1 1(0+10)*1 10(0+10)*1 +110(0+10)*1
commented
Dec 9, 2016
in
Theory of Computation

1.3k
views
gate20152
theoryofcomputation
regularexpressions
grammar
normal
1
answer
31
The regular expression corresponding to the finite automata given below is
answered
Dec 2, 2016
in
Theory of Computation

99
views
3
answers
32
GATE2014115
Which one of the following is TRUE? The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular. The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is regular. The language $L$= $\left\{ w \mid w \text{ has } 3k+1 \ ... regular. The language $L = \left\{ww \mid w \in \Sigma^* \text{ with } \Sigma = \left\{0,1\right\}\right\}$ is regular.
commented
Nov 19, 2016
in
Theory of Computation

520
views
gate20141
theoryofcomputation
regularset
normal
4
answers
33
GATE1992_04_c
Design a 3bit counter using Dflip flops such that not more than one flipflop changes state between any two consecutive states.
commented
Nov 19, 2016
in
Digital Logic

336
views
gate1994
digitallogic
flipflop
1
answer
34
GATE201040
Consider the languages $L1=\{0^i1^j\ \mid i \neq j\}, $ $L2=\{0^i1^j\mid i=j\},$ $L3=\{0^i1^j \mid i=2j+1\},$ $L4=\{0^i1^j \mid i\neq2j\}$ Only $L2$ is context free. Only $L2$ and $L3$ are context free. Only $L1$ and $L2$ are context free. All are context free
commented
Nov 19, 2016
in
Theory of Computation

666
views
gate2010
theoryofcomputation
contextfree
identifyclasslanguage
normal
1
answer
35
GATE200221
We require a four state automaton to recognize the regular expression (a/b)*abb Give an NFA for this purpose Give a DFA for this purpose
commented
Nov 17, 2016
in
Theory of Computation

228
views
gate2002
theoryofcomputation
minimalstateautomata
normal
descriptive
2
answers
36
GATE198712a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \bar {A}\bar B$ $\bar{A}B+A\bar{B}$ $B$ $\bar{A}$
answer selected
Nov 15, 2016
in
Digital Logic

150
views
gate1987
digitallogic
booleanexpressions
1
answer
37
virtual gate 2
Let $L_1$ and $L_2$ be two arbitrary languages, choose incorrect statement(s) $\text{if}\; L_1.L_2\;\text{ is regular then }L_2.L_1\;\text{ is also regular.}$ $L_1 = L_2 \;\text{iff}\; L_1 \backslash L_2 = \phi \; \text{and}\; L_2 \backslash ... Sigma^* \backslash L \;\text{is regular}$ (\ denotes set difference) Only (i) (i) and (ii) (ii) and (iii) All
commented
Oct 27, 2016
in
Theory of Computation

237
views
virtualgate
theoryofcomputation
identifyclasslanguage
2
answers
38
GATE20007
Construct as minimal finite state machine that accepts the language, over {0,1}, of all strings that contain neither the sub string 00 nor the sub string 11. Consider the grammar S → aSAb S → ∊ A → bA A → ∊ where S, A are nonterminal symbols with ... aibj for some i, j ≥ 0, where i and j satisfy some condition. What is the condition on the values of i and j?
answer selected
Oct 26, 2016
in
Theory of Computation

299
views
gate2000
theoryofcomputation
descriptive
3
answers
39
DFA: No of states
How many states in the minimal dfa which accepts all string of language L={ w  w € (a+b)* } whose string length divide by 2 or 4 ?
answer selected
Oct 13, 2016
in
Theory of Computation

94
views
minimalstateautomata
1
answer
40
#minimizeddfa
Minimized DFA for a*b* + b*a* and a+b+ + b+a+
answer selected
Oct 13, 2016
in
Theory of Computation

96
views
regularlanguages
#dfa
23,355
questions
30,065
answers
67,365
comments
28,382
users