Scribd
Upload
3 views

Assignment2 - Copy

Uploaded by

yenesewzenebe163
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Assignment2 - Copy

Uploaded by

yenesewzenebe163
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

ADDIS ABABA UNIVERSITY

AAIT

COMPUTER PROGRAMING
INDIVIDUAL ASSIGNMENT III

NAME: Mulugeta Yawkal


ID: UGR/8469/16
SECTION: 14
Submitted to: Teacher Kinde Mekuria

Submitted date: July 3, 2024


1, ’False’ Is a string and false is boolean

2,

def check_even_or_odd(number):

if number % 2 == 0:

print(f"{number} is an even number.")

else:

print(f"{number} is an odd number.")

user_value = 21

check_even_or_odd(user_value)

3,a,

def get_sum_of_digits(number):

total = 0

while number != 0:

digit = number % 10

total += digit

number //= 10

return total

num_to_check = 12345

print(f"Sum of digits for {num_to_check}:


{get_sum_of_digits(num_to_check)}")

b,

def reverse_number(number):

reversed_num = 0

while number != 0:

digit = number % 10

reversed_num = reversed_num * 10 + digit

number //= 10
return reversed_num

num_to_reverse = 12345

print(f"Reversed number for {num_to_reverse}:


{reverse_number(num_to_reverse)}")

c,

def is_palindrome(number):

return str(number) == str(number)[::-1]

num_to_check = 12321

if is_palindrome(num_to_check):

print(f"{num_to_check} is a palindrome.")
else:
print(f"{num_to_check} is not a palindrome.")
4,

def check_prime_number(number):

if number > 1:

for i in range(2, (number // 2) + 1):

if (number % i) == 0:

print(f"Given number {number} is not prime.")

break

else:

print(f"Given number {number} is a prime number.")

else:

print(f"Given number {number} is not prime.")

num_to_check = 2

check_prime_number(num_to_check)

5,

2
6,

Too hot

Just right

7,

200

8,

Infinite Loop

9,

-1

10

[20, 17, 14]

11, a,

11, b, six times

12

L = [4, 9, 1, 8, 5, 7, 10, 3]

count = sum(L)

avg = count / len(L)

print("Sum =", count)


print("Average =", avg)

13.

Test

Tes

Te

14.

def add_sum(n):

if n == 1:

return 1

else:

return n + add_sum(n-1)

x = add_sum(5)

print(x)

15.

def power(x, y):

if y == 0:

return 1

else:

return x * power(x, y-1)

x = power(2,3)

print(x)

16.

def gcd(x, y):

if y == 0:

return x

else:
return gcd(y, x%y)

z = gcd(5,10)

print(z)

17.

def countdown_by_n(count_from, count_by):

while count_from >= 0:

print(count_from)

count_from -= count_by

countdown_by_n(10, 2)

18. The lines would be executed in the following order: 10, 1, 2, 3, 6, 1, 2, 3,


4, 10.

19.

def near_and_far(a, b, c):

cond1 = abs(a - b) <= 1 and abs(b - c) >= 2 and abs(a - c) >= 2

cond2 = abs(a - c) <= 1 and abs(a - b) >= 2 and abs(c - b) >= 2

return cond1 or cond2

result = near_and_far(2, 3, 4)

print(result)

20,

def next_product(n):

if n == 1:

return 2

else:

return next_product(n - 1) * 3**(n - 1)

n=5

result = next_product(n)

print(f"The {n}th term of the sequence is: {result}")


21.

def reverse(s):

if s == "":

return s

else:

return reverse(s[1:]) + s[0]

# Example usage:

result = reverse("python")

print(result) # Should print "nohtyp"

You might also like