0 votes
0 answers
21
Subset of Regular Language is REL or not ?PLz Explain with an Example.
2 votes
2 answers
22
Equality of two DPDA is decidable or undecidable ?
1 votes
1 answer
23
T(n) = 2T(n/2) + nlogna. O(nlogn)b.n(log^2n)c.O(n^2)
1 votes
2 answers
24
Plz Explain with a diagram .
1 votes
1 answer
25
We have 10 stage pipeline , where the branch target conditions are resolved at stage 5 . How many stalls are there for an incorrectly predicted branch ?Plz draw a diagram...
6 votes
1 answer
26
A two- word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative , the operand is available in location :A. ...
4 votes
3 answers
27
A RAM chip has 7 address line , 8 data lines and 2 chips select lines. Then the number of memory locations is ...a. 2^12b.2^10c.2^19d.2^13Plz describe with a proper diagr...
0 votes
1 answer
28
Could anyone explain the solution with a proper diagram?
0 votes
1 answer
29
Is there any shortcut to solve the AckerMann function ?e.g. I want to find the value of A(3,1).https://en.wikipedia.org/wiki/Ackermann_function
0 votes
1 answer
30
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
0 votes
2 answers
31
Let L1= 10* and L2=101* Find L1 Union L2 , L1 intersection L2 , L1 - L2 in the form of regular expressions.
0 votes
0 answers
33
Draw a Turing machine for the following." Concatenate two strings w1 and w2 , where each string is generated over {a,b}"Can anyone tell me whether this solution is corre...
2 votes
0 answers
34
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
2 votes
0 answers
35
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
0 votes
1 answer
38
1)What is the main difference while drawing the PDA of {an bn | n>=0 } and {an bn | n>=1} ?2)How does PDA changes when we have 0 in it as a constraint .3)For all other c...
1 votes
1 answer
39
In the below diagram which solution is correct and why ?
0 votes
0 answers
40