Question 1: Explain in your own words what a linear search is and give a scenario where it would be used.

Answer: A linear search involves going through each item in a list one by one until the target item is found or the list ends. It is used when the list is unsorted or small, such as searching for a specific name in an unsorted list of names.

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

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

Question 3: Given an unsorted list: [8, 3, 7, 1, 9], perform a step-by-step linear search to find the number 7. Indicate the steps taken.

Answer: Start at first element: 8 (not 7), move to next: 3 (not 7), next: 7 (found). The search took 3 steps before locating 7.

Question 4: A sorted list contains the numbers [2, 4, 6, 8, 10, 12, 14]. Use binary search to find the number 10. Outline the steps involved.

Answer: Initial middle element: 8. Since 10 > 8, focus on the right half: [10, 12, 14]. Middle of this half: 12. Since 10 < 12, focus on the left: [10]. Found 10 at this step.

Question 5: Complete the truth table for the AND logic gate with the following inputs: A = true, B = false.

Answer: {"A":true,"B":false,"Output":false}

Question 6: Draw a logic circuit that uses an AND gate and an OR gate to produce a specific output based on two inputs, X and Y. Label each gate and input clearly.

Answer: A correctly drawn circuit would show two inputs labeled X and Y; one AND gate receiving inputs from X and Y; a second OR gate also receiving inputs from X and Y; the outputs of both gates connected to a final OR gate which produces the output.

Question 7: Sketch a flowchart that describes the process of searching for a book in a library where books are arranged alphabetically by title. Include starting and ending points.

Answer: A flowchart starting with 'Start', then 'Open the library door', 'Check the first book', 'Is the book title the target?', if no, 'Move to the next book', repeat until found or end of shelf, then 'End'.

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

Answer: Binary search divides the dataset in half each time, reducing the number of comparisons needed to find the target, making it much faster for large sorted datasets compared to linear search which checks each item sequentially.

Question 9: You have a list of 1000 numbers sorted in ascending order. Which search method would be more appropriate: linear search or binary search? Justify your answer.

Answer: Binary search would be more appropriate because it is efficient for large, sorted datasets, reducing the number of comparisons significantly compared to linear search.

Question 10: Describe a real-life situation where a linear search would be preferable over binary search.

Answer: When searching for a specific item in an unsorted collection, such as finding a particular file in a mixed pile of documents, linear search is suitable because the list isn't sorted.

Question 11: Draw a simple pseudocode for a linear search algorithm that searches for a target value in a list.

Answer: for each item in list: if item equals target: return index return 'Not found'