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
Answers by Aalok8523
0
votes
1
GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____
The maximum number of edges in a bipartite graph on $12$ vertices is____
27.2k
views
answered
May 28, 2020
Graph Theory
gatecse-2014-set2
graph-theory
graph-connectivity
numerical-answers
normal
+
–
1
votes
2
GATE CSE 2013 | Question: 10
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates th...
28.8k
views
answered
May 27, 2020
Operating System
gatecse-2013
operating-system
process-scheduling
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register