Question 1: Explain in your own words what a linear search is and when it might be used.

Answer: A linear search involves checking each item in a list one by one until the target item is found or the list ends. It is useful for small or unsorted lists.

Question 2: Describe the main difference between linear search and binary search.

Answer: Linear search checks each element sequentially, while binary search divides a sorted list in half repeatedly to find the target more efficiently.

Question 3: Given a list of numbers: 3, 7, 12, 19, 23, 27, 31, 35, 42, 50, perform a linear search to find the number 19. List the steps involved.

Answer: Check 3 (not 19), check 7 (not 19), check 12 (not 19), check 19 (found). Total steps: 4.

Question 4: Describe the steps of a binary search when looking for the number 27 in the list: 3, 7, 12, 19, 23, 27, 31, 35, 42, 50.

Answer: First, check the middle element (23). Since 27 is greater than 23, focus on the right half. Next, check the middle of the right half (31). Since 27 is less than 31, focus on the left part of this section. The middle here is 27, which is the target. Found at this step.

Question 5: Complete the truth table for the AND gate with inputs A and B, and output C: (Headers: A, B, C). Fill in the rows where A and B are both true or false.

Answer: A: false, B: false, C: false; A: false, B: true, C: false; A: true, B: false, C: false; A: true, B: true, C: true.

Question 6: Sketch a simple circuit that includes two switches and a light bulb controlled by an AND gate. Label all parts clearly.

Answer: A correct sketch would show two switches connected to the inputs of an AND gate, with the output connected to a light bulb. All components are labeled clearly.

Question 7: Design a simple search algorithm in pseudocode that searches for a number 'target' in a list called 'numbers'.

Answer: For each number in 'numbers': If the number equals 'target': Return 'Found'. Return 'Not found'.

Question 8: Explain why binary search is more efficient than linear search for large, sorted lists.

Answer: Binary search divides the list in half each time, reducing the number of comparisons needed. It is much faster than linear search for large lists because it eliminates half of the remaining items with each step.

Question 9: List two advantages of using binary search over linear search.

Answer: Binary search is faster for large sorted lists and reduces the number of comparisons needed to find an item.

Question 10: Sketch the flow of a binary search algorithm for finding the number 50 in a sorted list: 10, 20, 30, 40, 50, 60, 70, 80.

Answer: A correct sketch would show the initial start and end indices, the middle index checked, and how the search narrows down to the position of 50, with labels indicating each step.