Question 1: List three common methods used to sort a list of numbers in programming.

Answer: Bubble sort, selection sort, insertion sort.

Question 2: Explain in your own words what the term 'sorting' means in programming.

Answer: Sorting means arranging data in a specific order, such as from smallest to largest or alphabetically.

Question 3: Given the list of numbers: 8, 3, 5, 1, 9. Show the list after it has been sorted in ascending order.

Answer: 1, 3, 5, 8, 9

Question 4: Describe how the bubble sort algorithm works, step by step, using a list of five numbers.

Answer: Bubble sort compares each pair of adjacent items; if they are in the wrong order, it swaps them. This process repeats for each pass through the list until no more swaps are needed, resulting in a sorted list.

Question 5: Complete the truth table for the AND logic gate with inputs A and B, and output Q:

Answer: A | B | Q 0 | 0 | 0 0 | 1 | 0 1 | 0 | 0 1 | 1 | 1

Question 6: Draw a logic circuit for an OR gate with two inputs. Label the inputs as A and B, and the output as Q.

Answer: A correct sketch would show an OR gate symbol with two input lines labeled A and B entering the gate, and one output line labeled Q exiting the gate.

Question 7: Imagine you have a list of names: Alice, Bob, Charlie, and Diana. Arrange them in alphabetical order.

Answer: Alice, Bob, Charlie, Diana

Question 8: If a list of numbers is sorted from largest to smallest, what is this type of sorting called?

Answer: Descending order sorting.

Question 9: Describe a real-world scenario where sorting data might be useful.

Answer: Sorting students' test scores from highest to lowest to find the top scorers.

Question 10: Sketch a simple flowchart showing the process of checking if a number is greater than 10 and then printing 'Large' or 'Small'.

Answer: A flowchart with a decision box labeled 'Is number > 10?', with two arrows: one leading to 'Print Large' if yes, and the other leading to 'Print Small' if no.

Question 11: Explain why sorting data can make searching for specific information faster in a list.

Answer: Because sorted data allows for faster search methods like binary search, which repeatedly divides the list to find the item quickly.