Question 1: Write a simple step-by-step algorithm to make a cup of tea. List each step clearly.

Answer: 1. Fill the kettle with water. 2. Turn on the kettle and wait for the water to boil. 3. Place a tea bag in a cup. 4. Pour the hot water into the cup. 5. Wait for the tea to brew. 6. Remove the tea bag. 7. Add sugar or milk if desired. 8. Stir and enjoy.

Question 2: Describe an algorithm you could use to decide if a student has passed a test. Include the condition for passing.

Answer: The algorithm checks if the student's score is equal to or greater than the passing mark (e.g., 50%). If yes, the student passes; if not, they fail.

Question 3: Explain the difference between a sequence and a selection in programming algorithms.

Answer: A sequence is a list of steps that are followed in order, one after the other. Selection involves making decisions, such as choosing between two options based on a condition.

Question 4: Complete the truth table for an AND gate with two inputs, A and B, and one output, C.

Answer: [{"A":0,"B":0,"C":0},{"A":0,"B":1,"C":0},{"A":1,"B":0,"C":0},{"A":1,"B":1,"C":1}]

Question 5: Complete the truth table for an OR gate with inputs A and B, and output C.

Answer: [{"A":0,"B":0,"C":0},{"A":0,"B":1,"C":1},{"A":1,"B":0,"C":1},{"A":1,"B":1,"C":1}]

Question 6: Complete the truth table for a NOT gate with input A and output B.

Answer: [{"A":0,"B":1},{"A":1,"B":0}]

Question 7: Draw a logic circuit using AND, OR, and NOT gates that outputs true only when either input A or input B is true, but not both.

Answer: A correct sketch should show an XOR gate, which can be built using AND, OR, and NOT gates. The circuit should include two AND gates, two NOT gates, an OR gate, and appropriate connections to produce the XOR function.

Question 8: Sketch a flowchart that shows the process of turning on a light if it is dark outside.

Answer: A flowchart should include a start point, a decision box asking 'Is it dark outside?', a process box labeled 'Turn on light' if yes, and a process or end point if no.

Question 9: Describe how an algorithm can be tested for correctness before it is used in a program.

Answer: The algorithm can be tested by running it with different example inputs and checking if the outputs are correct. Also, reviewing the steps for logical errors and ensuring it handles all possible cases.

Question 10: Explain why algorithms are important in programming.

Answer: Algorithms are important because they provide a clear, step-by-step method for solving problems efficiently and correctly in programs.

Question 11: Sketch a simple diagram of a flowchart showing the process of deciding whether to go outside to play based on weather conditions.

Answer: A flowchart should start with a decision box labeled 'Is it sunny?', leading to a process box 'Go outside to play' if yes, or ending with 'Stay inside' if no.