Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
itsmejatin.s
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by itsmejatin.s
14
answers
1
GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
28.6k
views
commented
Apr 8, 2022
Algorithms
gatecse-2012
algorithms
sorting
normal
+
–
3
answers
2
GATE CSE 2009 | Question: 32
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider the following statements: If a process makes a transition $D$, it would result in another process making ... -preemptive scheduling. Which of the above statements are TRUE? I and II I and III II and III II and IV
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state:Now consider the following sta...
18.6k
views
commented
Jan 18, 2021
Operating System
gatecse-2009
operating-system
process-scheduling
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register