Computational Thinking Qualifier: 22 December 2024 (September 2024 term)

11   mCount = 0, bCount = 0
22   while(Pile 1 has more cards){
33       Read the top card X in Pile 1
44       ********************
55       **Code Fragment**
66       *******************
77       Move X to Pile 2.
88   }
99   frac = bCount / mCount
1010
1111  Procedure hasItem (Y, A)
1212      C = False
1313      while(Card Y has more items){
1414          Read an item Z from ItemList of card Y
1515          if(Z.Item == A){
1616              C = True
1717          }
1818          Remove Z from ItemList of Y
1919      }
2020      return(C)
2121  End hasItem

11   count1 = 0, count2 = 0
22   while(Table 1 has more rows){
33       Read the first row X in Table 1
44       if(....A.... or ....B....){
55           count1 = count1 + 1
66       }
77       else{
88           count2 = count2 + 1
99       }
1010      Move X to Table 2
1111  }

11   count = 0
22   while(Table 1 has more rows){
33       Read the first row X in Table 1
44       Move X to Table 2
55       if(***Statement 1***){
66           while(Table 1 has more rows){
77               Read the first row Y in Table 1
88               Move Y to Table 3
99               if(***Statement 2***){
1010                  if(X.LetterCount == Y.LetterCount){
1111                      count = count + 1
1212                  }
1313                  else{
1414                      if(***Statement 3***){
1515                          count = count + 1
1616                      }
1717                  }
1818              }
1919          }
2020          Move all rows from Table 3 to Table 1
2121      }
2222  }