For the following recurrence equation, we can apply master method to solve it. T(n) =
T(n/2) + 2T(n/3) + n
Give this one a try later!
False
What is the lower bound of sorting by comparison?
, Give this one a try later!
Ω(nlgn)
Binary search, merge sort, and quick sort are all divide-and-conquer algorithms.
Give this one a try later!
True
simple uniform hashing
Give this one a try later!
a good hash function that is equally likely to have data placed in each of
the slots
Given the following function f(n), the big-O notation for this function is f(n) = O(n^3).
The function in question: 4n^3 + n^1/2 + (3/2)^n
Give this one a try later!
False, (3/2)^n is the big-O notation for the function.
Kruskal's Algorithm
T(n/2) + 2T(n/3) + n
Give this one a try later!
False
What is the lower bound of sorting by comparison?
, Give this one a try later!
Ω(nlgn)
Binary search, merge sort, and quick sort are all divide-and-conquer algorithms.
Give this one a try later!
True
simple uniform hashing
Give this one a try later!
a good hash function that is equally likely to have data placed in each of
the slots
Given the following function f(n), the big-O notation for this function is f(n) = O(n^3).
The function in question: 4n^3 + n^1/2 + (3/2)^n
Give this one a try later!
False, (3/2)^n is the big-O notation for the function.
Kruskal's Algorithm
