What is significant about big-theta notation (?)?

a. Asymptotically tighter bound than O(n)
b. Compute Big-O of f(n)
c. Determine the Big-O error factor
d. Find the optimal case of an algorithm

a. Asymptotically tighter bound than O(n)