Python OOPE Exam

Let's solve your problem step by step!

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

📝 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! 🐍🚀

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.

🔄 Swap and Reverse Lines Program in Python Below is a Python program that reads multiple lines of input, swaps every two consecutive lines, and then reverses every odd-numbered line in the resulting output sequence. This meets the problem’s requirements exactly. 🛠️ Complete Code def main(): n = int(input()) lines = [input() for _ in range(n)] # Swap every two consecutive lines for i in range(0, n - 1, 2): lines[i], lines[i + 1] = lines[i + 1], lines[i] # Reverse every odd-numbered line in the output (1-based index) for i in range(n): if (i + 1) % 2 == 1: # odd line number lines[i] = lines[i][::-1] # Print the transformed lines for line in lines: print(line) if __name__ == "__main__": main() 📝 Explanation Input Reading: Read the integer n for the number of lines, then read each line into a list. Swapping Consecutive Lines: Iterate through the list in steps of two, swapping the pair at indices i and i+1. Reversing Odd-Numbered Lines: After swapping, reverse every odd line (1st, 3rd, 5th, …) by checking (i+1) % 2 == 1. Output: Print each line after these transformations. 🌟 Example Run Input:

🔎 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! 🐍💡

🔢 Function: Count Positive Integers (Ignore None) Let’s build an easy-to-use Python function! ✨ 🚩 Function Definition def count_positive_integers(lst): return sum(1 for x in lst if x is not None and isinstance(x, int) and x > 0) 📝 Step-by-Step Explanation Iterate through each element x in the list. Ignore None values (x is not None). Check if the value is an integer (isinstance(x, int)). Count only if the integer is positive (x > 0, so zero is ignored). Sum up the count (sum(1 for ...)). 🧪 Practice Questions Practice 1 lst = [4, -3, None, 7, 0, None, 10] print(count_positive_integers(lst)) # _______ Answer: 3 (Counts 4, 7, 10)

🔄 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: