0 votes
1 answer
61
0 votes
0 answers
62
0 votes
0 answers
63
1 votes
1 answer
64
0 votes
0 answers
65
which mem organization is used??
0 votes
1 answer
66
0 votes
3 answers
67
Variable length partition schema suffers from internal fragmentation????
0 votes
1 answer
68
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be decidable???can i say L1 and L2 is re and re is closed under union operation so it is decidable??
0 votes
2 answers
69
L1= RE U NOT RE.$L2=RE\cap NOT RE$. WHERE RE IS recursively enumerable.then L1 and L2 are ???
0 votes
0 answers
70
can some one give an example a language is recursive but not CSL??
0 votes
1 answer
71
what is cut property of minimum spanning tree .?? can somone give an example.
0 votes
1 answer
72
L1= M#X/ M halts on X. L2= M#X / M does not halts on X. a) L1 is recursive. And L2 is recursive ennumrable. b) both are recursive ennumrable. C) L1 is recursive ennumrab...