CSC 101 Final Exam Practice Test Review 2025

CSC 101 Final Exam Practice Test Review 2025 1. Explain how a Binary Search algorithm improves search efficiency compared to a linear search. It checks each element one by one until the target is found. It eliminates half of the remaining elements with each step. It requires more memory than a linear search. It can only be used on unsorted data. 2. Which of the following best describes a Linear Search? A search algorithm that divides the data set in half with each iteration. A search algorithm that checks each element in a list sequentially until the desired element is found. A search algorithm that uses a hash table to find elements quickly. A search algorithm that requires the data to be sorted before searching. 3. Which of the following best describes the Bubble Sort algorithm? A sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. A method of sorting that divides the list into two halves, sorts them, and then merges them back together. An algorithm that sorts elements by repeatedly selecting the smallest element from the unsorted portion and moving it to the sorted portion. A technique that sorts data by distributing elements into buckets based on their values. 4. Which of the following best defines a heuristic algorithm? A method that guarantees an optimal solution to a problem. A technique used to find a satisfactory solution when classic methods are too slow. An algorithm that uses brute force to explore all possible solutions. A process that relies solely on random sampling to find solutions. 5.