No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
Student
- PC Specs
- p00r man's MONSTER PC:- AMD Athlon64 3000+ Winchestor [O.C. 2060Mhz > 3200+) MSI Xpress 200(RS480)…
|
The problem of scheduling unit-time tasks with deadlines and penalities for a single processor has following inputs S={a1,a2,...,an} of n unit-time task. A unit-time task requires exactly 1 unit of time to complete deadlines d1,d2,...,dn, 1<=di<=n penalities w1,w2,...,wn. A penality wi is incurred if task ai is not finished by …
|
|
|
Re:
Red black trees
I know that red black tree is a special case of binary-search tree. But what is the advantage of red black trees over BSTs. Is there any advantage regarding complexity. Does coloring the node cause any difference regarding the complexity? please anyone give me an answer.. Thanks in advance 
|