Python OOPE Exam

Let's solve your problem step by step!

Let's create a fun Python program for your task! 😃

🔎 Function: Find Last Word Starting with Uppercase Here’s how you can implement the last_word_starts_with_upper_case function to find the last word in a sentence that starts with an uppercase letter. If no such word exists, it returns None. 🛠️ Function Definition def last_word_starts_with_upper_case(sentence: str): """ Find the last word in a sentence that starts with an uppercase letter. Args: sentence (str): The input sentence. Returns: str or None: The last word starting with an uppercase letter, or None if no such word exists. """ result = None for word in sentence.split(): if word and word[0].isupper(): result = word return result ✨ Step-by-Step Explanation Step 1: Split the sentence into individual words using split(). Step 2: Loop through each word: If the word starts with an uppercase letter (word.isupper()), save it as the current result. Step 3: After checking all words, return the last word found that met the criteria, or None if none did. 🚦 Example Usage print(last_word_starts_with_upper_case("This is a Test sentence")) # Output: "Test" print(last_word_starts_with_upper_case("no uppercase words here")) # Output: None 📝 Practice Questions What will last_word_starts_with_upper_case("Alice and Bob went to Paris") return? Try last_word_starts_with_upper_case("all lowercase words"). What is the result of last_word_starts_with_upper_case("Python Is Easy To Learn")? ✅ Solutions "Paris" None "Learn" With this function, you can quickly scan sentences for the last word that begins with a capital letter. Perfect for text analysis and simple parsing tasks! 🐍💡

🔄 Sum and Absolute Difference Alternately Let’s solve the problem step by step and make the code easy-to-follow with emojis, practice questions, and explanations! 🚀 📝 Full Python Code n = int(input()) for i in range(n): line = input().strip() # Split by comma and convert to integers a, b = map(int, line.split(',')) if i % 2 == 0: # Odd-numbered pair (1-based): print sum print(a + b) else: # Even-numbered pair (1-based): print absolute difference print(abs(a - b)) 🔍 Step-by-Step Explanation Read the number of pairs: The first input line is the integer n. Process each pair: For every line, read two comma-separated integers. Odd pair (1st, 3rd, 5th…): Print their sum. Even pair (2nd, 4th, 6th…): Print the absolute difference. Print the results one per line. 🧪 Practice Questions (with Solutions!) Practice 1 Input:

Check if a Number is Divisible by Exactly One of the Given NumbersWrite a function div_by_exactly_one that takes three integers num, a, and b. The function should return True if num is divisible by exactly one of the numbers a or b, and False otherwise. NOTE: This is a function type question, you don’t have to take input or print the output, just have to complete the required function definition.

🧮 Function: is_positive_odd_or_negative_even Let’s build a Python function that checks if a number is either a positive odd or a negative even. 🎯 🚩 Function Definition def is_positive_odd_or_negative_even(n): # Check for positive odd OR negative even return (n > 0 and n % 2 == 1) or (n < 0 and n % 2 == 0) 📝 Step-by-Step Explanation Positive Odd Number: Condition: n > 0 and n % 2 == 1 Checks if the number is positive AND odd. Negative Even Number: Condition: n < 0 and n % 2 == 0 Checks if the number is negative AND even. Logical OR: The function returns True if any one of the above conditions is met. 🧪 Practice Questions Practice 1 print(is_positive_odd_or_negative_even(7)) # _______ 7 is positive and odd. Output: True Practice 2 print(is_positive_odd_or_negative_even(-4)) # _______ -4 is negative and even. Output: True Practice 3 print(is_positive_odd_or_negative_even(-3)) # _______ -3 is negative and odd. Output: False Practice 4 print(is_positive_odd_or_negative_even(8)) # _______ 8 is positive and even. Output: False Practice 5 print(is_positive_odd_or_negative_even(0)) # _______ 0 is neither positive nor negative (and it’s even). Output: False ✨ Key Points Odd number: Remainder when divided by 2 is 1 (n % 2 == 1). Even number: Remainder when divided by 2 is 0 (n % 2 == 0). Positive Odd or Negative Even: Only one of these is needed for True. Zero case: 0 is not positive or negative, so always returns False. Happy Coding! 🚀

📝 Function: Replace Middle Element with n Copies Let’s build a helpful Python function that replaces the middle element of a tuple with n copies of itself! 🧑‍💻✨ 🚩 Function Definition def replace_middle_with_n_copies(t, n): # Find the middle index mid = len(t) // 2 # Create a tuple with 'n' copies of the middle element middle_replacement = (t[mid],) * n # Build the new tuple: before + replacement + after return t[:mid] + middle_replacement + t[mid+1:] 🔍 Step-by-Step Explanation Find the Middle Index Since the tuple has odd length, the middle index is len(t) // 2. Create Replacement (t[mid],) * n makes n copies of the middle element as a tuple. Assemble the Result Use slicing: t[:mid] (elements before the middle), middle_replacement, and t[mid+1:] (elements after the middle). 🤔 Practice Questions Practice 1 t = (1, 2, 3, 4, 5) n = 3 print(replace_middle_with_n_copies(t, n)) # What do you expect? Middle element: 3 Should be replaced by (3, 3, 3) Result: (1, 2, 3, 3, 3, 4, 5) Practice 2 t = ('a', 'b', 'c') n = 2 print(replace_middle_with_n_copies(t, n)) Middle element: 'b' Result: ('a', 'b', 'b', 'c') Practice 3 t = (10,) n = 4 print(replace_middle_with_n_copies(t, n)) Single element tuple: replace with 4 copies of itself. Result: (10, 10, 10, 10) ✨ Tips Tuples are immutable: You can’t change them; instead, create and return a new tuple. Odd length guaranteed: No need to check for even-length inputs. Works for any tuple type: numbers, strings, or mixed! Happy Python-ing! 🐍🚀

✨ Print “X” Pattern Program Let’s write a Python program that prints an “X” shaped pattern using backslashes (\), forward slashes (/), and a lowercase x in the center! 😃 📋 Problem Description Input: An integer n (n >= 0) Output: An “X” shape with a center "x" and n identical rows above and below, built with slashes. No extra spaces to the right of the pattern. 🧑‍💻 Full Python Code n = int(input()) # Print the top part for i in range(n): # i spaces, then '\', then (2*n - 2*i - 1) spaces, then '/' left_spaces = ' ' * i middle_spaces = ' ' * (2 * n - 2 * i - 1) print(left_spaces + '\\' + middle_spaces + '/') # Print the central x print(' ' * n + 'x') # Print the bottom part (mirror of above) for i in range(n-1, -1, -1): left_spaces = ' ' * i middle_spaces = ' ' * (2 * n - 2 * i - 1) print(left_spaces + '/' + middle_spaces + '\\') 🔍 Step-by-Step Explanation Top Rows: For each row i from 0 to n-1: Print i spaces. Print a backslash (\). Print (2*n - 2*i - 1) spaces (between slashes). Print a forward slash (/). Central Row: Print n spaces, then the character 'x'. Bottom Rows: Repeat in reverse for i from n-1 to 0: Print i spaces. Print a forward slash (/). Print (2*n - 2*i - 1) spaces. Print a backslash (\). No trailing spaces are added to the right of the pattern. 🧪 Practice Examples Example 1 Input: