PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2023 paper

Module 1: Introduction

20232m

Which of the following notations is used to represent the worst-case time complexity of an algorithm?
(i) O-notation
(ii) Ω\Omega-notation
(iii) Θ\Theta-notation
(iv) δ\delta-notation

Search GoogleAsk AI
Worked SolutionAI Assisted

Answer: (i) O-notation

  • O = upper bound (worst-case)
  • Ω = lower bound (best-case)
  • Θ = tight bound (average-case when upper=lower)
    Worst-case expressed with Big-O.

Similar questions

Design and Analysis of Algorithms In Asymptotic notation, Big- \Omega (Omega) is used to represent (i) The upper bound (Worst-case) (ii) The lower bound (Best-case) (iii) The tight bound (Average-case) (iv) None of the above20252mDesign and Analysis of Algorithms Explain the concept of asymptotic notation (Big O, Big Omega, and Big Theta) in algorithm analysis.20237mDesign and Analysis of Algorithms What is the complexity of T(n) = 2T(n/4) + n^2 \log n? (i) \Theta(n^2 \log(\log n)) (ii) \Theta(n^3 \log n) (iii) \Theta(n^2 \log n) (iv) \Theta(n \log n)20232mDesign and Analysis of Algorithms Which of the following best describes space complexity? (i) Time taken by the algorithm (ii) Memory required to run an algorithm (iii) Number of recursive calls (iv) Number of loops used20242m
NextWhich of the following sorting algorithms has the best time complexity in the average case? (i) Bubble sort (ii) Insertion sort (iii) Quick sort (iv) Selection sort
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play