Xiu, Ming wrote:
For questions 3, where we have to work out how many sweets to give to each child, are we allowed to change where the children sits?
No, the order of the children is fixed. The teacher only has control over the number of sweets given to each child.
Also for question 5, where we have to design a BSP for the game of life, what is the BSP trying to do, is it to just fill out the grid and return the grid or the last cell in position (n,n)? Also what are the initial conditions, are the cells of the first row/column initially alive?
You can assume that the initial cell states are given as the algorithm's input, and the final cell states after n generations must be provided as output.