Write a function convert_to_millimetres(measurements) which takes a list of measurements in centimetres as a parameter and modifies that list byreplacing each measurement with its millimetres version, which involves multiplying by 10.You will need to use the updated-list pattern. (Note that there's no need to return anything because the function modifies the original list it wasgiven.)For example:TestResultmeasurements = [10.0, 25.0, 1.0][30.0, 75.0, 3.0]convert_to_millimetres (measurements)print (measurements)Answer: (penalty regime: 0, 10, ... %)1def convert_to_millimetres(measurements):for i in range(len(measurements)):measurements[i] = measurements[i] * 10return measurements36measurements = [10.0, 25.0, 1.0]8 convert_to_millimetres(measurements)9 print(measurements)PrecheckCheckTestExpectedGot[30.0, 75.0, 3.0] [100.0, 250.0, 10.0] x[100.0, 250.0, 10.0]measurements = [10.0, 25.0, 1.0]convert_to_millimetres(measurements)print (measurements)Some hidden test cases failed, too.Your code must pass all tests to earn any marks. Try again.Show differencesIncorrectMarks for this submission: 0.00/1.00. This submission attracted a penalty of 0.10.

Here I have created a function and inside the function, I have used a for loop to iterate over the…

Write a function convert_to_millimetres (measurements) which takes a list of measurements in centimetres as a parameter and modifies that list by replacing each measurement with its millimetres version, which involves multiplying by 10. You will need to use the updated-list pattern. (Note that there's no need to return anything because the function modifies the original list it was given.) For example: Test Result measurements = [10.0, 25.0, 1.0] convert_to_millimetres (measurements) [30.0, 75.0, 3.0] print (measurements)

Write a function convert_to_millimetres (measurements) which takes a list of measurements in centimetres as a parameter and modifies that list by replacing each measurement with its millimetres version, which involves multiplying by 10. You will need to use the updated-list pattern. (Note that there's no need to return anything because the function modifies the original list it was given.) For example: Test Result measurements = [10.0, 25.0, 1.0] convert_to_millimetres (measurements) [30.0, 75.0, 3.0] print (measurements)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a function getMultiples() that takes a list of integer numbers and an integer number as parameters, returns a new list made of the numbers in the list that are multiples of the number in the second parameter.Example: If the parameters are [44, 80, 72, 245, 7, 24] and 5, then the function will return [80, 245] which are multiples of 5 (or divisible by 5).The function must work for all integer lists and all 2nd integer parameters. pls pyhton and answer fast thank u
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function: void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support…
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function; void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support File…
Write a function called mymember? Which will take an object x and a list y, and return #t (true) If x is an element of y and #f (false) otherwise. Note that y may be a nested list, but x is only a member of y if x is one of the top-level elements. One can use the built in equal. Code in Racket. I really appreciate it thank you so much. I have been so stuck on this question for so long
Write a function letter_count that accepts a string txt and returns a list containing the number of times that each letter of the alphabet occurs within txt. The returned list should contain the number of occurences of all twenty-six letters of the Latin alphabet, counting both upper and lower-case instances. For example, the string 'Abacus' contains two instances of the letter 'a', and so the first element of the returned list would be 2
Write a function sum67 that takes a list as an input parameter and returns the sum of the numbers in the list, except ignore sections of numbers starting with a 6 and extending to the next 7 (every 6 will be followed by at least one 7). Return 0 for no numbers.
Write in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…
Write a function countRange() that takes three parameters, a list and two numbers, finds and returns the number of elements that are between the two numbers (both inclusive).Assume that the list contain numbers and the second parameter is less than the third parameter. use=pyhton pls ? and fast answer
Write a program in PYTHON with a function longest(L) which examines the argument list L and returns the longest string. You can assume all of the elements of the list L are strings, and that the list is not empty. Use the approach where there is a variable largestyet which is initialized to the first element of L. Then go through the rest of the elements and update largestyet whenever you encounter a longer string. For example, longest(['blue', 'red', 'the old barn', 'the white house', 'green']) would return 'the white house'.
Please 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 7
Write a python function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have to sort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
# Create a list of tuplestuples = [("p", 1), ("q", 2), ("r", 3)]# Use enumerate() to iterate over the tuples and print the index and valuefor index, value in enumerate(tuples):print(index, value)This code will print the following output:0 p1 q2 r Could you try to modify your code to get the output mentioned by you? Also, the output for the above function should be0 ('p', 1)1 ('q', 2)2 ('r', 3) Could you please confirm?