Register
Filter

Recent activity by Wanted

3 answers
4
GATE IT 2005 | Question: 29
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control
Count to infinity is a problem associated with:link state routing protocol.distance vector routing protocolDNS while resolving host nameTCP for congestion control
6 answers
6
GATE CSE 2014 Set 1 | Question: GA-5
The roots of $ax^{2}+bx+c = 0$ are real and positive. $a, b$ and $c$ are real. Then $ax^{2}+b\mid x \mid + c =0$ has no roots $2$ real roots $3$ real roots $4$ real roots
The roots of $ax^{2}+bx+c = 0$ are real and positive. $a, b$ and $c$ are real. Then $ax^{2}+b\mid x \mid + c =0$ has no roots$2$ real roots$3$ real roots$4$ real roots
1 answer
9
Graph Theory Problem-Test Series
A Connected Graph has Cut edge, Then Graph has Cut vertex also. 1. True 2. False Choose Correct One.
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
0 answers
10
rice theorem problem
L(M) has at most 10 strings We can have Tyes for ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem : It should not b Tyes Σ∗ and Tno for ϕ
L(M)has at most 10 stringsWe can have Tyesfor ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem :It should...
1 answer
11
ace toc 1
8 answers
12
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
1 answer
13
CONTEXT FREE LANGUAGE
2 answers
14
DFA-MINIMIZATION
1 answer
15
ace : minimum mfa
i think answer b 3..and they give 2?
i think answer b 3..and they give 2?
1 answer
17
is every recusrive is csl ?
i know every csl is recursive while viceversa is true?
i know every csl is recursive while viceversa is true?
1 answer
18
ACE TOC Grand Test-1
0 answers
19
intersection between decidable and undecidabe b?
1 answer
21
can complment of csl is cfl ?
1 answer
22
is this transition are right?
1 answer
23
Test by Bikram | Theory of Computation | Test 1 | Question: 19
Consider the following CFG : $S \rightarrow AB$ $A \rightarrow BC \mid a$ $B \rightarrow CC \mid b$ $C \rightarrow a \mid AB$ The Rank of Variable $A$ is: $2$ $3$ $4$ not possible to define
Consider the following CFG :$S \rightarrow AB$$A \rightarrow BC \mid a$$B \rightarrow CC \mid b$$C \rightarrow a \mid AB$The Rank of Variable $A$ is:$2$$3$$4$not possible...
3 answers
24
Test by Bikram | Theory of Computation | Test 1 | Question: 15
Which one is a correct statement in terms of accepting powers of DPDA and NPDA? DPDA and NPDA are equal DPDA and NPDA are not comparable DPDA < NPDA DPDA > NPDA
Which one is a correct statement in terms of accepting powers of DPDA and NPDA?DPDA and NPDA are equalDPDA and NPDA are not comparableDPDA < NPDADPDA NPDA
1 answer
25
Test by Bikram | Theory of Computation | Test 1 | Question: 6
If L is any regular language accepted by Minimal Finite Automaton with $n$ states, then the number of states in Minimal Finite Automaton to accept Prefix(L) is: $n$ $n+1$ $n+2$ $2n$
If L is any regular language accepted by Minimal Finite Automaton with $n$ states, then the number of states in Minimal Finite Automaton to accept Prefix(L) is:$n$$n+1$$n...