IT IT Data Structures and Algorithms 1

Question 1

What is the time complexity of searching for an element in a balanced binary search tree (BST)?

Accepted Answer

O(log n)

Answer

A balanced BST halves the search space at each step, yielding O(log n) search time.

Question 2

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

Accepted Answer

Stack

Answer

A stack removes elements in the reverse order they were added, following the LIFO principle.

Question 3

What algorithm technique solves a problem by breaking it into overlapping subproblems and storing their results?

Accepted Answer

Dynamic Programming

Answer

Dynamic programming uses memoization or tabulation to avoid recomputing overlapping subproblems.

Question 4

In a hash table, what is a collision?

Accepted Answer

When two keys map to the same index

Answer

A collision occurs when the hash function maps two different keys to the same bucket index.

Question 5

Which sorting algorithm has an average-case time complexity of O(n log n)?

Accepted Answer

Merge Sort

Answer

Merge Sort recursively divides and merges arrays, consistently achieving O(n log n) on average.

IT - Bachelor's Degree in Information Technology Practice Test