ICC Data Structures and Algorithms

Question 1

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

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(1)

Answer

O(n^2)

Question 2

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

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Hash Table

Question 3

What is a hash collision?

Accepted Answer

When two different keys produce the same hash value

Answer

When a hash table runs out of memory

Answer

When a hash function returns null

Answer

When two hash tables are merged

Question 4

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

Accepted Answer

Efficient insertion and deletion without shifting elements

Answer

Faster random access to elements

Answer

Less memory usage per element

Answer

Simpler implementation

Question 5

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

Accepted Answer

Merge Sort with O(n log n)

Answer

Bubble Sort with O(n^2)

Answer

Selection Sort with O(n^2)

Answer

Insertion Sort with O(n^2)

Question 6

What is the purpose of a queue data structure?

Accepted Answer

To process elements in First-In-First-Out (FIFO) order

Answer

To sort elements automatically

Answer

To store elements in sorted order

Answer

To enable random access to elements