Asymptotic Notation

**1.**

Let f, t: N→R ≥ 0, and t (n) ∈O (f (n)) iff t(n)≤ c.f (n) where cis positive real constant and n≥ no, then no is ___________

**2.**

The asymptotic notation for defining the average time complexity is

**3.**

If f,t: N→ R+, then t (n) ∈ Ω (f (n)), iff f(n) ∈ O (t (n)) is known as

**4.**

The mathematical definition for Omega can be defined as, provided f,g:N→R+ and c is a positive constant and n > n0,

**5.**

The θ notation is

**6.**In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do it is expressed by using

**7.**Worst case efficiency of which search is O(n)?

**8.**Which of the following formulas in Omega notation best represent the expression n²+35n+6?

**9.**What term is used to describe an O(n) algorithm?

**10.**Express the formula (n – 2)*(n – 4) using θ notation: