Skip to main content

List and Tuple in PYTHON

First of all, do you know what is a 'list' ??

If no, then don't worry and if yes congratulations !

List :-  A number of connected items or names written or printed consecutively, typically one below the other .

Tuple :-  A tuple is a collection which is ordered and unchangable . But lists are changable .


So now defining each of the above in a detailed manner, so that everyone could understand and after that we will implement these in our programme.

1.) LISTS

Python lists are the containers to store a set of values of any type of data (int, str, float, boolean). For example:- If 'myname' is the name of that list and its components are Rohan, Mohan, Ram and John. So the code to write it is as follow :-

myname  =  ['Rohan', 'Mohan', 'Ram', 'John']

Another examples :-

mynums  =  [4, 2, 97, -43, 0]

mylist  =  [5, 0.33, 'Veer', 1]

Hope you understand how to write a list in python. Now talking about list indexing.

If we have a list named 'mynums' and

mynums  =  [4, 8, 2, 78, 9] ; here we have our first element is 4, second element is 8. So we can write

mynum[1]  =  4

mynum[3]  =  2


Now we will talk about list methods like max, min, sort, append, reverse, pop, remove .

So using max method, we can print the maximum number present in the list. By using min method, we can find the minimum number present in the list. By using sort method, our list get sorted and is printed as increasing order. By using reverse method, our list got reverted means first element becomes last and last becomes first etc. By using pop method, element at the last is deleted from the list. By using remove method, the element of our choice can be deleted.

So, lets start their implementation.




Now using the methods :-













2.) TUPLES

Tuples are the immutable data types in python. Immutable means which can't be changed.
For examples :

mytuple  =  ( ) ==> Empty Tuple

mytuple  =  (4, ) ==> Tuple with one element needs comma 

mytuple  =  (4, 2, 8, 6) ==> Tuple with more than one element

Once tuple is defined it can't be manipulated or update.

It means append, pop, remove, sort etc methods won't work on tuple because the reason is tuples are immuatable.
If a tuple is once defined no one can change it or update it.




Hope you like this tutorial. Please share it with your friends.

In our next tutorial, we will learn about sets and dictionary.


John Veer
Contact mail id - john.veer.utube@gmail.com
Thanks for reading !

Comments

Post a Comment

Popular posts from this blog

First Python Programme

  If you are here, then I think you are a python enthusiast. On this website, we upload daily posts on new and basic programme for beginners.  So let’s start with the first code i.e. Hello World programme. So first of all you you should know how to give print command in python. To print we write print(“Hello World”). What’s inside the small brackets will be printed. So the programme is : print("Hello World") Hello World So, as we can see above, when we implemented the print command, the thing between the small bracket is printed. So let’s see some other examples In this example, we will store an integer value in a variable. And then print the integer will the help,of that variable. So let’s get started a = 3 print(a) 3 Another example Now we will store a string into a variable and then print the string with the help of that variable #if we put hastag in front of any line in python. Then there is no effect. #for storing the string in a variable, we have to enclose the whole s...
1 comment
Read more

Doubly Linked List in PYTHON

  Here is the Python code for the Doubly Linked List :- #first of all creat a class node class Node :     def __init__ ( self , data ):         self . data = data         self . next = None         self . prev = None #now create a class of doubly linked list class DLL :     def __init__ ( self ):         self . head = None #function to insert the node at begining     def insertatbeg ( self , data ):         newnode = Node ( data )         newnode . prev = None         newnode . next = self . head         self . head = newnode #function to insert the node at the end     def insertatend ( self , data ):         newnode = Node ( data )         if self . head is None :             self . head ...
Post a Comment
Read more

Queues in PYTHON

  The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...
1 comment
Read more