Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Rhythm
11
answers
1
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
33.2k
views
comment edited
Jun 8, 2020
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
10
answers
2
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...
37.1k
views
commented
Jul 8, 2019
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
4
answers
3
GATE CSE 2014 Set 3 | Question: 17
One of the purposes of using intermediate code in compilers is to make parsing and semantic analysis simpler. improve error recovery and error reporting. increase the chances of reusing the machine-independent code optimizer in other compilers. improve the register allocation.
One of the purposes of using intermediate code in compilers is tomake parsing and semantic analysis simpler.improve error recovery and error reporting.increase the chance...
9.4k
views
commented
Jul 8, 2019
Compiler Design
gatecse-2014-set3
compiler-design
intermediate-code
easy
+
–
3
answers
4
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
18.3k
views
commented
Jul 5, 2019
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
2
answers
5
token generation doubt
which one of the following string can definitely said to be a token without looking at the next input: +(++,+=) return(return a) *(*=) =(==) ++ , ( ) ‘ ; option e is: plusplus, comma, bracket open, bracket close, single quote ;
which one of the following string can definitely said to be a token without looking at the next input:+(++,+=)return(return a)*(*=)=(==)++ , ( ) ‘ ; option e is: plu...
4.1k
views
commented
Jun 7, 2019
Compiler Design
lexical-analysis
compiler-tokenization
+
–
7
answers
6
Type of error
Find the type of error produced by the following C code. main() { in/*comment t x; floa/*comment*/t gate; } Lexical error syntax error both a) and b) None of these
Find the type of error produced by the following C code.main() { in/*comment t x; floa/*comment*/t gate; }Lexical errorsyntax errorboth a) and b) None of these
5.4k
views
commented
Jun 5, 2019
Compiler Design
lexical-analysis
syntax-analysis
compiler-tokenization
+
–
1
answer
7
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then...
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then the complement of any language in $\rm NP$ is in $\rm NP$ $\rm P$ Both (a) and (b) None of these
If there is an $\rm NP$-complete language $L$ whose complement is in $\rm NP$, then the complement of any language in $\rm NP$ is in$\rm NP$$\rm P$Both (a) and (b)None of...
1.5k
views
commented
Apr 21, 2019
Theory of Computation
theory-of-computation
time-complexity
p-np-npc-nph
+
–
2
answers
8
P and np doubt
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(either ntm or dtm). So np and p both should be recursive. Am i right here? Please answer
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(eit...
1.2k
views
commented
Apr 21, 2019
1
answer
9
P and NP Question doubt
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply that L’ belongs to NP L’ belongs to P both a and b
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply thatL’ belongs to NPL’ belongs to P both a and b
1.2k
views
commented
Apr 20, 2019
Theory of Computation
p-np-npc-nph
+
–
1
answer
10
Toc p and np
Are p and np problems both closed under union intersection and concatenation and kleene closure? If yes then how?
Are p and np problems both closed under union intersection and concatenation and kleene closure? If yes then how?
1.9k
views
commented
Apr 19, 2019
0
answers
11
Handwritten notes
a^m b^n where m+n=p how is this a cfl? Please explain. How will the stack be managed in this kind of language? also why can't cfl perform multiplication and subtraction? And why can't non linear languages like a^p, where p is a prime number, be accepted by pda.
a^m b^n where m+n=p how is this a cfl? Please explain. How will the stack be managed in this kind of language? also why can't cfl perform multiplication and subtraction? ...
444
views
commented
Mar 6, 2019
1
answer
12
General doubt
I haven't done ardens theorem and my hill nerode theorem. However i have done questions based on them. Should i do these theorems if i am able to solve questions based on them using direct approaches shown in popular videos and all?
I haven't done ardens theorem and my hill nerode theorem. However i have done questions based on them. Should i do these theorems if i am able to solve questions based on...
324
views
asked
Mar 3, 2019
0
answers
13
Fa to re
I found out its regular expression to be 00(0+11*0+11*10)*11* is this regular expression correct for the finite automata given above?
I found out its regular expression to be00(0+11*0+11*10)*11*is this regular expression correct for the finite automata given above?
394
views
asked
Feb 22, 2019
Theory of Computation
theory-of-computation
+
–
0
answers
14
FA to Regular expressions Concept
For this given 3 state machine, what will be the regular expressions for the following cases: When A is the final state. When B is the final state When C is the final state
For this given 3 state machine, what will be the regular expressions for the following cases:When A is the final state. When B is the final stateWhen C is the final state...
338
views
commented
Feb 20, 2019
1
answer
15
Dfa doubt
What is the number of states in the minimal dfa representing the language a*b* ?
What is the number of states in the minimal dfa representing the language a*b* ?
373
views
asked
Feb 16, 2019
1
answer
16
Grammar doubt
L is regular <=> there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
L is regular <= there exists a linear grammar for L. Which way is it true and which way is it false? Please explain in detail
417
views
asked
Feb 10, 2019
1
answer
17
Cfg doubt
S→ aSb/epsilon is this linear grammar? I know it's a cfg but is it linear as well?
S→ aSb/epsilonis this linear grammar? I know it's a cfg but is it linear as well?
262
views
asked
Feb 10, 2019
1
answer
18
cfg doubt
Is context free grammar linear grammar?
Is context free grammar linear grammar?
288
views
asked
Feb 10, 2019
0
answers
19
Made e**y notes
701
views
commented
Feb 8, 2019
1
answer
20
General doubt
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve questions without an answer key with your college faculty's help? Or should i purchase a fresh postal material?
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve que...
343
views
asked
Jan 28, 2019
1
answer
21
Cfg to and from pda
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
922
views
asked
Jan 21, 2019
Theory of Computation
context-free-language
pushdown-automata
+
–
0
answers
22
pushdown automata
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
819
views
asked
Jan 3, 2019
1
answer
23
Nfa and dfa states doubt
Can i dfa has lesser states than an nfa?
Can i dfa has lesser states than an nfa?
202
views
asked
Dec 20, 2018
0
answers
24
Workbook
273
views
commented
Dec 19, 2018
1
answer
25
pumping lemma
to check if a given language is regular or not, for this i have seen many solutions on the net and lectures but everyone has used a direct approach to determine that but in the standard textbooks the method for doing this is given as pumping lemma which i ... new question and i don't know the concept to solve it. which one should i do, pumping lemma or the direct approach one?
to check if a given language is regular or not, for this i have seen many solutions on the net and lectures but everyone has used a direct approach to determine that but ...
503
views
answer selected
Nov 12, 2018
1
answer
26
regular expressions
are these equal? R1=(bc*a)*bc*d R2=b(c+ab)*d are r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're equal or not?
are these equal?R1=(bc*a)*bc*dR2=b(c+ab)*dare r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're...
450
views
comment reshown
Nov 6, 2018
0
answers
27
ullman chapter regular expressions and languages exercise 3.1
Not able to construct the regular expressions for the statements
Not able to construct the regular expressions for the statements
243
views
asked
Oct 7, 2018
Theory of Computation
regular-expression
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register