GATE CS 2012 – Question 16

Multiple choice 1 mark Question 16 2012

Question 16

MCQ 1 marks · −0.33 Algorithms

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?

A \(A(n) = \Omega(W(n))\) B \(A(n) = \Theta(W(n))\) C \(A(n) = O(W(n))\) D \(A(n) = o(W(n))\)

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2012 Algorithms

Source: GATE 2012 Computer Science and Engineering, Q16 (question number approximate)

GATE CS 2021 Set 1 – Question 36
GATE CS 2019 – Question 37
GATE CS 2018 – Question 14
GATE CS 2017 Set 1 – Question 39
GATE CS 2016 Set 2 – Question 36
GATE CS 2016 Set 1 – Question 12
GATE CS 2015 Set 2 – Question 14
GATE CS 2015 Set 1 – Question 34

All Algorithms questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Algorithms