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
Questions by dragonball
0
votes
0
answers
21
Closure properties
Subset of Regular Language is REL or not ? PLz Explain with an Example.
Subset of Regular Language is REL or not ?PLz Explain with an Example.
521
views
asked
Dec 20, 2017
Theory of Computation
theory-of-computation
closure-property
+
–
2
votes
2
answers
22
Decidability
Equality of two DPDA is decidable or undecidable ?
Equality of two DPDA is decidable or undecidable ?
1.7k
views
asked
Dec 20, 2017
Theory of Computation
theory-of-computation
decidability
+
–
1
votes
1
answer
23
Master Theorem
T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2)
T(n) = 2T(n/2) + nlogna. O(nlogn)b.n(log^2n)c.O(n^2)
572
views
asked
Dec 19, 2017
Algorithms
algorithms
master-theorem
time-complexity
+
–
1
votes
2
answers
24
Pointers
Plz Explain with a diagram .
Plz Explain with a diagram .
711
views
asked
Dec 18, 2017
Programming in C
programming-in-c
pointers
+
–
1
votes
1
answer
25
Pipeline
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.
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...
2.3k
views
asked
Dec 17, 2017
CO and Architecture
co-and-architecture
pipelining
+
–
6
votes
1
answer
26
Relative Addressing Mode
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. A+B+2 B.A+B+1 C.B+1 D.A+B Explain with diagram.
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. ...
3.8k
views
asked
Dec 17, 2017
CO and Architecture
co-and-architecture
addressing-modes
+
–
4
votes
3
answers
27
RAM Chip
A RAM chip has 7 address line , 8 data lines and 2 chips select lines. Then the number of memory locations is ... a. 2^12 b.2^10 c.2^19 d.2^13 Plz describe with a proper diagram and significance of each lines.
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...
5.9k
views
asked
Dec 17, 2017
CO and Architecture
co-and-architecture
+
–
0
votes
1
answer
28
ROM Implementation
Could anyone explain the solution with a proper diagram?
Could anyone explain the solution with a proper diagram?
881
views
asked
Dec 15, 2017
Digital Logic
digital-logic
+
–
0
votes
1
answer
29
AckerMann Function
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
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
835
views
asked
Dec 14, 2017
Programming in C
data-structures
+
–
0
votes
1
answer
30
DFA construction
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
4.8k
views
asked
Nov 29, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
2
answers
31
Regular Expression
Let L1= 10* and L2=101* Find L1 Union L2 , L1 intersection L2 , L1 - L2 in the form of regular expressions.
Let L1= 10* and L2=101* Find L1 Union L2 , L1 intersection L2 , L1 - L2 in the form of regular expressions.
1.9k
views
asked
Nov 28, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
0
answers
32
Can epsilon be used as a tape alphabet in case of Turing Machine?
1.2k
views
asked
Nov 23, 2017
Theory of Computation
turing-machine
+
–
0
votes
0
answers
33
Turing Machine
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 correct or not ?If not plz provide a alternative solution.
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...
4.5k
views
asked
Nov 23, 2017
Theory of Computation
turing-machine
+
–
2
votes
0
answers
34
HEAP and its properties
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
Show that there are at most (n/2^h+1) nodes of height h in any n-element heap.
276
views
asked
Nov 10, 2017
Algorithms
algorithms
binary-heap
+
–
2
votes
0
answers
35
Worst case running time of MAX_HEAPIFY
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) .
207
views
asked
Nov 10, 2017
Algorithms
algorithms
binary-heap
+
–
1
votes
0
answers
36
Time Complexity of Max_heapify(A,i) (CLR 3rd edition Page no. 155)
The running time of MAX_HEAPIFY on a subtree of size n rooted at a given node i is the Thete(1) time to fix up the relationships among the element A[i] , A[LEFT(i)] and A[RIGHT(i)] , plus the time to run the ... MAX_HEAPIFY by the recurrence - T(n) <= T(2n/3) + theta(1) Could anyone explain the bold lines in detail ?
The running time of MAX_HEAPIFY on a subtree of size n rooted at a given node i is the Thete(1) time to fix up the relationships among the element A[i] , A[LEFT(i)] and A...
309
views
asked
Nov 10, 2017
Algorithms
algorithms
binary-heap
+
–
0
votes
0
answers
37
Turing Machine for concatenation of strings w1 and w2 where w1, w2 belongs to {a,b} using single tape
2.3k
views
asked
Oct 31, 2017
Theory of Computation
theory-of-computation
turing-machine
+
–
0
votes
1
answer
38
PDA Construction
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 cases how does the PDA changes on inclusion of 0.
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...
543
views
asked
Oct 29, 2017
Theory of Computation
pushdown-automata
+
–
1
votes
1
answer
39
PDA Doubt
In the below diagram which solution is correct and why ?
In the below diagram which solution is correct and why ?
354
views
asked
Oct 29, 2017
Theory of Computation
theory-of-computation
pushdown-automata
+
–
0
votes
0
answers
40
Problem while making a PDA
I feel it difficult to know when to change the state while making a PDA. Could anyone tell me in detailed manner when to cahnge the state . Below is the solution to a problem , could anyone tell me which one is more appropriate with justification.
I feel it difficult to know when to change the state while making a PDA.Could anyone tell me in detailed manner when to cahnge the state .Below is the solution to a probl...
240
views
asked
Oct 29, 2017
Theory of Computation
theory-of-computation
pushdown-automata
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register