PadhaikoAll subjects

Past exam question: 2064 Jestha, Q10(a)

Data Structure and Algorithms · 4 marks

Open in the Padhaiko app

Topic: Introduction

Question

Write short notes on: a) Big 'O' notation

Solution

Big 'O' Notation: Big-O () characterizes the asymptotic upper bound on an algorithm's time or space growth rate:

It guarantees that resource consumption grows no faster than a constant multiple of for large (typically representing worst-case complexity, such as for Bubble sort or for Binary search).

Answer:

Big 'O' notation ( for ) gives an asymptotic worst-case upper bound on algorithm complexity independent of hardware constants.

All past exam questions for Data Structure and Algorithms