• homework3


    (a)

    (b)素数列表是,将MAXPRIMES设为4

    (c)令n=1

    (d)节点覆盖:

      TR={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}

      TEST PATH = [1,2,3,4,5,6,7,5,6,8,9,10,2,11,12,13,14,12,15]  

          边覆盖 : TR = {(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,5),(5,9),(6,8),(8,9),(9,2),(9,10),(10,2),(2,11),(11,12),(12,13),(13,14),(14,12),(12,15)}

          Test Paths = [1,2,3,4,5,6,7,5,6,8,9,2,11,12,13,14,12,15]  [1,2,3,4,5,9,10,2,11,12,13,14,12,15]

      主路径覆盖:

        [1,2,3,4,5,6,7]

        [1,2,3,4,5,9]

        [1,2,3,4,5,6,8,9,10]

        [1,2,3,4,5,6,8,9]

        [1,2,3,4,5,9,10]

        [1,2,11,12,13,14]

        [1,2,11,15]

        [3,4,5,6,8,9,2,11,12,13,14]

        [3,4,5,6,8,9,10,2,11,12,13,14]

        [3,4,5,6,8,9,2,11,12,15]

        [3,4,5,6,8,9,10,2,11,12,15]

        [3,4,5,9,10,2,11,12,13,14]

        [3,4,5,9,2,11,12,13,14]

        [3,4,5,9,10,2,11,12,15]

        [3,4,5,9,2,11,12,15]

        [6,7,5,9,10,2,11,12,13,14]

        [6,7,5,9,2,11,12,13,14]

        [6,7,5,9,10,2,11,12,15]

        [6,7,5,9,2,11,12,15]

        [13,14,12,15]

        [12,13,14,12]

        [5,6,7,5]

        [2,3,4,5,6,8,9,10,2]

        [2,3,4,5,9,2]

        [2,3,4,5,9,10,2]

        [2,3,4,5,6,8,9,2]

  • 相关阅读:
    Leetcode 238. Product of Array Except Self
    Leetcode 103. Binary Tree Zigzag Level Order Traversal
    Leetcode 290. Word Pattern
    Leetcode 205. Isomorphic Strings
    Leetcode 107. Binary Tree Level Order Traversal II
    Leetcode 102. Binary Tree Level Order Traversal
    三目运算符
    简单判断案例— 分支结构的应用
    用switch判断月份的练习
    java基本打印练习《我行我素购物系统》
  • 原文地址:https://www.cnblogs.com/ningge/p/5342347.html
Copyright © 2020-2023  润新知