Python Programming: An Introduction to Computer Science, 3rd Ed.
3rd Edition
ISBN: 9781590282755
Author: John Zelle
Publisher: Franklin, Beedle & Associates
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 7PE
Program Plan Intro
Computing inner product
- Define the main function.
- Create two lists of same length with some values.
- Declare a variable “sum”.
- Loop through the length of the list.
- Calculate the product of the two list and store it in the variable “x”.
- Calculate sum value and store it in the variable “sum”.
- Print the result.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths.
The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned.
For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"].
HINT: Python has a built-in function min() which is helpful here.
Initialize accumulator variable newlist to be an empty list
Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths
Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration).
AFTER the loop…
Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed.
Recursive Max!
Write a recursive function rc_max(L:List[int]) -> int that takes a list L and returns an
element with highest value in the list. For example, rc_max([1,2,3]) returns 3. Note that L is
not necessarily sorted. You may assume that the input L is not empty.
You cannot use the built-in max()
Your Answer:
1 # Put your answer here
2
Submit
Chapter 11 Solutions
Python Programming: An Introduction to Computer Science, 3rd Ed.
Ch. 11 - Prob. 1TFCh. 11 - Prob. 2TFCh. 11 - Prob. 3TFCh. 11 - Prob. 4TFCh. 11 - Prob. 5TFCh. 11 - Prob. 6TFCh. 11 - Prob. 7TFCh. 11 - Prob. 8TFCh. 11 - Prob. 9TFCh. 11 - Prob. 1MC
Ch. 11 - Prob. 2MCCh. 11 - Prob. 3MCCh. 11 - Prob. 4MCCh. 11 - Prob. 5MCCh. 11 - Prob. 6MCCh. 11 - Prob. 7MCCh. 11 - Prob. 8MCCh. 11 - Prob. 9MCCh. 11 - Prob. 10MCCh. 11 - Prob. 1DCh. 11 - Prob. 2DCh. 11 - Prob. 1PECh. 11 - Prob. 2PECh. 11 - Prob. 3PECh. 11 - Prob. 5PECh. 11 - Prob. 6PECh. 11 - Prob. 7PECh. 11 - Prob. 8PECh. 11 - Prob. 9PECh. 11 - Prob. 10PECh. 11 - Prob. 11PECh. 11 - Prob. 12PECh. 11 - Prob. 15PECh. 11 - Prob. 16PECh. 11 - Prob. 18PECh. 11 - Prob. 19PE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a function find_max_tuple() that gets a list of tuples as parameter, finds and returns the tuple with maximum sum inside the list. Write Python statements that create a sample list that has tuples inside (you can use the list of tuples in the sample run below), then use find_max_tuple() function to get the tuple with maximum sum and print it. Sample tuples=[(3,4,360,6),(1,2),(12,),(132,244,64),(72,71,70)] The maximum tuple is (132,244,64)arrow_forwardPlease answer it in Python Write a function min_odd that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. For Example : min_odd([45, 62, 19, 22, 26, 18, 3, 5, 14])Expected answer is 14 min_odd([])Expected answer is None Write a function index_of that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. For Example: index_of(34, [3, 67, 62, 34, 19, 24])Expected answer is 3 index_of(16, [2, 6, 104, 5, 25, 18, 50, 16])Expected answer is 7arrow_forwardAsk the user to enter a series of integers, and store these numbers into a linked list. The user can enter as many numbers as she like, so your program must keep asking for more until she enters -100 to signify she wants to stop. Please note that your program must store the number into a *linked list*, and not an array, because in theory, the user can enter unlimited number of integers, and all array has a fixed size. * Implement a C function to perform merge sort. This function takes the linked list above as the input, and sort it using the Merge Sort algorithm. You do have a choice here: You can either perform the merge sort directly on the linked list (more fun), or copy the numbers from the linked lists into an array first, and then sort the array (more familiar).arrow_forward
- Write a function that takes in n ADT Lists in an array. The function is going to be called Intersection, and it will return a new list with the elements common to all the n lists. Determine the time complexityarrow_forwardThis code is for python Searching for Data In this lab we'll compare the time it takes to search for an item in a list vs searching for it in a binary search tree. Part 1: Populating and Searching a List To get started create a function, populate, that takes as a parameter a positive integer n, populates a list of length n with random integers in the range of [0, n] and returns that list. Next create a function that takes as a parameter a list and an integer and returns True if that integer is found in the list and False if it is not. Finally, in your main script call your function for a value of n to get a list of length n and then go through that list and look for each element in that list within the list and print out that count. Needless to say if you did everything right you should print out n Part 2: Populating and Searching a Binary Search Tree Download the provided BST.py module. This module is a stripped down implementation of a Binary Search Tree and associated Node…arrow_forwardWrite a function findMaxTuple() that gets a list of tuples as parameter, finds and returns the tuple with maximum sum inside the list. Write Python statements that create a sample list that has tuples inside (you can use the list of tupples in the sample run below), then use findMaxTuple() function to get the tuple with maximum sum and print it. Part-4:Sample tuples= [(3, 4, 360, 6), (1, 2), (12,), (132, 244, 64), (72, 71, 70)]Maximum tuple is (132, 244, 64)arrow_forward
- Do not use 2d lists, sets, dicts, arrays or recursion. Code in Python. Write the function destructiveRemoveRepeats(L), whichtakes a list L and destructively returns a new list in which any repeating elements in L are removed. Thus, this function should directly modify the provided list to not have any repeating elements. Since this is a destructive function, it should not return any value at all (so, implicitly, it should return None). For example: L = [1, 3, 5, 3, 3, 2, 1, 7, 5] destructiveRemoveRepeats(L) assert(L == [1, 3, 5, 2, 7])arrow_forwardWrite a function sumLength() that takes a list of strings as parameter, finds and returns the total length of all strings in the list use pyhatonarrow_forwardWrite a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint:The trick is to remove the last element each time to make the ArrayList a little shorter. import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum =…arrow_forward
- USING PYTHON: Function takes a nested list as input, and returns True if the nested list contains only integers between 0 and 255, and each row of the matrix has the same length. Example: >>>image([[1, 2, 3], [4, 5, 6], [7, 8, 9]])True >>> image([["0x5", "200x2"], ["111x7]]) Falsearrow_forwardProgramming language : Java Write the program the should determine if there exists a 3 partition of the given list, P1, P2, and P3 such that the sum of the elements in P1 minus the sum of the elements in P2 are exactly k and the sum of the elements in P2 minus the sum of the elements in P3 are also exactly k. k is a positive integer, or zero. P1, P2, and P3 are the partitions such that |sum(P1) - sum(P2)| = k and |sum(P2) - sum(P3)| = k. For example if list is given below: 1. List = [3 1 3 2 1] k = 4 Output: True The 3 partition form above list which satifies the condition is: P1 = {2}, P2 = {3, 3}, P3 = {1, 1} Sum(P1) = 2 Sum(P2) = 6 Sum(P3) = 1 + 1 = 2 |Sum(P1) - Sum(P2)| = 4 |Sum(P2) - Sum(P3)| = 4 2. List = [49 49 36 44 43 49 48 36 32 26 38] k = 88 Output: True A 3 partition that works is…arrow_forwardUSING PYTHON Chapter 5 -Programming Project: Implement a function that takes in two sorted lists and merges them into one list, the new list must be sorted. The function MUST run in O(m+n), where m is the length of list 1 and n the length of list 2. In other words, the function cannot do more than one pass on list 1 and list 2.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License