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

Discussion :: GATE CSE

  1. Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.

    MultiDequeue(Q){ 
             m = k 
             while (Q is not empty) and (m > 0) { 
                          Dequeue(Q) 
                          m = m “ 1
               }
     }

    What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?
    2. A.
    Θ(n)
    B.
    Θ(n + k)
    C.
    Θ(nk)
    D.
    Θ(n2)

    View Answer

    Workspace

    View Answer

    Answer : Option A

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment