POTD 2: ISP coverage criteria

Section 1: Due 26-September-2026, 1pm
Section 2: Due 30-Septembe-2026, 1pm
Purpose:
Instruction:

You may make a copy of a worksheet and complete this activity, or simply type your answers in any text editor.

You may work alone or with another student in this course (max team size = 2).


Assume there are multiple IDMs (i.e., characteristics or partitions):

Blocks for characteristic A A1 A2  
Blocks for characteristic B B1 B2 B3
Blocks for characteristic C C1 C2  

Possible values for the partitions are as follow:

Values for characteristic A a b  
Values for characteristic B 1 2 3
Values for characteristic C x y  
  1. Apply All Combination Coverage (ACoC)
    • Compute the (maximum) number of tests
      sample solution
      #tests = 2 * 3 * 2 = 12
    • Derive test requirements
      sample solution
      TR = { 
      (A1,B1,C1), (A1,B1,C2), (A1,B2,C1), (A1,B2,C2), (A1,B3,C1), (A1,B3,C2)
      (A2,B1,C1), (A2,B1,C2), (A2,B2,C1), (A2,B2,C2), (A2,B3,C1), (A2,B3,C2)  }
    • Substitute test input values
      sample solution
      (a,1,x), (a,1,y), (a,2,x), (a,2,y), (a,3,x), (a,3,y)
      (b,1,x), (b,1,y), (b,2,x), (b,2,y), (b,3,x), (b,3,y) 
  2. Apply Each Choice Coverage (ECC)
    • Compute the (maximum) number of tests
      sample solution
      #tests = max_#blocks = 3
    • Derive test requirements
      sample solution
      TR = { (A1,B1,C1), (A2,B2,C2), (A2,B3,C1) }  
    • Substitute test input values
      sample solution
      (a,1,x), (b,2,y), (b,3,x)
  3. Apply Pair-Wise Coverage (PWC)
    • Compute the (maximum) number of tests
      sample solution
      #test = 1st_max_#block * 2nd_max_#block = 3 * 2 = 6
    • Derive test requirements
      sample solution
      steps to derive Pair-Wise tests
      TR = { (B1,A1,C1), (B1,A2,C2), (B2,A1,C2), (B2,A2,C1), (B3,A1,C1), (B3,A2,C2) } 
    • Substitute test input values
      sample solution
      (1,a,x), (1,b,y), (2,a,y), (2,b,x), (3,a,x), (3,b,y)
  4. Apply Base Choice Coverage (BCC)
    • Compute the (maximum) number of tests
      sample solution
      #tests = 1(for #base) + ( (2-1) + (3-1) + (2-1) ) = 5 
    • Derive test requirements
      sample solution
      First, pick a base. Suppose a base is (A2,B1,C1)
      
      Derive the remaining test requirements. 
      Hold all but one base choice constant, 
      use each non-base choice in each other characteristic.
      
      A2,B1,C2    
      A2,B2,C1     A2,B3,C1
      A1,B1,C1 
      
      Thus, TR = { (A2,B1,C1), (A2,B1,C2), (A2,B2,C1), (A2,B3,C1), (A1,B1,C1) }   
    • Substitute test input values
      sample solution
      (b,1,x), (b,1,y), (b,2,x), (b,3,x), (a,1,x)
  5. Apply Multiple Base Choice Coverage (MBCC)
    • Compute the (maximum) number of tests
      sample solution
      Suppose there are 2 bases: (A2,B1,C1) and (A2,B2,C2)
      #tests = #base + ( #base*(2-#base_choiceA) + #base*(3-#base_choiceB) + #base*(2-#base_choiceC) )
             = 2 + ( 2*(2-1) + 2*(3-2) + 2*(2-2) ) = 6 
    • Derive test requirements
      sample solution
      Hold all but one base choice constant for each base test, 
      use each non-base choice in each other characteristic.
      
      For base (A2,B1,C1)
      A2,B1,--      Cannot replace C characteristic (all block are used as base)
      A2,B3,C1      Cannot replace with B2 since it's also a base choice
      A1,B1,C1
      
      For base (A2,B2,C2)
      A2,B2,--      Cannot replace C characteristic (all block are used as base)
      A2,B3,C2      Cannot replace with B1 since it's also a base choice
      A1,B2,C2      
      
      Thus, TR = { (A2,B1,C1), (A2,B3,C1), (A1,B1,C1),
                   (A2,B2,C2), (A2,B3,C2), (A1,B2,C2) }    
    • Substitute test input values
      sample solution
      (b,1,x), (b,3,x), (a,1,x), 
      (b,2,y), (b,3,y), (a,2,y)

Grading rubric

[Total: 10 points]: Done (or provide evidence of your attempt, full or reasonable effort) CS 3250-001 (Section 1):

(-2.5 points) for 24 hours late (submitted after 26-Sep-2026 1pm, by 27-Sep-2026 1pm)
(-5 points) for 48 hours late (submitted after 27-Sep-2026 1pm, by 28-Sep-2026 1pm)

CS 3250-002 (Section 2): Please refer to Schedule-002 for the due date.

(-2.5 points) for 24 hours late (submitted after 30-Sep-2026 1pm, by 1-Oct-2026 1pm)
(-5 points) for 48 hours late (submitted after 1-Oct-2026 1pm, by 2-Oct-2026 1pm)


Submission

Making your submission available to instructor and course staff is your responsibility; if we cannot access or open your file, you will not get credit. Be sure to test access to your file before the due date.


Copyright © 2026 Upsorn Praphamontripong
Released under the Creative Commons License CC-BY-NC-SA 4.0 license.
Last updated 2026-09-22 9:43