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
Answers by sudsho
1
votes
121
#compiler design
Can ambiguous grammars have precedence and associativity??
Can ambiguous grammars have precedence and associativity??
296
views
answered
Oct 11, 2016
Compiler Design
grammar
+
–
1
votes
122
page replacement
Which page will LRU replace?
Which page will LRU replace?
653
views
answered
Oct 10, 2016
Operating System
operating-system
page-replacement
+
–
1
votes
123
CN
when asked abt optimal window size, shud i calculate 1+2a or just 2a? optimal window size occurs when efficiency is 100% so n/(1+2a) = 1 so n= 1+2a i have seen its given 2a at many places. which is correct and also please tell the reason behind it
when asked abt optimal window size, shud i calculate 1+2a or just 2a?optimal window size occurs when efficiency is 100%so n/(1+2a) = 1so n= 1+2ai have seen its given 2a a...
805
views
answered
Oct 9, 2016
3
votes
124
..
Consider the expression [(A + B) * C – D] + [(E / F) / (G + H)] Convert the above infix expression to postfix For the given infix expression, how many number of activation records used in the stack?
Consider the expression [(A + B) * C – D] + [(E / F) / (G + H)] Convert the above infix expression to postfixFor the given infix expression, how many number of activati...
351
views
answered
Oct 9, 2016
1
votes
125
Asymptotic Worst Case Time
For f(n)= 2n2+3n , O(n3) and o(n3) both are correct then what do both mean in this. As Big oh is used to reprsent the tighest upper upper bound but it is not representing here so what do we mean by O(n3) and o(n3).
For f(n)= 2n2+3n , O(n3) and o(n3) both are correct then what do both mean in this. As Big oh is used to reprsent the tighest upper upper bound but it is not representing...
325
views
answered
Oct 9, 2016
Algorithms
algorithms
asymptotic-notation
+
–
3
votes
126
vgate
why is B wrong?
why is B wrong?
238
views
answered
Oct 8, 2016
3
votes
127
CLR VS LALR Parsing
confuse among clr and lalr?? what is necessary and sufficient condition for clr?? what is necessary and sufficient condition for lalr??? when it's clr & when not?? when it's lalr & when not??
confuse among clr and lalr??what is necessary and sufficient condition for clr??what is necessary and sufficient condition for lalr???when it's clr & when not??when it's ...
7.8k
views
answered
Oct 8, 2016
Compiler Design
compiler-design
parsing
+
–
2
votes
128
MADE EASY TEST SERIES
Consider the following grammar: $S \rightarrow aPbSQ|a$ $Q \rightarrow t|\epsilon$ $P \rightarrow r$ The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar ________. [Made easy answer is 5 but my answer is 6. I will paste Made Easy's solution in the comment section.]
Consider the following grammar:$S \rightarrow aPbSQ|a$$Q \rightarrow t|\epsilon$$P \rightarrow r$The number of states will reduce when a LALR(1) parse is computed out o...
922
views
answered
Oct 8, 2016
Compiler Design
compiler-design
made-easy-test-series
parsing
numerical-answers
+
–
1
votes
129
Recursive Function
What is the value returned by p(q(3))?
What is the value returned by p(q(3))?
453
views
answered
Oct 7, 2016
2
votes
130
process sychronization
What is spinlock? What are the advantages of having spinlock?
What is spinlock?What are the advantages of having spinlock?
588
views
answered
Oct 7, 2016
Operating System
operating-system
process-synchronization
+
–
1
votes
131
made easy test series
209
views
answered
Oct 6, 2016
1
votes
132
MADE EASY TEST SERIES
Consider the following grammar: S --> aPbSQ/a Q --> tS/ ε P --> r Is the above grammar SLR(1) ?
Consider the following grammar:S aPbSQ/aQ tS/ εP r Is the above grammar SLR(1) ?
481
views
answered
Oct 6, 2016
Compiler Design
compiler-design
parsing
lr-parser
made-easy-test-series
+
–
2
votes
133
MADE EASY TEST SERIES
Assume , -, + and / are operators. Precedences and associativity given for those operators as following: 1. has highest precedence among all operators and it is left associative 2. -, + and / are having equal precedence and they are right associative. Using as ... / is Division. The output of the following expression : 10 10 - 5 + 15 - 5 10 / 5 is ________.
Assume ×, –, + and / are operators. Precedences and associativity given for those operators as following:1. × has highest precedence among all operators and it is lef...
1.2k
views
answered
Oct 6, 2016
Compiler Design
compiler-design
expression-evaluation
operator-precedence
numerical-answersm
made-easy-test-series
+
–
1
votes
134
MADE EASY TEST SERIES
Consider the following CFG: E --> E*T/T+E/T T --> (T*F)/F F --> id Which of the following strings are not generated by above CFG? A> id+id+id B> id∗id∗id C> (id∗id∗id) D> None of these
Consider the following CFG:E E*T/T+E/TT (T*F)/FF idWhich of the following strings are not generated by above CFG?A id+id+idB id∗id∗idC (id∗id∗id)D None of t...
699
views
answered
Oct 6, 2016
Compiler Design
compiler-design
context-free-grammar
parsing
made-easy-test-series
+
–
2
votes
135
process scheduling
1.3k
views
answered
Oct 6, 2016
Operating System
process-scheduling
operating-system
+
–
1
votes
136
critical section
1.1k
views
answered
Oct 6, 2016
Operating System
operating-system
process-synchronization
+
–
2
votes
137
ace/practice
451
views
answered
Oct 5, 2016
Databases
er-diagram
+
–
1
votes
138
self _doubt
420
views
answered
Oct 5, 2016
5
votes
139
Cardinality of a table
4.2k
views
answered
Oct 5, 2016
Unknown Category
sql
databases
+
–
1
votes
140
self doubt
what is nullable symbol in CFG???
what is nullable symbol in CFG???
331
views
answered
Oct 5, 2016
Page:
« prev
1
2
3
4
5
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register