Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
abuhujair
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by abuhujair
0
votes
0
answers
1
Made Easy Test Series
“Consider the following proposed solution to dining philosophers problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct?” In the above question, is the given solution deadlock free? Will removing (iii) and (iv) can make the solution deadlock free?
“Consider the following proposed solution to dining philosophers problem to avoid deadlock.Consider the binary semaphore lock is initialized to 1.Which of the following...
322
views
asked
Jan 22, 2022
Operating System
made-easy-test-series
operating-system
+
–
1
votes
1
answer
2
Made Easy Test Series
Consider L = {w011w | w ∈ (o+1)*}. Find minimum number of states that are required in DFA (L). Found this question in Made Easy Test Series and I think the question is incorrect, as the language is not regular. The solution of this question given by Made Easy ... the given solution to be true L should be, L = {w011x | w,x ∈ (o+1)*}. Request you all to provide your comments.
“Consider L = {w011w | w ∈ (o+1)*}.Find minimum number of states that are required in DFA (L).”Found this question in Made Easy Test Series and I think the question...
400
views
asked
Jan 20, 2022
Theory of Computation
made-easy-test-series
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register