题库 第1011页
判断题：Closest Pair
Recall that, to solve the closest pair problem, the first step of the divide-and-conquer algorithm divides the point set…
判断题：A Statement on NP-Complete Problems
A problem is NP-complete if and only if it is in $$\mathcal{NP}$$ and there is no polynomial time algorithms for it.答案：F…
判断题：Suppose that the internal memory can handle M =3 records at a ti
Suppose that the internal memory can handle $$M =3$$ records at a time. We use replacement selection algorithm to gener…
判断题：Suppose that the internal memory can handle M =3 records at a ti
Suppose that the internal memory can handle $$M =3$$ records at a time. We use replacement selection algorithm to gener…
判断题：Amortized analysis is a technique to provide an upper bound on t
Amortized analysis is a technique to provide an upper bound on the actual cost of a sequence of operations答案：TRUE…
判断题：There exists an **online algorithm** for the bin packing problem
There exists an **on-line algorithm** for the bin packing problem that uses at most 3/2 the optimal number of bins for a…
判断题：There are inputs that force any on-line bin-packing algorithm to
There are inputs that force any on-line bin-packing algorithm to use at least twice the optimal number of bins.答案：FALSE…
判断题：When we solve the summation problem via designing the paralle
When we solve the summation problem via designing the parallel algorithms, we shorten the asymptotic time complexity but…
判断题：When we solve the ranking problem via designing the parallel
When we solve the ranking problem via designing the parallel algorithms based on binary search, we shorten the worst-cas…
判断题：Turnpike reconstruction
For the Turnpike reconstruction algorithm of $N$ points, assuming that the distance set $D$ is maintained as an AVL tre…
