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
Recent activity by sarvesh12369
3
answers
1
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
1.6k
views
answered
Aug 24, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
4
answers
2
NIELIT 2016 MAR Scientist C - Section C: 7
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling
In real-time operating systems, which of the following is the most suitable scheduling scheme?round-robinfirst-come-first-servedpreemptiverandom scheduling
1.3k
views
answered
Aug 3, 2020
Operating System
nielit2016mar-scientistc
operating-system
process-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register