Let ​\(W(n)\) and \(A(n)\) denote respectively, the worst case and average…

PYQ GATE 2012

Let ​W(n)W(n) and A(n)A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size nn. Which of the following is ALWAYS TRUE?

  1. A.

    A(n)=Ω(W(n)) A(n) = Ω (W(n))

  2. B.

    A(n)=Θ(W(n))A(n) = Θ (W(n))

  3. C.

    A(n)=O(W(n))A(n) = O (W(n))

  4. D.

    A(n)=o(W(n))A(n) = o (W(n))

Attempted by 842 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…