Question 1: Explain the difference between linear search and binary search. In your answer, mention how each algorithm finds a target value within a list.

Answer: Linear search checks each element sequentially until the target is found or the list ends. Binary search divides a sorted list into halves repeatedly, comparing the target to the middle element to narrow down the search.

Question 2: Given a list of numbers: 3, 7, 12, 19, 25, 30, describe how a linear search would find the number 19. List the steps involved.

Answer: The linear search checks each number in order: 3 (not 19), 7 (not 19), 12 (not 19), 19 (found). It stops once the target is located at the fourth position.

Question 3: Describe a scenario where binary search is more efficient than linear search. Explain why.

Answer: Binary search is more efficient when searching in large, sorted lists because it halves the search space each time, reducing the number of comparisons needed compared to linear search, which checks each element sequentially.

Question 4: Complete the truth table for the AND gate with inputs A and B, and 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 the 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: Draw a logic circuit for a simple AND gate using basic logic symbols. Label all inputs and outputs clearly.

Answer: A correct sketch would show two input lines entering an AND gate symbol (a D-shaped symbol), with an output line from the gate. Inputs labeled A and B, output labeled C.

Question 7: Sketch a truth table for an XOR gate with inputs A and B, and output C. The table should include all possible input combinations.

Answer: A table with four rows: (0,0) -> 0; (0,1) -> 1; (1,0) -> 1; (1,1) -> 0.

Question 8: In your own words, explain what a search algorithm does in computer programming.

Answer: A search algorithm helps find a specific item or value within a list or database by systematically checking elements until the target is found or all items are checked.

Question 9: Identify which search method (linear or binary) would be more appropriate for searching a small unsorted list, and justify your choice.

Answer: Linear search is more appropriate because the list is unsorted, making binary search unusable without sorting first. Linear search checks each item directly.

Question 10: Describe how a binary search algorithm works when looking for the number 25 in the sorted list: 3, 7, 12, 19, 25, 30.

Answer: Binary search compares 25 to the middle element (12). Since 25 > 12, it searches the right half: 19, 25, 30. Next, compares 25 to 19; since 25 > 19, it searches the remaining right half: 25, 30. Finds 25 at the first position in this sublist.

Question 11: Explain why logic gates are important in computer systems.

Answer: Logic gates are fundamental building blocks of digital circuits. They perform basic logical operations that enable computers to process data and make decisions.