Scribd
Upload
12 views4 pages

Python Lab Manual: 10 Experiments

Uploaded by

anbi112001
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views4 pages

Python Lab Manual: 10 Experiments

Uploaded by

anbi112001
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Python Lab Manual

Experiment 1: Simple Interest


Aim: Simple Interest

Code:

P = float(input("Enter principal amount: "))


R = float(input("Enter rate of interest: "))
T = float(input("Enter time in years: "))

SI = (P * R * T) / 100
print("Simple Interest = ", SI)

Experiment 2: Compound Interest


Aim: Compound Interest

Code:

P = float(input("Enter principal amount: "))


R = float(input("Enter rate of interest: "))
T = float(input("Enter time in years: "))

CI = P * ((1 + R/100)**T) - P
print("Compound Interest = ", CI)

Experiment 3: Leap Year Check


Aim: Leap Year Check

Code:

year = int(input("Enter a year: "))

if (year % 4 == 0 and year % 100 != 0) or (year % 400 == 0):


print(year, "is a Leap Year")
else:
print(year, "is not a Leap Year")
Experiment 4: Fibonacci Number Check
Aim: Fibonacci Number Check

Code:

import math

def is_fibonacci(n):
return ([Link](5*n*n + 4)**2 == 5*n*n + 4) or ([Link](5*n*n - 4)**2 == 5*n*n - 4)

num = int(input("Enter a number: "))


if is_fibonacci(num):
print(num, "is a Fibonacci number")
else:
print(num, "is not a Fibonacci number")

Experiment 5: Matrix Multiplication


Aim: Matrix Multiplication

Code:

A = [[1, 2], [3, 4]]


B = [[5, 6], [7, 8]]
result = [[0, 0], [0, 0]]

for i in range(len(A)):
for j in range(len(B[0])):
for k in range(len(B)):
result[i][j] += A[i][k] * B[k][j]

print("Resultant Matrix:")
for r in result:
print(r)

Experiment 6: Average of Numbers


Aim: Average of Numbers

Code:

n = int(input("How many numbers? "))


total = 0
for i in range(n):
num = float(input("Enter number: "))
total += num

average = total / n
print("Average =", average)

Experiment 7: Palindrome Number Check


Aim: Palindrome Number Check

Code:

num = int(input("Enter a number: "))


reverse = int(str(num)[::-1])

if num == reverse:
print(num, "is a Palindrome number")
else:
print(num, "is not a Palindrome number")

Experiment 8: Prime Number Check


Aim: Prime Number Check

Code:

num = int(input("Enter a number: "))

if num > 1:
for i in range(2, int(num**0.5)+1):
if num % i == 0:
print(num, "is not a prime number")
break
else:
print(num, "is a prime number")
else:
print(num, "is not a prime number")

Experiment 9: Random Number Generator


Aim: Random Number Generator
Code:

import random
print("Random Number:", [Link](1, 100))

Experiment 10: Swap Two Variables


Aim: Swap Two Variables

Code:

a = int(input("Enter first number (a): "))


b = int(input("Enter second number (b): "))

a, b = b, a
print("After swapping: a =", a, ", b =", b)

Common questions

Powered by AI

Checking for prime numbers by testing divisibility by all integers up to the square root of the number accounts for non-prime numbers that are odd and avoiding redundant checks. Prime validation beyond divisible by 2 is significant as it ensures that numbers identified as prime are true primes, rather than incorrectly classified due to insufficient checks, which is crucial for applications requiring secure algorithms, such as cryptography .

Tuple unpacking simplifies the swap operation by allowing two variables to exchange values without needing an auxiliary variable. This reduces potential errors and makes the code more readable and concise. Additionally, Python handles this in a single operation internally, which can be slightly more efficient than the traditional three-step method involving a temporary variable .

A year is considered a leap year if it is divisible by 4, but not by 100, unless it is also divisible by 400. These conditions ensure that the average length of the year conforms closely to the actual orbit period of the Earth around the Sun. In programming, this ensures accurate date calculations and prevents errors in date-sensitive applications .

The benefit of using the built-in `random` module is that it allows for quick and easy generation of pseudo-random numbers with functions that are simple to implement in a variety of applications. However, its limitation lies in the fact that it produces pseudo-random numbers, which are not suitable for cryptographic purposes as they are deterministic and can be predicted if the seed is known .

The provided matrix multiplication algorithm has a computational complexity of \( O(n^3) \), as it involves three nested loops iterating over the elements of the matrices. Optimization can be achieved using Strassen's algorithm, which reduces the complexity to approximately \( O(n^{2.81}) \) by employing a divide-and-conquer approach, although for very large matrices further optimizations with more advanced techniques may be necessary .

The average is calculated by summing all numbers and dividing by the total count of numbers, \( \text{average} = \frac{\text{total}}{n} \). This arithmetic mean is a basic statistical measure representing the central tendency of a dataset, allowing for analysis of data by providing a single value that summarizes its central point, thereby facilitating easier comparison and interpretation of data .

The formula for simple interest is \( SI = \frac{P \times R \times T}{100} \), where the interest is calculated only on the initial principal over a set period. In contrast, compound interest is calculated using \( CI = P \times (1 + \frac{R}{100})^{T} - P \), where the interest is calculated on the initial principal and accumulated interest over previous periods, leading to exponential growth rather than linear. This results in a higher total interest when compared to simple interest over the same period and rate, capturing the effects of 'interest on interest' .

The palindrome number check algorithm uses the concept of reversing the digits and comparing them to the original number, utilizing the symmetry property of palindromes where the sequence is identical forwards and backwards. This method is effective because it directly evaluates the core property of palindromes, ensuring accuracy in detection without complex calculations or data structures .

Integer conversion is necessary to ensure that arithmetic operations and logical comparisons such as modulo operations are correctly executed, as these rely on discrete numeric values rather than floating-point approximations. This is crucial for checks involving leap years or Fibonacci numbers, where precise calculations are imperative to avoid erroneous results .

The algorithm checks if a number is a Fibonacci number by verifying if either \( 5n^2 + 4 \) or \( 5n^2 - 4 \) is a perfect square. This works because it is derived from properties of Fibonacci numbers in relation to certain quadratic equations. The mathematical validity arises from the fact that Fibonacci numbers can be represented by a specific form, and these conditions address that form .

You might also like