Register
Filter

Answers by shivangi5

8 votes
1
Relations
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmetric _______.
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmet...
1 votes
2
Which expression is right with respect to carry look header?
(i) Ci +1= Gi+ PiCi (ii) Ci +1= G(i+1) + P(i+1)Ci https://www.youtube.com/watch?v=9lyqSVKbyz8&index=116&list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOm i or ii ?
(i) Ci +1= Gi+ PiCi(ii) Ci +1= G(i+1) + P(i+1)Cihttps://www.youtube.com/watch?v=9lyqSVKbyz8&index=116&list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOmi or ii ?
1 votes
4
Ullman 4.3
Is this grammar ambiguous? S-->SxA|A A-->AyB|B B-->zB|(S)|m|n I cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
Is this grammar ambiguous?S >SxA|AA >AyB|BB >zB|(S)|m|nI cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
0 votes
5
symbol table
which DS takes less time to create Symbol table??? a) Hash Table B) Linked List is there is any other method to create Symbol table?? what are the various option available to create symbol table? among which takes less time???
which DS takes less time to create Symbol table???a) Hash TableB) Linked Listis there is any other method to create Symbol table??what are the various option available t...