Computational Thinking Qualifier: 24 March 2024 (January 2024 term)

1 1  mCount = 0, bCount = 0
2 2  while(Pile 1 has more cards){
3 3      Read the top card X in Pile 1
4 4      ********************
5 5      **Code Fragment**
6 6      ********************
7 7      Move X to Pile 2.
8 8  }
9 9  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

1 1  count = 0
2 2  while(Table 1 has more rows){
3 3      Read the first row X in Table 1
4 4      Move X to Table 2
5 5      if(***Statement 1***){
6 6          while(Table 1 has more rows){
7 7              Read the first row Y in Table 1
8 8              Move Y to Table 3
9 9              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  }

1 1  Count = 0
2 2  while(Table 1 has more rows){
3 3      Read the first row X from Table 1
4 4      A = False, B = False, C = False, D = False
5 5      if(X.Total > AvgT){
6 6          A = True
7 7      }
8 8      if(X.Mathematics < AvgM){
9 9          B = True
1010      }
1111      if(X.Physics < AvgP){
1212          C = True
1313      }
1414      if(X.Chemistry < AvgC){
1515          D = True
1616      }
1717      if(A and (B or C or D)){
1818          Count = Count + 1
1919      }
2020      Move X to Table 2
2121  }