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

题库 第6504页

  • 最新
  • 浏览
  • 评论

If a binary search always divides the sequence into 1%:99% subse

Luz5年前 (2021-05-10)740
If a binary search always divides the sequence into 1%:99% subsequences, the binary search still take O(logN) time。 ~@[…

线性的数据结构可以顺序存储,也可以链接存储。非线性的数据结构只能链接存储。

Luz5年前 (2021-05-10)936
线性的数据结构可以顺序存储,也可以链接存储。非线性的数据结构只能链接存储。 ~@[](2)答案:FALSE…

The best-case time complexity to sort $$N$$ records by simple se

Luz5年前 (2021-05-10)737
The best-case time complexity to sort $$N$$ records by simple selection sort and by bubble sort are both $$O(N)$$. ~@[]…

Requiring developers to check Web configuration items in and out

Luz5年前 (2021-05-10)1240
Requiring developers to check Web configuration items in and out and sending affected stakeholders e-mail messages autom…

The function point metric is an example of metric that can be us

Luz5年前 (2021-05-10)702
The function point metric is an example of metric that can be used to assist with technical decision-making based on the…

The ability to track relationships and changes to configuration

Luz5年前 (2021-05-10)989
The ability to track relationships and changes to configuration objects is one of the most important features of the SCM…

If an undirected graph has more than one connected component, th

Luz5年前 (2021-05-10)684
If an undirected graph has more than one connected component, the graph must not be connected. ~@[](2)答案:TRUE…

If a connected graph G has no topological sorting sequence, then

Luz5年前 (2021-05-10)1023
If a connected graph G has no topological sorting sequence, then graph G must have a cycle. ~@[](2)答案:TRUE…

The non-recursive depth-first traversal algorithm of the graph i

Luz5年前 (2021-05-10)861
The non-recursive depth-first traversal algorithm of the graph is usually implemented by a queue, and the non-recursive…

To sort $$N$$ records by merge sort, the best-case time complexi

Luz5年前 (2021-05-10)948
To sort $$N$$ records by merge sort, the best-case time complexity and worst-case time complexity are both $$O(NlogN)$$.…