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

题库 第6549页

  • 最新
  • 浏览
  • 评论

The decision problem HALTING returns TRUE, if, for a given input

Luz5年前 (2021-05-10)1417
The decision problem HALTING returns TRUE, if, for a given input $$I$$ and a given (deterministic) algorithm $$A$$, $$A$…

To solve the Maximum Finding problem with parallel Random Sampli

Luz5年前 (2021-05-10)1997
To solve the Maximum Finding problem with parallel Random Sampling method, $$T(n) = O(1)$$ and $$W(n) = O(n)$$ can be ac…

If $$\Phi$$ is a potential function associated with a data struc

Luz5年前 (2021-05-10)850
If $$\Phi$$ is a potential function associated with a data structure $$S$$, then $$3 \Phi$$ is also a potential function…

Consider a Knapsack problem with $$n$$ items. If no items have a

Luz5年前 (2021-05-10)918
Consider a Knapsack problem with $$n$$ items. If no items have a size larger than $$n^3$$, then it is no longer NP-hard.…

信息传达者的“透明度错觉”是造成误解的主要因素之一。

Luz5年前 (2021-05-10)976
信息传达者的“透明度错觉”是造成误解的主要因素之一。~@[](1)答案:TRUE…

当背景光线强(如教室、大会议室)时,深色背景是安全的选择。

Luz5年前 (2021-05-10)949
当背景光线强(如教室、大会议室)时,深色背景是安全的选择。~@[](1) 答案:FALSE…

在技术文档中,只有一个自然段的内容不能成为一节。

Luz5年前 (2021-05-10)921
在技术文档中,只有一个自然段的内容不能成为一节。~@[](1) 答案:TRUE…

For one operation, if its worst-case time bound is $$\Theta (log

Luz5年前 (2021-05-10)890
For one operation, if its worst-case time bound is $$\Theta (log N)$$, then its amortized time bound must be $$O(log N)$…

Recall the amortized analysis for Splay Tree and Leftist Heap, f

Luz5年前 (2021-05-10)1107
Recall the amortized analysis for Splay Tree and Leftist Heap, from which we can conclude that the amortized cost (time)…

All the languages can be decided by a non-deterministic machine.

Luz5年前 (2021-05-10)2122
All the languages can be decided by a non-deterministic machine. ~@[](1)答案:FALSE…