当前位置：首页
> Luz 第2548页
Luz 管理员
暂无介绍
89860 篇文章 33 次评论判断题：$$\sqrt{n}$$ is $$O(\log n / \sqrt{n})$$.
$$\sqrt{n}$$ is $$O(\log n / \sqrt{n})$$.答案：FALSE…
判断题：$$(\log n)^2$$ is $$O(\sqrt{n})$$.
$$(\log n)^2$$ is $$O(\sqrt{n})$$.答案：TRUE…
判断题：The time complexity of a backtracking algorithm is $$\Omega (S)$
The time complexity of a backtracking algorithm is $$\Omega (S)$$ where $$S$$ is the total size of the solution space.答案…
判断题：Precision is more important than recall when evaluating the chea
Precision is more important than recall when evaluating the cheating detection in Online Monitor System. 答案：FALSE…
判断题：Recall is more important than precision when evaluating the chea
Recall is more important than precision when evaluating the cheating detection in Online Monitor System. 答案：TRUE…
判断题：In the worst case the DELETE operation in a RED-BLACK tree of $$
In the worst case the DELETE operation in a RED-BLACK tree of $$n$$ nodes requires $$\Omega (\log n)$$ rotations.答案：FALS…
判断题：When $$n$$ elements are pushed into a stack, they may be popped
When $$n$$ elements are pushed into a stack, they may be popped in a different order. But if they are inserted into a q…
判断题：Depth-first search on a graph is a generalization of preorder tr
Depth-first search on a graph is a generalization of preorder traversal on a tree. The difference is that when dealing…