Functions and Lists Mixed-Up Code Questions

Section 5.31 Functions and Lists Mixed-Up Code Questions

Checkpoint 5.31.1.

Create a function called second_half that takes in lst as a parameter and returns the second half of lst. For example, second_half([1]) should return [1], second_half([1, 2, 3]) should return [2, 3], and second_half([1, 2, 3, 4]) should return [3, 4].

def second_half(lst):
---
    return lst[(len(lst) // 2):]
---
    return lst[(len(lst) / 2):]  #paired
---
    return lst[(len(lst) / 2):-1] 
---
    return lst[(len(lst) // 2):(len(lst) - 1)]  #paired
---
    return lst[(len(lst) % 2):len(lst)]

Checkpoint 5.31.2.

Create a function called sum_of_split_num that takes in str_num_with_hyphens as a parameter and returns the sum of the integers that are split up by hyphens. For example, sum_of_split_num('978-876-4908') should return 6762 because 978 + 876 + 4908 = 6762. (Note: Integers are 0 or greater.)

def sum_of_split_num(str_num_with_hyphens):
---
    num_without_hyphens = str_num_with_hyphens.split('-')
---
    num_without_hyphens = str_num_with_hyphens.split()  #paired
---
    map_object_to_ints = map(int, num_without_hyphens)
---
    lst_of_ints = list(map_object_to_ints)
---
    return sum(lst_of_ints)
---
    return sum(lst_of_ints) / 2  #paired
---
    return lst_of_ints.sum()

Checkpoint 5.31.3.

Create a function called sort_descending that takes in lst_of_nums as a parameter and returns lst_of_nums in descending order. For example, sort_descending([100, 2000, -50]) should return [2000, 100, -50].

def sort_descending(lst_of_nums):
---
    lst_of_nums.sort(reverse=True)
---
    lst_of_nums.sort(reverse=False)  #paired
---
    lst_of_nums.sort() 
---
    lst_of_nums = lst_of_nums.sort(reverse=True)  #paired
---
    return lst_of_nums
---
    return sorted(lst_of_nums, reverse=False)  #paired
---
    return sorted(lst_of_nums) 
---
    return lst_of_nums.sort(reverse=True)  #paired

Checkpoint 5.31.4.

Create a function called extend_two_lists_sort that takes in lst1 and lst2 as parameters, sorts both lists, and extends lst1 with lst2. For example, extend_two_lists_sort(['string', 'hello'], ['my', 'goodness']) should return ['hello', 'string', 'goodness', 'my'].

def extend_two_lists_sort(lst1, lst2):
---
    lst1.sort()
---
    sorted(lst1)  #paired
---
    lst2.sort()
---
    sorted(lst2)  #paired
---
    lst1.extend(lst2)
---
    lst1.append(lst2)  #paired
---
    return lst1
---
    return lst1.extend(lst2)  #paired
---
    return lst1.extend(lst2).sort() 
---
    return sorted(lst1.extend(lst2))  #paired

Checkpoint 5.31.5.

Create a function called sort_and_get_median_num that takes in lst_of_nums as a parameter, sorts lst_of_nums, and returns the median of lst_of_nums. For example, sort_and_get_median_num([200, -5, 0, 75, 80, 60]) should return 67.5, and sort_and_get_median_num([200, -5, 0, 75, 80]) should return 75.

def sort_and_get_median_num(lst_of_nums):
---
    lst_of_nums.sort()
---
    if len(lst_of_nums) % 2 == 1:
---
        return lst_of_nums[len(lst_of_nums) // 2]
---
        return lst_of_nums[len(lst_of_nums) / 2]  #paired
---
    else:
---
        sum_of_middle_two_nums = sum(lst_of_nums[len(lst_of_nums) // 2 - 1: len(lst_of_nums) // 2 + 1])
---
        sum_of_middle_two_nums = sum(lst_of_nums[len(lst_of_nums) // 2: len(lst_of_nums) // 2 + 2])  #paired
---
        sum_of_middle_two_nums = sum(lst_of_nums[len(lst_of_nums) // 2 - 2: len(lst_of_nums) // 2]) 
---
        sum_of_middle_two_nums = sum(lst_of_nums[len(lst_of_nums) / 2 - 1: len(lst_of_nums) / 2 + 1])  #paired
---
        mean_of_two_nums = sum_of_middle_two_nums / 2
---
        mean_of_two_nums = sum_of_middle_two_nums // 2  #paired
---
        return mean_of_two_nums

Python for Everyone: The PreTeXt Interactive Edition