CSC 101 Final Exam Practice Test Review 2025, Exams of C programming

Download CSC 101 Final Exam Practice Test Review 2025 and more Exams C programming in PDF only on Docsity!

• CSC 101 Final Exam Practice Test Review

Explain how a Binary Search algorithm improves search elficiency compared to a linear search, It cheeks cach element one by one until the target is found. It climinates half of the remaining elements with cach 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 Lincar Search? A search algorithm that divides the data set in half with cach iteration, A scarch algorithm that checks cach clement in a list sequentially until the desired element is found. A search algorithm thal uses a hash lable lo find elements quickly. A search algorithm thal requires the data lo be sorted before searching. ee Which of the [allowing best describes the Bubble Sort algorithm? A sorting algorithm thal 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 halyes, sorts them, and then merges them back together, An algorithm that sorts clements by repeatedly selecting the smallest clement from the unsorted portion and moying it to the sorted partion. A technique that sorts data by distributing clements into buckets based on their values. 4,