AHJN: Unit19-Computational Thinking

Which search algorithm has a time complexity of O(log n)?

• Binary search

• Linear search

• Bubble sort

• Insertion sort

What is a necessary condition for using a binary search algorithm?

• The data must be sorted

• The data must be stored in a linked list

• The data must contain only numeric values

• The data must be stored in a queue

Which of the following is NOT an abstract data type (ADT)?

• Stack

• Queue

• Binary tree

• Algorithm

What notation is commonly used to compare the efficiency of algorithms?

• Big O notation

• Little O notation

• Alpha-beta notation

• Theta notation

In a linear search algorithm, what is the worst-case time complexity when searching through n elements?

• O(n)

• O(log n)

• O(1)

• O(n²)

Which of the following statements about binary search is correct?

• It has a worst-case time complexity of O(log n)

• It always requires more comparisons than linear search

• It can be used on unsorted data

• It requires a linked list data structure

How many comparisons would a binary search require in the worst case to find a value in a sorted array of 1024 elements?

• 10

• 11

• 512

• 1024

Which sorting algorithm repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order?

• Bubble sort

• Insertion sort

• Quick sort

• Merge sort

What is the worst-case time complexity of bubble sort?

• O(1)

• O(log n)

• O(n)

• O(n²)

In insertion sort, what happens to each element during the sorting process?

• It is compared with all other elements in the array

• It is inserted at the beginning of the array

• It is swapped with the smallest remaining element

• It is inserted into its correct position in the already sorted portion of the array