sypython pr11 to p20
sypython pr11 to p20
or not.
num = int(input("Enter a number: "))
original_num = num
reversed_num = 0
while num > 0:
digit = num % 10
reversed_num = reversed_num * 10 + digit
num //= 10
if original_num == reversed_num:
print("Number is a palindrome.")
else:
print("Number is not a palindrome.")
output:
num += 1
output:
13
17
19
23
29
Practical: 13 Write a program to search an element in the list using for loop and
also demonstrate the use of “else” with for loop.
my_list = [5, 10, 15, 20, 25, 30]
search_element = int(input("Enter the element to search: "))
for item in my_list:
if item == search_element:
print("Element found in the list.")
break
else:
print("Element are not found in the list.")
output:
if sum_of_powers == original_num:
print(f"{original_num} is an Armstrong number.")
else:
ouput:
output:
arr.append(60)
print("After append:", arr)
arr.insert(2, 25)
print("After insert:", arr)
arr.remove(40)
print("After remove:", arr)
popped_element = arr.pop()
print("After pop():", arr)
print("Popped element:", popped_element)
index_of_30 = arr.index(30)
arr_list = arr.tolist()
print("Array as list:", arr_list)
count_of_20 = arr.count(20)
print("Count of 20:", count_of_20)
output:
After append: array('i', [10, 20, 20, 30, 40, 50, 60])
After insert: array('i', [10, 20, 25, 20, 30, 40, 50, 60])
After remove: array('i', [10, 20, 25, 20, 30, 50, 60])
Popped element: 60
Index of 30: 4
Count of 20: 2
ascending_order = sorted(numbers)
print("Numbers in Ascending Order:", ascending_order)
output:
python p17.py
Enter 10 numbers:
Enter number 1: 12
Enter number 3: 11
Enter number 4: 34
Enter number 5: 56
Enter number 6: 32
Enter number 7: 11
Enter number 8: 65
Enter number 9: 75
Numbers in Ascending Order: [11, 11, 12, 23, 32, 33, 34, 56, 65, 75]
Numbers in Descending Order: [75, 65, 56, 34, 33, 32, 23, 12, 11, 11]
duplicates = []
for i in range(len(arr)):
if arr[i] not in duplicates and arr.count(arr[i]) > 1:
duplicates.append(arr[i])
print("Duplicate elements:", duplicates)
output:
Output:
Output: