-->
当前位置:首页 > 题库

题库 第6555页

  • 最新
  • 浏览
  • 评论

Consider the online hiring problem, in which we have total $$m$$

Luz5年前 (2021-05-10)972
Consider the online hiring problem, in which we have total $$m$$ candidates. First of all, we interview $$n$$ candidates…

Let S be the set of activities in Activity Selection Problem. T

Luz5年前 (2021-05-10)1604
Let S be the set of activities in Activity Selection Problem. Then there must be some maximum-size subset of mutually c…

Reviewing the randomized QuickSort in our course, we always sele

Luz5年前 (2021-05-10)1903
Reviewing the randomized QuickSort in our course, we always select a central splitter as a pivot before recursions, make…

As we know there is a 2-approximation algorithm for the Vertex C

Luz5年前 (2021-05-10)1693
As we know there is a 2-approximation algorithm for the Vertex Cover problem. Then we must be able to obtain a 2-approx…

In the Activity Selection problem, consider any non-empty set of

Luz5年前 (2021-05-10)903
In the Activity Selection problem, consider any non-empty set of activities $$S$$, and let $$a_m$$ be an activity in $$S…

Local search algorithm can be used to solve lots of classic prob

Luz5年前 (2021-05-10)2177
Local search algorithm can be used to solve lots of classic problems, such as SAT and $$N$$-Queen problems. Define the…

Is it true that in the worst case the DELETE operation in a RED-

Luz5年前 (2021-05-10)884
Is it true that in the worst case the DELETE operation in a RED-BLACK tree of $$n$$ nodes requires $$\Omega(\log n)$$ ro…

While comparing a serial algorithm with its parallel counterpart

Luz5年前 (2021-05-10)1982
While comparing a serial algorithm with its parallel counterpart, we just concentrate on reducing the work load. ~@[](…

Recall that the worst-case time complexities of insertions and d

Luz5年前 (2021-05-10)1388
Recall that the worst-case time complexities of insertions and deletions in a heap of size $$N$$ are both $$O(\log N)$$.…

Is it true that in the worst case a red-black tree deletion requ

Luz5年前 (2021-05-10)794
Is it true that in the worst case a red-black tree deletion requires $$O(1)$$ node recolorings? ~@[](1)答案:FALSE…