3 The time complexity of the algorithm depends on ( ).
A. the scale of the problem
B. initial state of data to be processed
C. the scale of the problem and the initial state of the data to be processed
D. No correct answer
查看答案
4 The time complexity of an algorithm is O (n ^ 2), indicating that the algorithm's ( ).
A. execution time is proportional to n^2
B. scale of the problem is n^2
C. execution time is equal to n^2
D. scale of the problem is proportional to n^2
5 In the following program segment, the frequency of the assignment statement for x is ( ). FOR i:=1 TO n DO FOR j:=1 TO n DO x:=x+1;
A. O(2n)
B. O(n)
C. O(n^2)
D. O(log2n)
1. Which of the following is the advantage of sequential storage structure ().
A. high storage density
B. easy to insert
C. easy to delete
D. It can be easily used for storage representation of various logical structures
2. The error in the following description of the linear table is ().
A. The linear table uses sequential storage ,which is easy to insertion and deletion.
B. The linear table uses sequential storage, and must occupy a continuous storage unit.
C. The linear table uses linked storage, which does not need to occupy a continuous storage unit.
D. The linear table uses linked storage, which is easy to insert and delete.
微信支付 
支付宝支付