ICC Data Structures and Algorithms 1

Question 1

What is the time complexity of searching in a balanced binary search tree?

Accepted Answer

O(log n)

Answer

A balanced BST halves the search space at each step, resulting in logarithmic time complexity.

Question 2

Which data structure operates on a Last-In-First-Out (LIFO) principle?

Accepted Answer

Stack

Answer

A stack follows LIFO ordering — the most recently added element is the first to be removed.

Question 3

What is a hash collision?

Accepted Answer

When two different keys produce the same hash value

Answer

A hash collision occurs when different inputs map to the same index in a hash table, requiring collision resolution.

Question 4

What is the main advantage of a linked list over an array?

Accepted Answer

Efficient insertion and deletion without shifting elements

Answer

Linked lists allow O(1) insertion and deletion at known positions without moving other elements, unlike arrays.

Question 5

Which sorting algorithm has the best average-case time complexity?

Accepted Answer

Merge Sort with O(n log n)

Answer

Merge Sort consistently achieves O(n log n) time complexity using a divide-and-conquer approach.

(ICC) International Code Council Practice Test