Register
Filter

Questions by Chetnawadhwa

2 votes
3 answers
1
Theory-of-computation
S-> S+S | S*S | a | € Which is false? a) G is ambiguous b) L is ambiguous c) both a and b d) none
S- S+S | S*S | a | €Which is false? a) G is ambiguous b) L is ambiguous c) both a and bd) none
0 votes
0 answers
2
Theory-of-computation
I read the foll statement somewhere.. Is it true? In nfa if there is a dead configuration then its equivalent dfa may or may not have trap state. Acc to me it will always have a trap state for that particular nfa. ??
I read the foll statement somewhere..Is it true?In nfa if there is a dead configuration then its equivalent dfa may or may not have trap state.Acc to me it will always h...
0 votes
0 answers
5
Computer networks
In congestion avoidance of tcp.. Cwnd=Cwnd + 1/Cwnd Where Cwnd is congestion window size? Why is it so.. Bcz in congestion avoidance size of cwnd increases linearly..how is it true?
In congestion avoidance of tcp.. Cwnd=Cwnd + 1/CwndWhere Cwnd is congestion window size? Why is it so.. Bcz in congestion avoidance size of cwnd increases linearly..how i...
0 votes
1 answer
6
Computer networks
https://gateoverflow.in/?qa=blob&qa_blobid=18431429327103384271 What will be value of y? I m getting y=26 and x=12 I guess m getting wrong..
https://gateoverflow.in/?qa=blob&qa_blobid=18431429327103384271What will be value of y? I m getting y=26 and x=12I guess m getting wrong..
4 votes
1 answer
7
Computer networks
Selective repeat protocol requires more sequence numbers than Go-back-N protocol. True or false?
Selective repeat protocol requires more sequence numbers than Go-back-N protocol.True or false?
1 votes
0 answers
10
Toc ommon data question
Pl solve and answer ques 9 and 10,,
Pl solve and answer ques 9 and 10,,
1 votes
1 answer
11
Parse trees
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse trees concluding it as ambiguous.. Only with reference to the string 'b' otherwise i know its ambiguous...
How will we treat the given two parse trees..? Are they same i.e one is has been derived using lmd n other using rmd or they both will be treated as two diffent parse tr...
2 votes
1 answer
12
NPDA
How much memory does npda takes or has? As when we are taking npda for let's say ww^r.. Then we will be considering two pda at the same time.. Is it practical or theoretical.. Whts the case?
How much memory does npda takes or has? As when we are taking npda for let's say ww^r.. Then we will be considering two pda at the same time.. Is it practical or theoret...
2 votes
1 answer
13
Regular language
Is the following language a regular language.: L={ (a^p)*|p is a prime no} ....? If so, then how many min no of states in NFA that accepts a lang L?
Is the following language a regular language.:L={ (a^p)*|p is a prime no} ....?If so, then how many min no of states in NFA that accepts a lang L?
6 votes
1 answer
14
Homomorphism
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?