Solution to assignment 2 Warm-up.

Part B: How many test cases do we need for the subsequence program?  

1 - the second string has less than three characters
1 - the second string has more than three characters
- the second string has exactly three characters
  1 - none of the characters are in the first string
  3 - only one of the three characters is in the first string
  3 - only two of the three characters is in the first string
  5 - all of the characters are in the first string, but in the wrong
      order (5 permutations: 132, 213, 231, 312, 321)
  5 - all of the characters are in the first string in the right order,
      consecutively, non-consecutively, appearing more than once (check
      each character as duplicate for 3 cases)

That adds up to at least 19 test cases.  



Part C: Pseudocode to convert a number from binary (base 2) to decimal
(base 10), version 1.

prompt for binary number
read binary
initialize number to 0
set power to length of binary - 1
set index to 0
repeat while power >= 0 (or index < length)
    if bit at index in binary is a 1, 
        add 2^power to number
    subtract 1 from power
    add 1 to index
display "decimal value is " + number