Computational Thinking Quiz 2: 23 November 2025 (September 2025 term)

1 1  Procedure eliminate(L1, L2)
2 2      L3 = [], Found = False
3 3      foreach i in L1{
4 4          foreach j in L2{
5 5              if(i == j){
6 6                  Found == True
7 7              }
8 8          }
9 9          if(not Found){
1010              L3 = L3 ++ [i]
1111          }
1212          Found = False
1313      }
1414      return(L3)
1515  End eliminate

11  aList = [2, 6, 7, 2, 8, 7, 6, 2, 3]
22  bDict = {}
33  bList = []
44  foreach a in aList{
55      if(not isKey(bDict, a)){
66          bDict[a] = True
77          bList = [a] ++ bList
88      }
99  }

1 1  firstDict = {}, secondDict = {}, commonDict = {}
2 2  firstDict = updateDict(X, commonDict)
3 3  secondDict = updateDict(Y, commonDict)
4 4  foreach key in keys(firstDict){
5 5      if(isKey(secondDict, key)){
6 6          if(firstDict[key] > secondDict[key]){
7 7              commonDict[key] = firstDict[key]
8 8          }
9 9          else{
1010              commonDict[key] = secondDict[key]
1111          }
1212      }
1313  }
1414
1515  Procedure updateDict(Z, Dict)
1616      i = 1, x = ''
1717      while(i <= Z.LetterCount){
1818          x = ith letter of Z.Word
1919          if(not isKey(Dict, x)){
2020              Dict[x] = 1
2121          }
2222          else{
2323              Dict[x] = Dict[x] + 1
2424          }
2525          i = i + 1
2626      }
2727      return(Dict)
2828  End updateDict

1 1  D = {}, B = 0
2 2  while(Table 1 has more rows){
3 3      Read the first row X in Table 1
4 4      D = updateDictByField(D, X.Physics)
5 5      Move X to Table 2
6 6  }
7 7  B = findAKey(D)
8 8
9 9  Procedure updateDictByField(D, Value)
1010      if(isKey(D, Value)){
1111          D[Value] = D[Value] + 1
1212      }
1313      else{
1414          D[Value] = 1
1515      }
1616      return(D)
1717  End updateDictByField
1818
1919  Procedure findAKey(D)
2020      Key = -1, Value = 0
2121      foreach A in keys(D){
2222          if(D[A] > Value){
2323              Value = D[A]
2424              Key = A
2525          }
2626      }
2727      return(Key)
2828  End findAKey

1 1  D = {}
2 2  while(Pile 1 has more cards){
3 3      Read the top card X in Pile 1
4 4      D = updateDictionary(D, X)
5 5      Move X to Pile 2
6 6  }
7 7
8 8  Procedure updateDictionary(D, Y)
9 9      foreach A in Y.ItemList{
1010          C = A.ItemName
1111          if(isKey(D, C)){
1212              if(isKey(D[C], Y.ShopName)){
1313                  if(D[C][Y.ShopName]["Price"] != A.Price){
1414                      D[C][Y.ShopName]["Flag"] = True
1515                  }
1616              }
1717              else{
1818                  D[C][Y.ShopName] = {"Price": A.Price, "Flag" : False}
1919              }
2020          }
2121          else{
2222              D[C] = {}
2323              D[C][Y.ShopName] = {"Price": A.Price, "Flag" : False}
2424          }
2525      }
2626      return (D)
2727  End updateDictionary

1 1  Procedure getTwo(A, B)
2 2      result = []
3 3
4 4      max1A = -1
5 5      max2A = -1
6 6      foreach x in A{
7 7          if(x > max1A){
8 8              max2A = max1A
9 9              max1A = x
1010          }
1111          else if(x > max2A){
1212              max2A = x
1313          }
1414      }
1515
1616      max1B = -1
1717      max2B = -1
1818      foreach y in B{
1919          if(y > max1B){
2020              max2B = max1B
2121              max1B = y
2222          }
2323          else if(y > max2B){
2424              max2B = y
2525          }
2626      }
2727
2828      result = [max2A, max1A, max1B]
2929      return(result)
3030  End getTwo
3131
3232  L1 = [3, 4, 7, 8, 1]
3333  L2 = [2, 6, 8, 9, 1]
3434  L = getTwo(L1, L2)
3535

1 1  A = []
2 2  B = []
3 3  while (Table 1 has more rows){
4 4      Read the top row X from Table 1
5 5      if(X.Total > 200){
6 6          A = A ++ [X.SeqNo]
7 7          if(X.CityTown == "Chennai"){
8 8              B = B ++ [X.SeqNo]
9 9          }
1010      }
1111  }

1 1  D = {}
2 2  while(Pile 1 has more cards){
3 3      Read the top card X in Pile 1
4 4      D = updateDictionary(D, X)
5 5      Move X to Pile 2
6 6  }
7 7
8 8  Procedure updateDictionary(D, Y)
9 9      if(not isKey(D, Y.CustomerName)){
1010          D[Y.CustomerName] = {"Shop": [], "Category": []}
1111      }
1212      D[Y.CustomerName]["Shop"][Y.ShopName] = True
1313      foreach A in Y.ItemList{
1414          D[Y.CustomerName]["Shop"][A.Category] = True
1515      }
1616      return(D)
1717  End updateDictionary

1 1  Procedure processList(numList)
2 2      tempDict = {}
3 3      result = []
4 4      foreach x in numList{
5 5          if(x % 2 == 0){
6 6              if(not isKey(tempDict, x)){
7 7                  tempDict[x] = True
8 8                  result = result ++ [x]
9 9              }
1010          }
1111      }
1212      return(result)
1313  End processList
1414
1515  A = [4, 3, 2, 4, 3, 5, 6, 7, 8, 6, 2]
1616  B = processList(A)

11  count = 0, flag = True
22  while(Table 1 has more rows){
33      Read the first row X in Table 1
44      *******************
55      ** Fill the code **
66      *******************
77      Move X to Table 2
88  }

11  count = 0, flag = True
22  while(Table 1 has more rows){
33      Read the first row X in Table 1
44      *******************
55      ** Fill the code **
66      *******************
77      Move X to Table 2
88  }