Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
aambazinga
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by aambazinga
0
votes
1
answer
21
recursively enumerable languages
if L1,L2,.... are any recursively enumerable subsets of Σ*, then the union of Li's is Recursive enumerable. whether the above statement is true or false?
if L1,L2,.... are any recursively enumerable subsets of Σ*, then the union of Li's is Recursive enumerable.whether the above statement is true or false?
568
views
asked
Sep 20, 2018
0
votes
0
answers
22
l-value and r-value
does the expression &A has l-value or not? iknow it will have r-value. but i think it will have l-value too. as in the scanf("%d",&A); isn't &A acting like l-value?? please clarify.
does the expression &A has l-value or not?iknow it will have r-value. but i think it will have l-value too. as in the scanf("%d",&A); isn't &A acting like l-value??pleas...
798
views
asked
Sep 19, 2018
Compiler Design
compiler-design
programming-in-c
+
–
0
votes
0
answers
23
Context free languages
X belongs to {a,b}* such that n(a)<n(b)<2n(a) is a CFL. Please somebody explain the push and pop sequences of the alphabets on the stack. I'm not being able to visualise, how it is CFL?
X belongs to {a,b}* such that n(a)<n(b)<2n(a) is a CFL. Please somebody explain the push and pop sequences of the alphabets on the stack. I'm not being able to visualise,...
276
views
asked
Sep 18, 2018
Theory of Computation
context-free-language
theory-of-computation
+
–
0
votes
0
answers
24
Pumping lemma
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular language in pumping lemma?
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular langu...
407
views
asked
Sep 9, 2018
Theory of Computation
theory-of-computation
pumping-lemma
regular-language
+
–
0
votes
0
answers
25
TOC Decidability
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?
422
views
asked
Sep 8, 2018
Theory of Computation
theory-of-computation
decidability
co-turing-recognizable
+
–
1
votes
1
answer
26
TOC DECIDABILITY
Let E={<M>| M is a DFA that accepts some strings with more 1's than 0's} Show that E is decidable. How can E be decidable. How can a DFA compare between number of 1's and 0's. From the question I know that it's not talking about all, but some. The things is even some should not be decidable. isn't it?
Let E={<M>| M is a DFA that accepts some strings with more 1's than 0's}Show that E is decidable.How can E be decidable. How can a DFA compare between number of 1's and 0...
366
views
asked
Sep 8, 2018
Theory of Computation
theory-of-computation
decidability
finite-automata
+
–
1
votes
0
answers
27
CLRS INTRODUCTION TO ALGORITHMS 3rd Edition, CHAPTER 23 QUESTION 23.2.7
suppose that a graph G has MST already computed. How quickly can we update the MST if we add a new vertex and incident edges to it. I know for the best case scenario when a single edge is incident from the ... up being linear time since we can reuse part of the DFS that we had already computed before detecting each cycle.
suppose that a graph G has MST already computed. How quickly can we update the MST if we add a new vertex and incident edges to it.I know for the best case scenario when ...
1.3k
views
asked
Aug 19, 2018
Algorithms
algorithms
graph-algorithm
prims-algorithm
+
–
0
votes
0
answers
28
OPERATING SYSTEM GALVIN DEADLOCK
In the deadlock chapter, in resource allocation graph algorithm, it is given that detecting a cycle takes O(n^2) operations... But we can find cycle in O(n+m) operations, using DFS. Why they have not considered this.. or if they have considered, what am I missing. Or is it that they have given worst case time assuming #edges(i.e; m)=n(n-1)/2 which would give O(n^2)?
In the deadlock chapter, in resource allocation graph algorithm, it is given that detecting a cycle takes O(n^2) operations... But we can find cycle in O(n+m) operations,...
244
views
asked
Aug 2, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
resource-allocation-graph-algorithm
cycle-detection
+
–
0
votes
1
answer
29
C PROGRAMMING Doubt in the outputs.
#include <stdio.h> int main () { int c; while ((c = getchar ()) != EOF) { putchar (c); printf ("*"); } return 0; } when i run this program, the output i get is as qwerty q * w * e * r * t * y * * ... why the last * is getting printed in the next line. is it like putchar() returns and shift the printing pointer to new line? please clear my doubt..
#include <stdio.h>int main (){ int c; while ((c = getchar ()) != EOF) { putchar (c); printf ("*"); } return 0;}when i run this program, the output i ...
824
views
asked
Jul 21, 2018
Programming in C
programming-in-c
output
+
–
0
votes
0
answers
30
Countable uncountable functions
How the set of all non-decreasing functions from N to N are countable? How the set of all finite partitions of N are uncountable?
How the set of all non-decreasing functions from N to N are countable?How the set of all finite partitions of N are uncountable?
805
views
asked
Jul 15, 2018
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
0
votes
0
answers
31
ANDREW S. TANNENBUM (5th edition), TRANSPORT LAYER CHAPTER-6, PAGE NUMBER- 523
its written that The link layer checksum protected the packets only while they traveled across the link and not while they were inside the router. Thus, packets were delivered incorrectly even though they were correct ... can a data get corrupted inside a router(other than the case of crash and vulnerable attacks)?
its written that The link layer checksum protected the packets only while they traveled across the link and not while they were inside the router. Thus, packets were del...
458
views
asked
Jul 14, 2018
3
votes
1
answer
32
GALVIN(NINTH INDIAN EDITION)-CHAPTER 1(SECTION 1.5.1)
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to ... privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execu...
1.9k
views
asked
Jul 3, 2018
Operating System
operating-system
process
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register