• 软件测试作业——三


    作业见《软件测试基础》中文版49页第7题。英文版63页

    a)

                   

    b) 令MAXPRIMES = 4,t1不能检查出错误,t2发生数组越界,使得t2比t1更容易发现。

    c)t3=(n=1)

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

      边覆盖:TR={(1,2),(2,3),(2,12),(3,4),(4,5),(5,6),(6,8),(8,5),(6,7),(7,9),

                (5,9),(9,10),(10,11),(9,11),(12,13),(13,14),(14,15),(15,13),(13,16)}

      主路径:TR={(1,2,3,4,5,6,8),(1,2,3,4,5,6,7,9,11),(1,2,3,4,5,6,7,9,10,11)

                             (1,2,12,13,14,15),(1,2,12,13,16),(1,2,3,4,5,9,10,11),(1,2,3,4,5,9,11),

                            (2,3,4,5,6,7,9,11,2),(2,3,4,5,6,7,9,10,11,2),(2,3,4,5,9,10,11,2),(2,3,4,5,9,11,2)

                            (3,4,5,6,7,9,11,2,3),(3,4,5,6,7,9,10,11,2,3),(3,4,5,9,10,11,2,3),(3,4,5,9,11,2,3)

            (4,5,6,7,9,11,2,3,4),(4,5,6,7,9,10,11,2,3,4),(4,5,9,10,11,2,3,4),(4,5,9,11,2,3,4)

                             (5,6,8,5),(5,6,7,9,10,11,2,3,4,5),(5,6,7,9,11,2,3,4,5),(5,9,10,11,2,3,4,5)

             (5,9,11,2,3,4,5),(6,8,5,6),(6,7,9,10,11,2,3,4,5,6),(6,7,9,11,2,3,4,5,6)

              (7,9,10,11,2,3,4,5,6,7),(7,9,11,2,3,4,5,6,7),(8,5,6,8)(9,10,11,2,3,4,5,6,7,9)

              (9,10,11,2,3,4,5,9),(9,11,2,3,4,5,6,7,9)(9,11,2,3,4,5,9),(10,11,2,3,4,5,6,7,9,10)

              (10,11,2,3,4,5,9,10)(11,2,3,4,5,6,7,9,11)(11,2,3,4,5,6,7,9,10,11)(11,2,3,4,5,9,10,11)

              (13,14,15,13),(14,15,13,14),(15,13,14,15)}

  • 相关阅读:
    UIFont的使用和字体类型总结
    LOJ-10100(割点个数)
    LOJ-10099(点双联通)
    poj-3177(并查集+双联通分量+Tarjan算法)
    图论:割点和桥
    牛客训练五:炫酷数学(思维)
    牛客训练五:炫酷路途(c++与dp)
    并查集的两种实现(按秩合并+路径压缩)
    牛客训练六:海啸(二维树状数组+vector函数的使用)
    牛客训练六:美食(贪心)
  • 原文地址:https://www.cnblogs.com/dpcn/p/5339182.html
Copyright © 2020-2023  润新知