Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by abhishekmehta4u
0
votes
1
answer
61
DLD # floating point
375
views
asked
Jul 20, 2018
0
votes
0
answers
62
Co# return instn
173
views
asked
Jul 19, 2018
0
votes
0
answers
63
DMA#CO
214
views
asked
Jul 19, 2018
1
votes
1
answer
64
In write through protocoal which mem organization is used??
369
views
asked
Jul 16, 2018
0
votes
0
answers
65
Madeeasy workbook
which mem organization is used??
which mem organization is used??
234
views
asked
Jul 15, 2018
0
votes
1
answer
66
Made easy text book
165
views
asked
Jul 11, 2018
0
votes
3
answers
67
Operating system
Variable length partition schema suffers from internal fragmentation????
Variable length partition schema suffers from internal fragmentation????
1.2k
views
asked
May 9, 2018
0
votes
1
answer
68
toc#decidable
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??
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??
286
views
asked
Apr 20, 2018
0
votes
2
answers
69
TOC#DECIDABLE
L1= RE U NOT RE. $L2=RE\cap NOT RE$. WHERE RE IS recursively enumerable. then L1 and L2 are ???
L1= RE U NOT RE.$L2=RE\cap NOT RE$. WHERE RE IS recursively enumerable.then L1 and L2 are ???
230
views
asked
Apr 20, 2018
0
votes
0
answers
70
toc#decidible
can some one give an example a language is recursive but not CSL??
can some one give an example a language is recursive but not CSL??
502
views
asked
Apr 20, 2018
0
votes
1
answer
71
DAA#MST
what is cut property of minimum spanning tree .?? can somone give an example.
what is cut property of minimum spanning tree .?? can somone give an example.
379
views
asked
Apr 18, 2018
Algorithms
algorithms
minimum-spanning-tree
+
–
0
votes
1
answer
72
Decidablelity
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 ennumrable and L2 is non recursive ennumrable. D) none. Can somone give an easy explanation.
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...
378
views
asked
Apr 1, 2018
Page:
« prev
1
2
3
4
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register