Which of the following resource scheduling algorithms can achieve maximum system capacity? A: Round Robin algorithm B: Maximum C/I algorithm C: Proportional Fair algorithm D: Minimum C/I algorithm

The algorithm of producing MAC and HASH algorithm all don’t need to use a key when producing its output.

The length of the LCS between "program" and "algorithm" isprogram 和 algorithm的LCS长度为: A: 1 B: 2 C: 3 D: 4

The algorithm must be implemented by computer program finally

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”）}

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”）}

关于算法（Algorithm），下列叙述正确的是（ ）

LS uses Dijkstra’s algorithm to compute the shortest paths.

Dijkstra algorithm compute shortest path using weight on each communication-line.

下列哪一项属于特征学习算法（representation learning algorithm）？( )