Data Structures and Algorithms (measured circumferential 8- review)

True or False

1. Assuming the pattern string is abababaab, the pattern matching algorithm KMP next [j] = 0 1 1 2 3 4 5 6 2.

     T      F

2. a binary tree traversal sequence after sequence and the sequence is just the same, then any node of the binary tree must have no left child.

     T      F

3. No, corresponding to its two adjacent arc-node table storage structure to an edge in FIG.

     T      F

4. In the tree with n nodes, the number of edges can only be the n-1.

     T      F

5.Prim algorithm is to maintain a forest, every step of the two trees merged into one.

     T      F

6. merge sort algorithm is stable sorting method.

     T      F

7. (neuDS) represented by an ordered sequence of tables and tables can be used single chain binary search method to increase the search speed.

     T      F

Multiple Choice

1. the N records merge sort, merge magnitude is the number of times:

     AO (logN)
     B.O(N)
     CO (NlogN)
     D.O(N ²)

2. the N merge sort records, a degree of spatial complexity:

     AO (logN)
     B.O(N)
     CO (NlogN)
     D.O(N ² )

3. given key string {4321, 56, 57, 46, 28, 7, 331, 33, 234, 63}, which are selected following the priority bit per-view (LSD) were trip chain radix sort and distribution collection of results?

     A.→331→4321→33→63→234→56→46→57→7→28
     B.→4321→331→33→63→234→56→46→57→7→28
     C.→56→28→4321→331→33→234→46→57→63→7
     D.→57→46→28→7→33→234→63→56→4321→331

4. The shortest path generation algorithm can be used ().

     A.Kruskal algorithm
     B.Dijkstra algorithm
     C.prim algorithm
     D. Huffman algorithm

5. Use Dijkstra (the Dijkstra) algorithm for finding the shortest path for each destination vertex FIG. 1 from the apex to each of the shortest path other vertices are obtained successively:

     A.6, 7, 5, 3, 2, 4
     B.6, 2, 5, 7, 3, 4
     C.2, 3, 4, 5, 6, 7
     D.2, 4, 3, 6, 5, 7

6. Given a directed graph G = (V, E), where {Vl = V, V2, V3, V4, V5, V6, V7}, E = { <V1,V2>, <V1,V3>, <V1,V4>, <V2,V5>, <V3,V5>, <V3,V6>, <V4,V6>, <V5,V7>, <V6,V7>}, the sequence topology G is ().

     A.V1, V2, V5, V3, V4, V6, V7
     B.V1, V3, V4, V6, V2, V5, V7
     C.V1, V3, V2, V6, V4, V5, V7
     D.V1, V3, V4, V5, V2, V6, V7

FIG 7 is provided with a logical structure of data B = (K, R), wherein the vertex set {K = K _{. 1} , K ₂ , ⋯, K _{. 9} }, a directed edge set R {= <K _{. 1} , K _{. 3} >, <K _{. 1} , K _{. 8} >, <K ₂ , K _{. 3} >, <K ₂ , K _{. 4} >, <K ₂ , K _{. 5} >, <K _{. 3} , K _{. 9} >, <K _{. 5} , K _{. 6} >, <K _{. 8} , K _{. 9} >, < K _{. 9} , K _{. 7} >, <K _{. 4} , K _{. 7} >, <K _{. 4} ,to ₆>}. Which of the following is not a corresponding sequence of DAG topology map?

     If ₁ , k ₂ , k ₃ , k ₄ , k ₅ , k ₆ , k ₈ to ₉ to ₇

     Bk ₂ , a ₅ , a ₁ , a ₄ , a ₆ , a ₈ , a ₃ , a ₉ to ₇

     Ck ₂ , k ₄ , k ₅ , k ₆ , k ₇ , k ₁ , k ₃ , k ₈ to ₉

     Dk ₁ to ₈ , k ₂ , k ₃ , k ₉ , k ₄ , k ₇ , k ₅ to ₆

8. AOE- network as shown , the first event occurrence time ⑤ Is

     A.21
     B.26
     C.38
     D.43

9. When KMP algorithm for pattern matching, pattern string "ababaaababaa" is the next array ____.

     A.-1，0，1，2，3，4，5，6，7，8，9，9
     B.-1，0，1，2，1，2，1，1，1，1，2，1
     C.-1，0，0，1，2，3，1，1，2，3，4，5
     D.-1，0，1，2，3，0，1，2，3，2，2，3

10.如模式串t = "abcabaa"，采用KMP算法或改进的KMP算法进行模式匹配时，next函数值和nextval函数值(下标从0开始)分别为：@@

     A.next={-1,0,0,0,1,2,1}, nextval={-1,-1,-1,-1,1,2,-1}
     B.next={-1,0,0,1,0,2,1}, nextval={-1,0,0,0,1,2,1}
     C.next={-1,0,0,0,1,2,1}, nextval={-1,0,0,-1,1,2,1}
     D.next={-1,0,0,0,1,2,1} , nextval={-1,0,0,-1,0,2,1}