Menu
Home / GATE 2017-2018 / GATE CSE :: Discussion

Discussion :: GATE CSE

  1. Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
    2. A.
    A(n) = Ω (W(n))
    B.
    A(n) = Θ (W(n))
    C.
    A(n) = O (W(n))
    D.
    A(n) = o (W(n))

    View Answer

    Workspace

    View Answer

    Answer : Option C

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment