Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
rahuljai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by rahuljai
1
votes
1
answer
1
Number of subnets can be formed by using the subnet mask 255.255.248.0 in a class B network _________
What’s the right answer ?, please have a look at Q.5(here) they are appending network bits but this question doesn't.
1.2k
views
asked
Dec 15, 2018
Computer Networks
subnetting
+
–
1
votes
1
answer
2
compiler design. Why SLR(1) even if follow are different?
Consider the following grammar S --> Ka|bKc|dc|bda K ---> d The grammar is not LALR(1) SLR(1) LR(1) none of the above
Consider the following grammarS Ka|bKc|dc|bdaK - dThe grammar is notLALR(1)SLR(1)LR(1)none of the above
957
views
asked
Dec 13, 2018
Compiler Design
compiler-design
first-and-follow
+
–
2
votes
1
answer
3
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n> 0 } L = {a^nb^n | n < 1000 } L = {a^nb^k | n is odd or k is even } L = {wxw^R | w,x ∈(0+1)* } 1, 3 and 4 2, 3, 4 2, 3 1, 2, 3, 4
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 a...
1.0k
views
asked
Dec 13, 2018
Theory of Computation
context-sensitive
regular-language
context-free-language
theory-of-computation
regular-expression
+
–
0
votes
1
answer
4
TLB OS
Why the formula used here is not P(10) + (1-P)(50) = 20 ?; A computer keeps its page tables in memory. The time required to read a word from the page table is 50ns. To reduce this overhead, the computer has a TLB, which holds 32 (virtual page, physical page frame) pairs and can ... : 10ns + (1 - p) 50ns = 20ns p =4/5 = .80 The TLB hit rate has to be 80% for a mean access time of 20ns.
Why the formula used here is not P(10) + (1-P)(50) = 20 ?;A computer keeps its page tables in memory. The time required to read a word from the pagetable is 50ns. To redu...
1.3k
views
asked
Dec 3, 2018
Operating System
translation-lookaside-buffer
operating-system
hit-ratio
paging
virtual-memory
+
–
0
votes
1
answer
5
TOC - PDA
Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set of states of PDA is {q0,q1} where q0 is the start state and rules of the PDA are, (The languare accepted by the grammar is)
Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set o...
578
views
asked
Nov 30, 2018
Theory of Computation
pushdown-automata
theory-of-computation
context-free-language
grammar
context-free-grammar
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register