BCS Data Structures and Algorithms 1

Question 1

What is the time complexity of binary search on a sorted array of n elements?

Accepted Answer

O(log n)

Answer

Binary search repeatedly halves the search space, resulting in O(log n) time complexity.

Question 2

Which data structure uses LIFO (Last In, First Out) ordering?

Accepted Answer

Stack

Answer

A stack follows LIFO ordering, where the last element pushed is the first one popped.

Question 3

What is the worst-case time complexity of QuickSort?

Accepted Answer

O(n²)

Answer

QuickSort degrades to O(n²) in the worst case when the pivot consistently picks the smallest or largest element.

Question 4

In a binary search tree (BST), where is the minimum value located?

Accepted Answer

Leftmost node

Answer

In a BST, the minimum value is always found by traversing to the leftmost node.

Question 5

Which sorting algorithm has a guaranteed O(n log n) time complexity in all cases?

Accepted Answer

MergeSort

Answer

MergeSort always divides the array in half and merges, guaranteeing O(n log n) in best, average, and worst cases.

BCS - Bachelor Of Computer Science Degree Practice Test