Python List Programs with Output

 

                                                                    Introduction  

Python List is one of the most important data structures in Python. Lists are used to store multiple values in a single variable. This article explains important Python list programs with output for exams.


                                                           What is a List in Python?  

A list is an ordered and mutable collection of elements. Lists can store different data types like integers, strings, and floats.


Example of a List  

numbers = [1, 2, 3, 4, 5]


Program 1: Find the length of a list  

my_list = [10, 20, 30, 40]  

print(len(my_list))  


Output:  

4


Program 2: Add an element to a list  

my_list = [1, 2, 3]  

my_list.append(4)  

print(my_list)  


Output:  

[1, 2, 3, 4]


Program 3: Remove an element from a list  

my_list = [5, 10, 15, 20]  

my_list.remove(10)  

print(my_list)  


Output:  

[5, 15, 20]


Program 4: Find the largest element in a list  

numbers = [12, 45, 7, 89, 23]  

print(max(numbers))  


Output:  

89


Program 5: Reverse a list  

numbers = [1, 2, 3, 4]  

numbers.reverse()  

print(numbers)  


Output:  

[4, 3, 2, 1]


                                                  Advantages of Python Lists  

- Easy to use  

- Can store multiple data types  

- Dynamic in size  


                                                        Conclusion  

Python lists are widely used in programming. Understanding list programs is very helpful for exams and practical coding.


Comments

Post a Comment

Popular posts from this blog

What is DNS? Simple Explanation for Engineering Students

Introduction   DNS stands for Domain Name System. It is used to convert website names into IP addresses. DNS makes the internet easy to use for humans. What is DNS?   DNS is like a phonebook of the internet. It translates domain names like google.com into IP addresses like 142.250.190.14. Why DNS is needed   Computers understand only numbers (IP addresses). Humans remember names easily. DNS connects both. Simple example   When you type www.google.com in a browser, DNS finds the correct IP address and connects you to the website. Conclusion   DNS plays an important role in computer networks by making website access simple and fast.  
Read more

Dijkstra’s Algorithm – Step by Step Explanation with Example

Image
Introduction   Dijkstra’s Algorithm is a graph algorithm used to find the shortest path from a source node to all other nodes. It is widely used in computer networks and routing algorithms. What is Dijkstra’s Algorithm?    Dijkstra’s Algorithm finds the minimum distance between a starting node and all other nodes in a weighted graph. The graph should not contain negative weight edges. Where is Dijkstra’s Algorithm used?    - Computer networks for routing   - GPS navigation systems   - Shortest path problems   - Network optimization   Basic idea of the algorithm   The algorithm works by: - Selecting the node with the smallest distance - Updating distances of its neighboring nodes - Repeating the process until all nodes are visited Steps of Dijkstra’s Algorithm    1. Assign infinity distance to all nodes except the source node   2. Mark all nodes as unvisited   3. Select the unvis...
Read more

Difference Between Stack and Queue

Image
Introduction   Stack and Queue are linear data structures used in computer science. They are very important exam topics. This article explains the difference between stack and queue in a simple way. What is Stack?   Stack is a data structure that follows LIFO (Last In First Out).   Insertion and deletion happen at one end called top. Examples: - Undo operation - Function calls What is Queue?   Queue is a data structure that follows FIFO (First In First Out).   Insertion happens at rear and deletion happens at front. Examples: - Printer queue - CPU scheduling Difference Between Stack and Queue   Stack: - Follows LIFO   - One end operation   - Uses push and pop   Queue: - Follows FIFO   - Two end operation   - Uses enqueue and dequeue   Difference between Stack and Queue showing LIFO and FIFO principle Conclusion   Stack and Queue are important data structures....
Read more