19.1 Algorithms Cambridge iA 9618

Which search algorithm requires the dataset to be sorted before execution?

• Binary search

• Linear search

• Bubble sort

• Insertion sort

What is the time complexity of a linear search in the worst case?

• O(n)

• O(log n)

• O(n²)

• O(1)

Which of the following best describes binary search?

• It repeatedly divides the search space in half until the target is found

• It checks every element one by one

• It sorts data before searching

• It finds an element in constant time

What is the worst-case time complexity of binary search?

• O(log n)

• O(n)

• O(n²)

• O(1)

Which sorting algorithm compares adjacent elements and swaps them if necessary?

• Bubble sort

• Insertion sort

• Quick sort

• Merge sort

Which sorting algorithm builds the sorted list one item at a time?

• Insertion sort

• Bubble sort

• Selection sort

• Heap sort

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

• O(n²)

• O(n log n)

• O(n)

• O(1)

Which of the following sorting algorithms is more efficient for a nearly sorted dataset?

• Insertion sort

• Bubble sort

• Selection sort

• Quick sort

Which data structure follows the Last In, First Out (LIFO) principle?

• Stack

• Queue

• Linked list

• Binary tree

Which data structure follows the First In, First Out (FIFO) principle?

• Queue

• Stack

• Linked list

• Binary tree