PadhaikoAll subjects

Past exam question: 2078 Baishakh (Back), Q5

Data Structure and Algorithms · 4 marks

Open in the Padhaiko app

Topic: Introduction

Question

Explain about Big-Oh notation with its significance and limitation.

Solution

Definition of Big-Oh () Notation: A function is if there exist positive constants and such that:

Big-Oh provides an asymptotic upper bound on the growth rate of an algorithm's resource usage (usually worst-case time).

Significance and Limitations of Big-Oh:

Answer:

Big-Oh () bounds worst-case growth from above ( for ). Its significance is hardware-independent worst-case comparison at scale; its limitations are hiding constant factors, small- behavior, hardware cache effects, and potentially giving loose bounds.

All past exam questions for Data Structure and Algorithms