CS File
CS File
Science
Project File
Session 2023-
24
Class 11 Sci
Th
By Siddharth Rana 28
print("Welcome")
Code : Output:
Pattern 2 :
Code : Output:
Pattern 3 :
Code : Output:
def is_perfect_number(num):
divisors_sum = sum([i for i in range(1, num) if num % i == 0])
return divisors_sum == num
def is_armstrong_number(num):
num_str = str(num)
n = len(num_str)
armstrong_sum = sum(int(digit) ** n for digit in num_str)
return armstrong_sum == num
def is_palindrome(num):
num_str = str(num)
return num_str == num_str[::-1]
if is_perfect_number(number):
print(f"{number} is a Perfect Number.")
elif is_armstrong_number(number):
print(f"{number} is an Armstrong Number.")
elif is_palindrome(number):
print(f"{number} is a Palindrome.")
else:
print(f"{number} is neither a Perfect Number nor an Armstrong Number nor a
Palindrome.")
def is_prime(num):
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True
if is_prime(number):
print(f"{number} is a Prime Number.")
else:
print(f"{number} is a Composite Number.")
def fibonacci_series(n):
fib_series = [0, 1]
num_terms = int(input("Enter the number of terms for the Fibonacci series: "))
result = fibonacci_series(num_terms)
print(f"Fibonacci series up to {num_terms} terms: {result}")
Code :
Output:
Code :
Output:
def count_characters(string):
vowels = "AEIOUaeiou"
consonants = "BCDFGHJKLMNPQRSTVWXYZbcdfghjklmnpqrstvwxyz"
vowel_count = 0
consonant_count = 0
uppercase_count = 0
lowercase_count = 0
if char.isupper():
uppercase_count += 1
elif char.islower():
lowercase_count += 1
def is_palindrome(string):
clean_string = ''.join(string.split()).lower()
return clean_string == clean_string[::-1]
def convert_case(string):
return string.swapcase()
if is_palindrome(input_string):
print("The entered string is a palindrome.")
else:
print("The entered string is not a palindrome.")
converted_string = convert_case(input_string)
print(f"String after case conversion: {converted_string}")
Code :
Output:
largest_number = max(numbers_list)
smallest_number = min(numbers_list)
Tuple :
Code :
Output:
largest_number = max(numbers_tuple)
smallest_number = min(numbers_tuple)
Code :
Output:
List :
Code :
Output:
if search_element in elements_list:
print(f"{search_element} found in the list.")
else:
print(f"{search_element} not found in the list.")
Tuple :
Code :
Output:
if search_element in elements_tuple:
print(f"{search_element} found in the tuple.")
else:
print(f"{search_element} not found in the tuple.")
Code :
Output:
Code :
Output:
Code:
Output :
Code:
def calculate_income_tax(income):
tax_rate = 20
income_tax = income * tax_rate / 100
return income_tax
Output:
Code:
Output:
states_capitals = {
"California": "Sacramento",
"Texas": "Austin",
"New York": "Albany",
}
Code :
students_dict = {
"John": [90, 85, 92, 88, 95],
"Emma": [78, 89, 92, 80, 85],
"Alex": [95, 92, 88, 78, 86],
}
Output :