for_students

def palindrome(s):

return s == s[::-1]

print(palindrome("level"))

print(palindrome("world"))

• True, True

• True, False

• False, True

• False, False

def find_max(lst):

if not lst:

return None

max_value = lst[0]

for num in lst:

if num > max_value:

max_value = num

return max_value

print(find_max([3, 1, 4, 2, 5]))

print(find_max([]))

• • 5, None

• 3, Error

• 4, 0

• None, None

def countdown(n):

if n <= 0:

return []

return [n] + countdown(n - 1)

print(countdown(3))

• [3, 2, 1]

• [3, 2, 1, 0]

• [0, 1, 2, 3]

• Error

def reverse_list(lst):

return lst[::-1]

print(reverse_list([1, 2, 3, 4, 5]))

• [1, 2, 3, 4, 5]

• error

• [5, 4, 3, 2, 1]

• [5, 3, 1]

def square_numbers(lst):

return [x**2 for x in lst if x % 2 != 0]

print(square_odd_numbers([1, 2, 3, 4, 5]))

• [1, 4, 9, 16, 25]

• Error

• [2, 4]

• [1, 9, 25]

def factorial(n):

if n < 0:

return "Undefined"

if n == 0 or n == 1:

return 1

return n * factorial(n - 1)

print(factorial(5))

print(factorial(-1))

• 120, Error

• 120, Undefined

• 1, Undefined

• 0, Undefined

def square(n):

return n * n

def process_list(lst):

return [square(x) for x in lst]

print(process_list([1, 2, 3, 4]))

• [1, 2, 3, 4]

• [1, 4, 9, 16]

• [1, 8, 9, 16]

• Error

def is_prime(n):

if n <= 1:

return False

for i in range(2, int(n ** 0.5) + 1):

if n % i == 0:

return False

return True

print(is_prime(11))

print(is_prime(12))

• True, True

• True, False

• False, True

• False, False

def is_anagram(str1, str2):

return sorted(str1) == sorted(str2)

print(is_anagram("listen", "silent"))

print(is_anagram("hello", "world"))

• True, True

• True, False

• False, True

• False, False

def fibonacci(n):

fib = [0, 1]

for i in range(2, n):

fib.append(fib[-1] + fib[-2])

return fib

print(fibonacci(6))

• [0, 1, 1, 2, 3, 5]

• [0, 1, 2, 3, 5, 8]

• [0, 1, 2, 3, 6, 8]

• Error