All language subtitles for 1. Primitive and Non-Primitive Data Structures

Hi and welcome to this lesson
1

In today's lesson we will be discussing about the various types of data structures available
2

Now we have two different types of data structure that is available to us.
3

One is primitive data structure.
4

Another one is non primitive data structure
5

Now both of these categories are further sub-categorised into different categories.
6

First of all we are going to discuss about the categories that are falling under primitive data structure.
7

Now
8

If I'm saying primitive data structure
9

I'm trying to say that all the be data structure that are defined inbuilt and we can not modify them.
10

but we can use them as it is where ever we need to.
11

Right.
12

So , under primitive data structure
13

We have further categories out of those categories.
14

The very first category is integer . Now, when i am saying integer I mean to say all those numerical numbers
15

that don't have fractional part in them. Right.
16

But if I'm saying integer value I never ever means that I can not have negative numbers in it.
17

So , whenever we are saying integer data structure
18

We can have negative numbers.
19

We can have positive numbers and we can have zero as well.
20

For example we can have minus two.
21

We can have minus 1 ,0 , 1 and 2.
22

OK.
23

Some people call minus two as negative two.
24

So what I mean to say is that on my number line we can have all the integers whether they are positive
25

or they are negative they all fall under the category of integers .The next category under primitive structure
26

that is known as real . Now, if i am saying real .
27

I want to mention all those numerical values that may or may not have fractional part . Ok .that can
28

have the number can have a decimal value or it can not have decimal value
29

For example I can have number like 1.
30

and 5
31

These are also treated as real numbers because we can have one point zero , we can treat one as one
32

point zero.
33

we can treat five as five point zero or we can have numbers like seven point eighty six point five.
34

And the third category under primitive data structure that is known as
35

character
36

Till now we were dealing only with the numerical values but what if we have to deal with
37

alphabets
38

we have to deal with special symbols then for that we need character data structure
39

Under character data structure
40

We can have all the alphabets whether they are small alphabets or they are capital alphabets
41

Right.
42

So the next category under primitive data structure that is known as boolean
43

whenever i am saying boolean i can have only two possible values that is either represented by zero one or true false zero
44

represents false and 1 represents true .
45

OK.
46

So these are the subcategories under primitive data structured now under non primitive data structure
47

we again have two subcategories.
48

One is known as linear data structure.
49

Another one is known as nonlinear data structure.
50

Now what are the topics under linear and under non linear data structure
51

Let's just discuss them.
52

So under non primitive data structure we have two categories one known as linear data structure .
53

Another one is known as non-linear data structure
54

Now linear data structure means all the data structures that are .
55

Going to follow some particular pattern .Right, now.
56

What are those patterns that we will discuss while discussing linear data structure .
57

Right now you just need to understand
58

one thing the difference between linear and non linear data structure is that in case of linear
59

data structure all the elements are going to follow some kind of pattern.
60

But in case of non-linear data structure they are not going to follow any kind of pattern.
61

Now under non-linear structure we further have categories and linear data structure can be categorised
62

into first category is arrays
63

Now array whenever we want to store a group of data that is of similar type we use arrays then we
64

have linked list . linked list are used when we don't want to store the data in consecutive memory locations.
65

It is also used to store the data that is of similar type
66

But in this case the data is not supposed to store at the consecutive location
67

Next one is the known as stack. stack follows the concept of LIFO that is last in first out.
68

Next one is known as
69

Queue It follows the concept of FIFO that is first in and first out then under non linear data structure.
70

We further have categories out of them.
71

The very first one is tree ,where ever we want you represents hierarchical relationship between the elements.
72

Then we can use tree data structure and
73

One is known as Graphs
74

Wherever we want to represents our data elements with the help of nodes and vertices
75

Then we can use graph for example if we want to travel from one location another and we have three to four
76

different ways to move then with the help of graphs we can find out that which way is the best possible way
77

to move
78

So these are the categories of the structure and each category is further subdivided in two subcategories.
79

Now in our next lessons we'll be discussing that which the structure is to use which place.
80

And how to implement these data structures.
81

Thank you.