题库 第598页
判断题：An algorithm must terminate after finite number of steps.
An algorithm must terminate after finite number of steps.答案：TRUE…
判断题：Recursive programs are in general simple and easy to understand
Recursive programs are in general simple and easy to understand. On the other hand, recursions usually require more spa…
判断题：Time complexity is machine or compiler-dependent.
Time complexity is machine or compiler-dependent.答案：FALSE…
判断题：Linear list is a data structure that represents 1-to-1 relations
Linear list is a data structure that represents 1-to-1 relations.答案：TRUE…
判断题：Linear list is a data structure that represents 1-to-many relati
Linear list is a data structure that represents 1-to-many relations.答案：FALSE…
判断题：Linear list is a data structure that represents many-to-1 relati
Linear list is a data structure that represents many-to-1 relations.答案：FALSE…
判断题：The worst cast time complexity of Binary Search is always ...
The worst cast time complexity of Binary Search is always $$O(\log n)$$ where $$n$$ is the number of sorted integers.答案：…
判断题：Given two algorithms A1 and A2, with time complexities being
Given two algorithms $$A_1$$ and $$A_2$$, with time complexities being $$T_1 = O(n^2)$$ and $$T_2 = O(n\log n)$$, respec…
判断题：In a tree of degree d>2, if n1 = 1, then ...
In a tree of degree $$d>2$$, if $$n_1 = 1$$, then we must have $$\sum_{i=1}^{d}n_i > n_0$$, where $$n_i$$ is the…
判断题：For a binary search tree, if its pre-order travel sequence is {
For a binary search tree, if its pre-order travel sequence is { 56, 28, 12, 35, 77, 64, 68, 72 }, then 68 is the parent…
