Unit 1: Introduction to Data Structures

1.1 What is a Data Structure?

A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.

Types of Data Structures

Linear Data Structures: Elements are arranged in a sequence one after the other. Examples: Array, Linked List, Stack, Queue.
Non-Linear Data Structures: Elements are arranged in a hierarchical manner. Examples: Tree, Graph.

1.2 Algorithm Analysis

Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. Analysis of algorithms is the determination of the amount of time and space resources required to execute it.

Asymptotic Notations

Notation	Name	Usage
O(n)	Big O	Worst Case (Upper Bound)
Ω(n)	Omega	Best Case (Lower Bound)
Θ(n)	Theta	Average Case (Tight Bound)

Common Asymptotic Notations