It is we do we are discussing by at its implementation.
That is a fundamental part of most programming languages.
And it is the collection of elements of the same derivate as example, you can go for any of I.A.,
any of strings and so on.
So here we are having the mythos which will be operated on this at IS.
And here we are having the respective functions and descriptions.
So happened to add element to the end of the list, extend to extend all elements of a list.
To add to the list, we're having this insert two in southern element.
At the end of that index given.
So remove to remove an element from the list sapol to remove elements return element at the given index.
So that means in case a pop to remove elements and return that element which has been removed from that
given index.
We're having clear to remove all elements from the list.
So the list will become empty.
That will become empty.
Next one is the next one is the index to return the index of the first masked element.
So that is useful for the searching.
When having this count to count the number of elements passed to an argument.
So next one is a shot to short the elements in the ascending order by default.
Next one is a divorce to reverse order elements in a list.
So the order of elements, whatever will be there initially.
That will be reversed in after an application of this divorce method.
Next one is a copy to return a copy of the elements in l'Est.
So these are the different methods and the respective functions we have discussed.
So I think it would be better if you go for a demonstration.
There will be executing our python codes to show you that how this edit can be used in our Python programming.
It is our fundamental part of most programming languages and it is the collection of elements of a single
data type.
And as example, you can consider adding office elements like string adding of integers, ADR float
and so on.
How?
But in Python there is no native added data structure.
So you use Python least instead of an eddy.
But if you want to create a real at a real Addie's in about Python, we need two used up PIs, Eddie.
That is a data structure.
We are having a number num pi model.
So for mathematical problems, non-pay at it would be more efficient.
So unlike at IS, a single list can store elements of any data types and does everything and add it
does.
So we can store an integer, a flawed and a string instead of the insta inside the simplest.
So it is more flexible to work with.
So let us go for what they added descriptions and the detailing about this add handling.
And Aquiles, we are going to discuss how to create one A in about Biton.
So here you have defined one Eddie so definition and declaring NRD.
So these are the setup elements.
It is having and print Hayata so it will produce output like this one.
So now if I want to access our EDDI elements, we can use the index.
The first element we have to index Zillo so aira zero will print 10, airat one will print 20 here.
So we are at two, will print thirty here.
And here you are having this a R minus one.
That means the last element will be printed.
That is our 50.
But having this error minus two.
So that is minus one.
It is my minus two.
So 40 will get printed.
So here we are using negative indexing.
So now let us go for another edit here.
So here all dismembers, all this add elements are of the type string.
So if we print these brands, we are getting the output like this one.
So finding the length of the edit, we are having the method that is the inbuilt method that is our
line here.
So Lynn brands.
So to print it to return five year because we are having one, two, three, four, five elements.
So if you print a number of brands, we are getting here five as Upwood.
We could also add some element using that method append.
So brands start apon Intel.
So if we go on printing brands, I'm getting this intel as a last element which has got appended to
the existing it.
That is of a Brant's.
So know how to remove elements from an eddy.
So to remove elements where having the method like remove we are having the method like pop.
So here you can find that we are having this colors.
It is different there.
So let me bring the colors here.
So when for preened.
Colors.
OK.
So now if I print this colors this particular area, we're getting the outcome like this one.
So that is a there's a colors I printed.
So now if you go for this dale colored for if you go for this dale color for then after reviewing this
dale color for if I print that outcome will be this one.
So that is a colorful means.
We're having the zero one, two, three, four.
So yellow will get deleted because here we have mentioned the index as four.
So now we are having this colors dot remove blue.
So here I'm just mentioning directly their respective date items.
So here we are mentioning that the date items, so that is of a blue to blue is the member of this particular
Eddie.
So blue is going to get deleted.
So you can find that the blue has got deleted here.
So now we are having this colors pop three.
So now he had were mentioning that radically, the index we are mentioning.
So you can find here.
There is zero.
One, two, three.
So orange, you'll get deleted.
And in this way, I'm getting there is reduced number of elements of this, Eddie, getting printed
using print colors.
So in this way, we can remove items from foreman Eddie.
So now we are going for this modifying elements of an Eddie using indexing.
So fruits, apple, banana, mango, grapes and orange.
And having this one.
So fruits one.
So I'm just assigning pineapple to that.
Now what is outcome?
So let me go for the print.
So, no, let me go for the execution.
You can find that at first, this particular.
And he has got printed now fruits one one minced zero one.
So Banana will be the Best Buy pineapple.
So he really does get replaced.
Now, fruits minus one, minus one means the orange is the last one will get replaced by this guava.
So we are getting the updated content of this added fruits.
So now we are going for the concatenation of two.
Add is using the plass operator.
So concat is a goal.
Two, one, two, three.
And then concat.
Plus four, five, six.
So now you're going to print on concat.
So Nowotny Pinkel for the printing head also.
So if I go on executing, we can find that at first we having this one, two, three.
And then after concatenation, I'm getting this one, two, three.
Why?
Because I didn't assign this concat.
I didn't assign this this concatenated items in the into.
That is available.
So not let.
Let us write this one.
So let me do some changes here.
So now if I execute, I can find that.
So now this concat has got abetted by concat plus four, five, six.
So this blast is actually denoting the operator to do the concatenation between two.
It is.
So now when you are printing this concatenated at eight, we're getting this one, two, three, four,
five, six.
So now we are going for the repeating elements in an array.
So let us go for this.
Repeat A and then repeat is Ziegel to repeat, start five and then print repeat.
So now what is the outcome?
We can go for this print.
So just executing the same.
So, Atlas, is there a next time repeat?
Is the goal to rebuild Star five so this A has got repeated four five times.
OK, so now we are having this bear, this fruits.
So we're having the set of elements are the.
So if I go on executing this, so at first we're getting this fruits.
This particular area has got printed.
Now print fruits.
One colon for all of us.
Remember, the starting index will be inclusive and the ending index will be all as exclusive.
So that is the index number.
Gedo index number one is this one.
So one, two, three.
So I'm expecting Benan, a mango and a grape should get printed.
Is the airport printed accordingly?
Here, the starting index is missing.
So will because it will be considered a zero.
So from Apple.
So three Mincy to put it up to the index number two, because three will be exclusive.
So zero one two.
So Apple, Banana and Mengel should get extracted and should get printed.
Apple, banana, mango have got printed.
So now to start from this minus four, it is start from this minus four.
So minus one.
Minus two.
Minus three.
And here we are having this minus four.
And the ending index has not been mentioned.
So it will go printing up to the last elements of banana, mango, grip's and orange.
They have what printed.
So here you are having this minus minus three, two, minus one.
So minus one.
Minus two.
Minus three.
I'm getting here.
Mengel and minus one will be all is exclusive because it is the stop index.
So that's why it'll print up to minus two.
That is of a grip's.
So in this way we can have the slicing often, Eddie.
OK, so now we're going for the next one.
So here we're going to have our Mike Dee Dimensional Eddie.
So it goes on multi-dimensional, Larry, you can find that where it be a defining one.
Eddie.
So he had the first element is another Eddie that is gone consisting of one and two.
The second element is also is another Eddie consisting of three and four and so on.
So if you go on print this multidimensional edit, you are getting the outcome like this.
But if you bring this multidimensional zero, that means this one to this one to this ad, it will get
printed accordingly.
Three minutes zero.
One, two, three, four.
The Simenon eight will get printed.
So multidimensional at eight to come out one.
So two.
And one.
They are included within the square brackets individually.
So two means zero.
One, two.
So two means this one and one means zero one.
So six will get printed.
Similarly for three comma zero.
So it goes up three Angelo.
They are individually enclosed within the square brackets.
So zero.
One, two, three.
That means this particular element.
And it's a 081.
So seven will get printed here.
So in this way, you have shown you that how to handle ADD is in about Python programming with demonstration,
an example.
Thanks for watching this video.