Epic Skills Assessment Algorithmic Problem Solving 2

Question 1

What is the time complexity of finding an element in a balanced binary search tree?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n log n)

Answer

O(1)

Question 2

Which technique solves a problem by breaking it into overlapping subproblems and storing results to avoid redundant computation?

Accepted Answer

Dynamic programming

Answer

Greedy algorithm

Answer

Divide and conquer

Answer

Backtracking

Question 3

In a graph with V vertices and E edges, what is the space complexity of an adjacency list representation?

Accepted Answer

O(V + E)

Answer

O(V²)

Answer

O(E)

Answer

O(V × E)

Question 4

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

Accepted Answer

Merge sort

Answer

Bubble sort

Answer

Insertion sort

Answer

Selection sort

Question 5

What does it mean for an algorithm to be 'in-place'?

Accepted Answer

It uses O(1) extra memory beyond the input

Answer

It runs in constant time

Answer

It never modifies the input

Answer

It always produces a stable sort

Question 6

Which data structure is best suited for implementing a priority queue efficiently?

Accepted Answer

Binary heap

Answer

Linked list

Answer

Stack

Answer

Hash table

Question 7

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)