题目内容

10. The following incorrect statement is ().

A. If any key activity is completed ahead of time, the whole project will be completed ahead of time
B. Key activities not completed on time will affect the completion time of the whole project
C. All key activities are completed in advance, then the entire project is completed in advance
D. Early completion of certain key activities will lead to early completion of the entire project

查看答案

搜索结果不匹配？点我反馈

更多问题

17. The connected component is the maximal connected subgraph of ().

A. Undirected graph
B. Tree
C. Graph
Directed graph

18. The minimal spanning tree can be constructed using the () algorithm.

A. Prim algorithm
B. Kruskal algorithm
C. Huffman algorithm
Dijitstra algorithm

19. In a graph with n vertex e-edges, the sum of degrees of all vertices is equal to ().

A. 2n
B. n
C. e
D. 2e

Sort the sequence {15, 9, 7, 8, 20, -1, 4}, and after one pass, the data arrangement becomes {9, 15, 7, 8, 20, -1, 4}, then The sorting method used is _____.

A. selection sort
B. Direct insertion sort
C. heap sort
D. hill sort