Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 1: Introduction to Data Structures & Algorithms (4 Hrs.)

1. Asymptotic Analysis Definition Asymptotic analysis is a method used to analyze the performance of an algorithm by measuring how its time or space complexity grows as the input size (n) becomes ver

1. Definition of Big-O Notation Big-O notation (O) is an asymptotic notation used to describe the upper bound of the time or space complexity of an algorithm. It represents the worst-case performanc

1. Need for Asymptotic Notation Asymptotic notation is used to describe the performance of algorithms in terms of time and space complexity as input size increases. Why it is needed: - Ignores machi

1. Definition of Complexity Algorithm complexity is a measure of the efficiency of an algorithm. It helps us understand: - Time Complexity: How much time an algorithm takes relative to input size n.

Definition Dynamic memory allocation is the process of allocating memory to a program at runtime instead of at compile time. It allows a program to request memory from the heap as needed, making effic