BCS Data Structures and Algorithms

Question 1

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

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n²)

Answer

O(1)

Question 2

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

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Heap

Question 3

What is the worst-case time complexity of QuickSort?

Accepted Answer

O(n²)

Answer

O(n log n)

Answer

O(n)

Answer

O(log n)

Question 4

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

Accepted Answer

Leftmost node

Answer

Root node

Answer

Rightmost node

Answer

Any leaf node

Question 5

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

Accepted Answer

MergeSort

Answer

QuickSort

Answer

BubbleSort

Answer

InsertionSort

Question 6

What is the space complexity of a recursive Fibonacci function without memoization?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(n²)

Answer

O(2^n)