Algorithmic Tools
Data Structures
Graph Algorithms

Quiz – S1M2 Big O

The goal of this quiz is to practice with big-O notation.

Recall that we write f(n) = O(g(n)) to express the fact that f(n) grows no faster than g(n): there exist constants N and c > 0 so that for all n >= N, f(n) <= c*g(n)

Select True or False for the following statements:

Do NOT follow this link or you will be banned from the site!