Python OOPE Exam

Let's solve your problem step by step!

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

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

def print_n_pattern(n): """ Prints an "N" shaped pattern with n rows. The pattern has vertical bars (|) on the left and right sides of each row, with a backslash (\) moving diagonally from the top-left to the bottom-right. There are no spaces to the right of the pattern. Args: n (int): The number of rows for the pattern (n > 0). """ for i in range(n): # Start each row with a vertical bar row = "|" # Add leading spaces before the diagonal backslash # The number of leading spaces is equal to the current row index 'i' row += " " * i # Add the diagonal backslash row += "\\" # Add trailing spaces after the diagonal backslash # The total width of the inner part (between vertical bars) is (n - 1) characters. # So, the number of trailing spaces is (n - 1) - i row += " " * (n - 1 - i) # End each row with a vertical bar row += "|" # Print the constructed row print(row) if __name__ == "__main__": try: # Read the integer input from the user n = int(input()) # Validate the input: n must be greater than 0 if n <= 0: print("Input 'n' must be a positive integer (n > 0).") else: # Call the function to print the pattern print_n_pattern(n) except ValueError: # Handle cases where the input is not a valid integer print("Invalid input. Please enter a single integer.")

🔄 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: within_and_has_double_quotes Let’s build a Python function to check if a string: Starts and ends with double quotes (") Has at least one double quote somewhere inside (not including the first and last characters) 🧑‍💻 Function Implementation def within_and_has_double_quotes(s): # Check if string has at least 2 characters and starts/ends with a double quote if len(s) < 2 or s[0] != '"' or s[-1] != '"': return False # Check for another double quote in the interior (exclude first/last char) return '"' in s[1:-1] 🔍 Step-by-Step Explanation Check the boundary quotes: The string must be at least 2 characters. The first character is " and the last character is ". Check for an internal quote: Use s[1:-1] to get the inner part of the string (excluding first and last characters). Test if " exists in this interior slice. 🧪 Practice Questions Practice 1 print(within_and_has_double_quotes('"hello"')) # _______ Interior: hello (no quotes) Output: False Practice 2 print(within_and_has_double_quotes('"he"llo"')) # _______ Interior: he"llo Yes, has an interior double quote! Output: True Practice 3 print(within_and_has_double_quotes('""')) # _______ Interior: empty string "" Output: False Practice 4 print(within_and_has_double_quotes('"a"b"c"')) # _______ Interior: a"b"c Yes, contains double quotes inside! Output: True Practice 5 print(within_and_has_double_quotes('"no inner quote')) # _______ No ending double quote. Output: False ✅ Key Points Checks boundaries (" at both ends) Looks inside (middle of string) for at least one more double quote Returns True only if both conditions are met Happy Coding! 🚀

🧮 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! 🚀