A: Round Robin algorithm
B: Maximum C/I algorithm
C: Proportional Fair algorithm
D: Minimum C/I algorithm
举一反三
- Which of the following statement is true regarding TRANSPOSE and FAST_TRANSPOSE algorithms.( ) A: None of the above B: Time complexities of TRANSPOSE and FAST_TRANSPOSE are same C: The TRANSPOSE algorithm is faster than FAST_TRANSPOSE D: The TRANSPOSE algorithm is slower than FAST_TRANSPOSE
- The purpose of the sentences in the genetic algorithm experiment: “TempE (Size,:) = Best S” is to maintain the coding stability with the maximum fitness, so as to avoid value oscillation.
- The length of the LCS between "program" and "algorithm" isprogram 和 algorithm的LCS长度为: A: 1 B: 2 C: 3 D: 4
- A step-by-step solution to a problem is called( ). A: hardware B: an operating system C: a computer language D: an algorithm
- The algorithm of producing MAC and HASH algorithm all don’t need to use a key when producing its output.
内容
- 0
LCS(x,y) is defined to be the length of the LCS between strings x and y. LCS("program", "algorithm") = LCS(x,y)表示字符串x,y最长公共子序列长度，则LCS（“program”, “algorithm”）= A: LCS（“progra”, “algorith”） + 1 B: LCS（“progra”, “algorithm”） C: LCS（“program”, “algorith”） D: max{ LCS（“progra”, “algorithm”）, LCS（“program”, “algorith”）}
- 1
LCS(x,y)表示字符串x,y最长公共子序列长度，则LCS（“program”, “algorithm”）= A: LCS（“progra”, “algorith”） + 1 B: LCS（“progra”, “algorithm”） C: LCS（“program”, “algorith”） D: max{ LCS（“progra”, “algorithm”）, LCS（“program”, “algorith”）}
- 2
The algorithm must be implemented by computer program finally
- 3
12 In the following sort algorithms, the sorting algorithm that is suitable for a large number of records keywords, but with a small number of keywords to be sorted is（ ）. A: cardinality sort B: quick Sort C: merge sort D: heap sort
- 4
Which of the following should not be listed on a certificate issued by A: Private key B: . User name C: Period of validity D: Algorithm name E: None of the above