Question 3 What is the output of the following code? print (lambda word, echo: word . echo ("Hey', 3)) (A) echo: HeyHeyHey B This code returns an error. HeyHeyHey Hey Hey Hey Question 4 Define the variables x and y as lists of numbers x=[1, 2, 3, 4, 5] y=[11, 12, 13, 14, 15] If you add x and y together, what is the 7th digit based on the answer displayed by the Python console? Your Answer: 12 Question 5 What will be the first command in Python to be able to display the value of pi? Blank 1

Question 3 What is the output of the following code? print (lambda word, echo: word . echo ("Hey', 3)) (A) echo: HeyHeyHey B This code returns an error. HeyHeyHey Hey Hey Hey Question 4 Define the variables x and y as lists of numbers x=[1, 2, 3, 4, 5] y=[11, 12, 13, 14, 15] If you add x and y together, what is the 7th digit based on the answer displayed by the Python console? Your Answer: 12 Question 5 What will be the first command in Python to be able to display the value of pi? Blank 1

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

please code in python Given a list of numbers, return true if it follows the “231” pattern, namely that the list has a value x, followed by x+ 1, followed by x−1. You don’t have to print out what the numbers were, but we listed them in the example outputs for extra clarity. # [1,2,3,4,5] -> False (doesn’t contain the pattern) # [74,3,4,2,74,75,2] -> True (3,4,2 satisfies the pattern) # [74,75,0,1,-1,100] -> True (0,1,-1 satisfies the pattern) def has231(arr) :
We have the following rectangle records in a list of dictionaries. Test Cases: rectangle_records = [{"ID": "Rect1", "Length": 40, "Breadth": 25, "Color": "red"}, {"ID": "Rect2", "Length": 30, "Breadth": 20, "Color": "blue"}, {"ID": "Rect3", "Length": 70, "Breadth": 45, "Color": "green"}, {"ID": "Rect4", "Length": 20, "Breadth": 10, "Color": "purple"}] Using Insertion Sort, Write a python function sort_rectangles that takes rectangle_records and record_title as a parameter and sort the rectangle_records in ascending order by record_title. You need to return the updated rectangle_records list. NOTE: The type of record_title input can be ID, Length, Breadth, or Color. >>> sort_rectangles(rectangle_records, "ID") [{"ID": "Rect1", "Length": 40, "Breadth": 25, "Color": "red"}, {"ID": "Rect2", "Length": 30, "Breadth": 20, "Color": "blue"}, {"ID": "Rect3", "Length": 70, "Breadth": 45, "Color": "green"}, {"ID": "Rect4", "Length": 20, "Breadth": 10, "Color": "purple"}] >>>…
PYTHON!!!! Complete the below function which takes the coefficients of a polynomial P(x) as a tuple, and a list of values, and returns a list of computed values of P(x). Note that P() can be of any order. For example, P((2,-1,1), [1,2,3]) shall compute P(x) for x=1,2,3 P(x)=2x^2 -x +1 where x^2 denotes the square of x. Hence, the function must return [2,7,16], because P(1) is 2, P(2) is 7, and P(3) is 16. """ def P(coefs, vals):
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
You have been given the head to a singly linked list of integers. Write a function check to whetherthe list given is a 'Palindrome' or not.Input Format:Elements of linked listOutput Format:True or FalseSample Input 1:9 3 2 2 3 9Sample Output 1:trueSample Input 2:0 2 3 2 5Sample Output 2:false PLEASE DO THIS PROGRAM IN DETAIL. PLEASE DO THE PROGRAM IN JAVA.
(I need help coding for problem B but posted part A because they use some of the same perimeters; an explanation would be appreciated. In Python, please, Thank you.) ### Part (A) Given a list of pairs of integers, for example ~~~List( (1, 5), (2, 7), (15, 14), (18, 19), (14, 28), (0,0), (35, 24) )~~~ Output a list consisting of just those pairs $(n_1, n_2)$ in the original list wherein $ | n_1 - n_2 | \leq 1 $. Ensure that the order of the elements in the output list is the same as that in the input list. For the example above, the expected output is: ~~~List( (15,14), (18,19), (0,0) )~~~ __Note__ - Your function must be called `outputConsecutivePairs` with just one argument that must be a list of pairs of integers. It must return a list of pairs of integers.- You can use for-loops and the following operators for concatenating elements to list.- `::` or cons appends an element to the front of a list.- `:+` appends an element to the back of a list.- `++` appends two lists together.-…
We have to create a program in java in which the below mentioned things should be there- You have been given the head to a singly linked list of integers. Write a function check to whetherthe list given is a 'Palindrome' or not.Input Format:Elements of linked listOutput Format:True or FalseSample Input 1:9 3 2 2 3 9Sample Output 1:trueSample Input 2:0 2 3 2 5Sample Output 2:false
please code in python Given a word, provided below, use a single comprehension to make a list of all strings that can be formed by replacing exactly one vowel in the word with a different vowel (a vowel is a,e,i,o,u). Required output: ['Baoted', 'Beoted', 'Bioted', 'Buoted', 'Boated', 'Boeted', 'Boited', 'Bouted', 'Bootad', 'Bootid', 'Bootod', 'Bootud'] # Q4-5-5 Grading Tag: word = "Booted"
Can this be put into a list comprehension? (On one line)?? def week_10(report):k= []for i in report:z = ""for j in range(i.index("bio"), len(i)):if i[j].isdigit():z += i[j]elif i[j] == '.':z += i[j] k.append(z) return k
Can you answer with the Python software language ? Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5). The key is the name of an ingredient, and the vlaue is its existing amount. ingr is a list of tuples, where each tuple represents the required amount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each item in the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10} ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2…
Java - Write a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain fewer than 20 integers. That list is followed by two more integers representing lower and upper bounds of a range. Your program should output all integers from the list that are within that range (inclusive of the bounds). For coding simplicity, follow each output integer by a comma, even the last one. The output ends with a newline. Ex: If the input is:
a) Write a Python function PrimPyth(n) which returns a list of primitive Pythagorean triples where (x,y,z) where 0 < x < y < z < n . For example, PrimPyth(6) should return [(3,4,5)]. Hint: In this project we represent triples as tuples (x,y,z) not as lists [x,y,z]. The two data-types behave similarly in many ways. Do not write a triply nested loop which searches through all triples (x,y,z) as this will take n^3 steps! Instead, use the fact (proved by Euclid) that every primitive Pythagorean triple arises as (m^2 - n^2, 2mn, m^2 +n^2). where are coprime integers which are not both odd. (Of course the first two entries may be swapped.)