题库 第6392页
If we find someday that a known NP-complete problem is polynomia
If we find someday that a known NP-complete problem is polynomial-time solvable, then $$P = NP$$. ~@[](1)答案：TRUE…
判断两个浮点数是否相同的运算虽然符合C语言规则，但是应该尽量避免。
判断两个浮点数是否相同的运算虽然符合C语言规则，但是应该尽量避免。 ~@[](1)答案：TRUE…
simpleGUI是一种简单的即时模式GUI，如果有多个textbox控件，运行时用户可以用Tab和Shift+Tab在它们之间
simpleGUI是一种简单的即时模式GUI，如果有多个textbox控件，运行时用户可以用Tab和Shift+Tab在它们之间轮转。 ~@[](1)答案：TRUE…
LibGraphics 是一个第三方图形库，函数 InitConsole 用于初始化图形界面。
LibGraphics 是一个第三方图形库，函数 InitConsole 用于初始化图形界面。 ~@[](1)答案：FALSE…
A language L ⊆ {0, 1}$$^{\ast}$$ is NP-complete if there exist
A language L ⊆ {0, 1}$$^{\ast}$$ is NP-complete if there exists a language L'⊆ {0, 1}$$^{\ast}$$ that L' $$\le _{p}$$…
Let S be the set of activities in Activity Selection Problem. Th
Let S be the set of activities in Activity Selection Problem. Then the latest start activity $$ai$$ must be included in…
In the bin packing problem, we are asked to pack a list of items
In the bin packing problem, we are asked to pack a list of items L to the minimum number of bins of capacity 1. Let M be…
Because we never know when the input might end, we don't know if
Because we never know when the input might end, we don't know if there is an on-line algorithm that can always give an o…
An approximation scheme that runs in O(n$$^{3}$$*n$$^{1/\epsilo
An approximation scheme that runs in O(n$$^{3}$$*n$$^{1/\epsilon}$$) for any fixed ϵ˃0 is a polynomial-time approximat…
In the bin packing problem, the Next Fit, First Fit and Best Fit
In the bin packing problem, the Next Fit, First Fit and Best Fit algorithms can all be implemented in O( N log N ). ~@[…
