recursion

Which X and Y cause the program to print the final velocity in feet per second? Note that the distance and initial_velocity are given using meters instead of feet. def final_velocity(initial_velocity, distance, time):return 2 * distance / time - initial_velocitydef meters_to_feet(distance_in_meters):return 3.28084 * distance_in_meters# display final velocity in feet per secondt = 35 # secondsd = 7.2 # metersv_i = 4.6 # meters / secondprint(f'Final velocity: {final_velocity(X, Y, t):f} feet/s')

X = v_i, Y = d X = meters_to_feet(v_i), Y = d

An indent variable _____ number of spaces on each iteration.

adds equal

Function calc_sum() was copied and modified to form the new function calc_product(). Which line of the new function contains an error? def calc_sum(a, b):s = a + breturn sdef calc_product(a, b): # Line 1p = a * b # Line 2return s # Line 3

line 3

What is output if the code is executed to search for the letter 'A'? def Find(list, ele, low, high): if high >= low: mid = (high + low)//2if list[mid] == ele: return mid elif list[mid] > ele: return Find(list, ele, low, mid-1) else: return Find(list, ele, mid + 1, high) else: return -1listOfLetters = ['B', 'C', 'D', 'E', 'F', 'G', 'H']result = Find(listOfLetters,'A',0,(len(listOfLetters)-1))print(result)

-1

What is output? def sub(i,j): if(i==0): return j else: return sub(i-1,j-i) print(sub(4,10))

-3 Infinite loop

What is output? def test(n):if n == 0:return 0elif n == 1:return 1else:return test(n-1)+test(n-2)for i in range(0,4):print(test(i),end=' ')

0 1 1 2

Given the following function. To change the function to return the product instead of the sum, how many lines of code need to be changed? def calculate(a, b):return a + bprint(calculate(3, 4))print(calculate(5, 2))print(calculate(6, 7))

1

How many times is the function Info() called if the user enters 0 and 1 in the first attempt? def Info(num1, num2):if (num1 == 0) or (num1 == 1):print('Passed round 1.')if (num2 == 1) or (num2 == 0):print('Passed round 2.')print('Good. You know your binary digits!')else:print('Numbers can be only 0s or 1s...Enter again')arg1 = int(input())arg2 = int(input())Info(arg1, arg2) else: print('Numbers can be only 0s or 1s...Enter again')arg1 = int(input())arg2 = int(input())Info(arg1, arg2)print('Enter 2 numbers used in binary notation')user_val1 = int(input())user_val2 = int(input())Info(user_val1, user_val2)

1

How many iterations are needed for the function to find 12? def Find(list, ele, low, high): if high >= low: mid = (high + low)//2if list[mid] == ele: return mid elif list[mid] > ele: return Find(list, ele, low, mid-1) else: return Find(list, ele, mid + 1, high) else: return -1listOfNumbers = [11, 12, 13, 15, 18]result = Find(listOfNumbers,12,0,(len(listOfNumbers)-1))print(result)

2

What is the output? LB_PER_KG = 2.2def kgs_to_lbs(kilograms):pounds = kilograms * LB_PER_KGreturn poundspounds = kgs_to_lbs(10)print(pounds)

22

How many times is the function count_down() called in the below code? def count_down(count):if count == 1: print('Terminated..!') else: print(count) count_down(count-1) count_down(5)

5

What is output? def divide_by_two(count):if count == 1: print('Terminated..!') else: print(count) divide_by_two(count/2) divide_by_two(9)

9 4.5 2.25 Terminated..! 9 4.5 2.25 1.125 Terminated..!

Which is the best way to debug recursive functions?

Adding output statements with an indent to print statements at every iteration.

What is the role of sys.getrecursionlimit()?

It measures the maximum depth of the function.

Which line in the function print_greeting() must be changed if the user wishes to print the greeting three times with three different names? def print_greeting(name):print('Welcome message:')print('Greetings', name)

None

What is the output? def print_water_temp_for_coffee(temp):if temp < 195:print('Too cold.')elif (temp >= 195) and (temp <= 205):print('Perfect temperature.')elif (temp > 205):print('Too hot.')print_water_temp_for_coffee(205)print_water_temp_for_coffee(190)

Perfect temperature. Too cold.

What is the output of the following code if the user enters -1 and 6? def Greater(num1, num2):if (num1 >= num2):print('Number 1 is greater')else:print('Number 2 is greater')def Info(num1, num2):if (num1 < = 0):print('Number 1 cannot be less than or equal to 0...Enter the number again')arg1 = int(input())arg2 = num2Info(arg1, arg2)elif (num2 <= 0):print('Number 2 cannot be less than or equal to 0...Enter the number again')arg2 = int(input())arg1 = num1Info(arg1, arg2)else: Greater(num1, num2)print('Enter any 2 numbers')user_val1 = int(input())user_val2 = int(input())Info(user_val1, user_val2)

The programs asks the user to enter the first number again

Which of the following is a good candidate for using recursive functions?

To solve the greatest common divisor (GCD) problem

cone_vol = cone_volume(2, 4) print(cone_vol)def compute_square(r):return r * rdef cone_volume(r, h):return (0.33) * 3.14 * compute_square(r) * h

Undefined function cone_volume()

What is the output of scramble('ab', '') in the following code? def scramble(r_letters, s_letters):if len(r_letters) == 0:print(s_letters)else:for i in range(len(r_letters)):scramble_letter = r_letters[i]remaining_letters = r_letters[:i] + r_letters[i+1:]scramble(remaining_letters, s_letters + scramble_letter)scramble('ab','')

ab ba

Which code calculates the power of a number raised to another (a^b)?

def power(a,b): if b == 1: return a else: return a*power(a,b-1)

Which variable can be used in place of XXX in the following code? def fahrenheit_to_celsius(f):fraction = 5 / 9c = (f - 32) * fractionreturn cdegrees = float(input('Enter degrees in Fahrenheit: '))print(fahrenheit_to_celsius(XXX))

degrees

In Python, a namespace is which type of data structure?

dictionary

Assume that there is a recursive binary search function find(). If a sorted list has a data structure with indices 0 to 50 and the item being searched for happens to be at location 6, write each call of find() that would occur while searching for that item. The first is find(0,50).

find(0, 25) find(0, 12)

After a function's last statement is executed, the program returns to the next line after the _____.

function call

What code replaces XXX to make the program output the number 10? multiplier = 1def do_multiplication(x):return x * multiplierdef set_multiplier(x):XXXmultiplier = xuser_value = 5set_multplier(2)print(do_multiplication(user_value))

global multiplier

Define a base condition to find the sum of arithmetic progression of the function. def arith_sum(a1, diff, nth):XXX return 0else:return a1 + arith_sum(a1 + diff, diff, nth-1)

if nth == 0

_____ objects have fixed values that can't be changed

immutable

While adding output statements to debug recursive functions, _____ the print statements to show the current depth of recursion.

indent

Which line of the function has an error? def compute_sum_of_squares(num1, num2): # Line 1sum = (num1 * num1) + (num2 * num2) # Line 2return # Line 3

line 3

Which XXX completes the find function? def Find(list, ele, low, high): if high >= low: XXX if list[mid] == ele: return mid elif list[mid] > ele: return Find(list, ele, low, mid-1) else: return Find(list, ele, mid + 1, high) else: return -1

mid = low + (high - low) // 2

A traveller starts his journey from Chicago and travels to Los Angeles, New York, California, and Florida. Which XXX is the best recursive exploration method to find the distance the traveller travelled? def distance_travel(curr_path, need_to_visit):if len(curr_path) == num_cities:total_distance = 0for i in range(len(curr_path)):print(city_names[curr_path[i]], ' ', end=' ')if i > 0:total_distance += distances[curr_path[i-1]][curr_path[i]]print('=', total_distance)else:for i in range(len(need_to_visit)):city = need_to_visit[i]XXXneed_to_visit.insert(i, city)curr_path.pop()

need_to_visit.pop(i)curr_path.append(city)distance_travel(curr_path, need_to_visit)

Recursive exploration does not explore _____.

only one possible choice

In the following code, the variable size is the function's _____. def calc_square_area(size):area = size * sizereturn areaval = float(input('Enter size of square: '))square_area = calc_square_area(val)print(f'A square of size {val} has area {square_area}')

parameter

How many times is the recursive function find() called when searching for the missing letter 'A' in the below code? def find(lst, item, low, high):range_size = (high - low) + 1mid = (high + low) // 2if item == lst[mid]:pos = midelif range_size == 1:pos = -1else:if item < lst[mid]:pos = find(lst, item, low, mid)else: pos = find(lst, item, mid+1, high)return poslistOfLetters = ['B', 'C', 'D', 'E', 'F', 'G', 'H']print(find(listOfLetters, 'A', 0, 6))

program gets into an infinite loop

Which function call will produce an error? def purchase(user_name, id_number=-1, item_name='None', quantity=0):# ... process a user's purchase as required ...

purchase(item_name='Orange', user_name='Leia')

Identify the error in the code that scrambles a word's letters in all the possible ways.. def scramble(r_letters, s_letters):if len(r_letters) == 0:print(s_letters)else:for i in range(len(r_letters)):scramble_letter = r_letters[i]remaining_letters = r_letters[:i] + r_letters[i-1:]scramble(remaining_letters, s_letters + scramble_letter)scramble('abc','')

remaining_letters = r_letters[:i] + r_letters[i-1:]

Complete the code to get a factorial of a number. def factorial(number):if number == 0: return 1else:XXXprint(factorial(4))

return number*factorial(number-1)

Which XXX completes the find_smallest() function? def find_smallest(a, b, c):if a <= b and a <= c:smallest = aelif b <= a and b <= c: smallest = belif c <= a and c <= b:smallest = cXXXresult = find_smallest(7, 4, 8)print(result)

return smallest

A base case is a _____.

return statement that stops the recursion

Which condition is the recursive case for sum of the first n natural numbers? def nsum(n):

sum = n + nsum(n-1)

Which statement uses the square() function to assign the variable t with 16? Note that 16 = 2⁴ = (2²)² def calc_square(x):return x * x

t = calc_square(calc_square(2))

If the base condition is not defined in the recursive function, _____.

the program gets into an infinite loop