What is the complexity of a algorithm of finding the Cyclic Directed Graph?

charlypa

 Profile Answers by charlypa Questions by charlypa

• Jun 19th, 2009

Use BFS or DFS time complexity is O(V+E)

Answer Question  Select Best Answer

What is Starvation? How starvation is avoided in UNIX and WINDOWS Operating System?

raj_smart

 Profile Answers by raj_smart Questions by raj_smart

• Jul 2nd, 2009

The solution to starvation is to include the process of "Aging". The idea is to change the priority of a process as a time goes by. This can be done by reducing the priority of higher priority processes or by raising the priority of starved processes.

karan_gtnit

 Profile Answers by karan_gtnit Questions by karan_gtnit

• Feb 22nd, 2009

Starvation takes place when a low-priority process does not get CPU time bcoz of higher priority  processes keep coming.this can be removed by "AGING"In this A Process waiting for a particular time i...

Answer Question  Select Best Answer