DATA STRUCTURES INTRODUCTION

Let's Start with Basic Terminologies

Data: The data is set or collection of information, Majorly used for analysis.

Structure: The arrangement or proper organization of items is called structure.

Record: Record can be Defined as Collection of Various Data Items.

File: File is a Collection of Various Records of one type of Entity.

Do you know? Data Structure plays a vital role in the field of software. But how? Go through the blog to know.

What is Data Structure?

The arrangement or proper organization of data in a systematic manner is called a data structure, Data structure is also storage.

It is also used for Processing, Retrieving, and Storing data. The data structures are divided Into Two Types Primitive Data structure and Non-Primitive Data Structure.

Primitive Data Structure: Primitive data structures are the basic data structures directly operated on a machine.

example:

1. Integer

2. Character

3. Float

4. Pointer

5. Real

6. Boolean

Non-Primitive Data Structure: Non-primitive data structures are the data structure derived from primitive data structures, Further divided into Linear and Non-Linear data structures.

• Linear Data structure: In linear data structure the data elements are arranged sequential linear order, Further divided into Static and Dynamic.

Examples:

1. Array ( Static )

2. Link list ( Dynamic )

3. Stack ( Dynamic )

4. Queue ( Dynamic )

• Non-Linear Data Structure: In non-linear data structures the elements are not placed in sequential or linear order.

Examples:

1. Tree

2. Graph

To understand better the data structures let's dive into the real-world scenario, Suppose you are using a mobile and opened the Amazon Shopping application and searching for an item it gives you an accurate result according to your sorting and filters, Here the data structure plays a key role.

OR

Now you opened the Google search and search for a website it gives you accurate results, Also here the data structure plays a key role.

---

Before learning about the data structures it is important to know about the Time and Space Complexities. Because of these complexities, you can analyze your algorithm and how fast and efficient it is, Now here Asymptotic Notations come into the picture this is a very important part of DSA simply building blocks of DSA.

Asymptotic Notation

Asymptotic notations are used to optimize and make the code efficient by reducing the time and space complexities. It gives the best, average, and worst-case scenarios of your algorithm.