Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
uzumzki
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by uzumzki
0
votes
1
Consider this grammar: S → SS | a How many derivation trees are possible for a^4 ? (a) 3 (b) 4 (c) 5 (d) 6
Consider this grammar: S → SS | a How many derivation trees are possible for a^4 ? (a) 3 (b) 4 (c) 5 (d) 6 Is there any formulae to solve this kind of problem?
4.3k
views
answered
Aug 19, 2015
Theory of Computation
theory-of-computation
+
–
0
votes
2
Digital Logic
No of switching fn for f (A, B, C, D)=BD+B'D' How to approach this question ?
No of switching fn for f (A, B, C, D)=BD+B'D'How to approach this question ?
1.7k
views
answered
Aug 9, 2015
Digital Logic
digital-logic
+
–
1
votes
3
Average memory acces time
392
views
answered
Aug 9, 2015
Operating System
page-fault
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register