1,2,3 are done code is below def reverse_list(old_list):new_list = [ele for ele in reversed(old_list)]return new_listdef max_element(my_list):return my_list.index(max(my_list))def odd_list(my_list):return [x for x in my_list if x % 2 != 0]if __name_str = input( "Enter the elements of the list: ").split()elements = list(map(int, str))print(reverse_list(elements))print(f'Index of maximum element is: {max_element(elements)}')print(f'List of Odd numbers: {odd_list(elements)}')_main__":Output:Enter the elements of the list: 3 5 4 6 5 7 8 12[12, 8, 7, 5, 6, 4, 5,3]Index of maximum element is: 7List of Odd numbers: [3, 5, 5, 7] | 1. Write a function that takes in a list and returns a new list that has the elements of theparameter in reverse order| 2. Write a function to return the index of the maximum element in a list3. Write a function that takes in a list returns a new list with only the odd elements from theparameter list.4. Write a function that takes in two lists. Each parameter represents a point, e.g. [1,1). Returnthe Euclidean distance between the two points.5. Write a function that takes in a filename. Open the file, and return a list where each elementis a line from the file.6. Write a function that takes in a filename and a list. Write the contents of the list to the file.Each element should be on its own line in the file.Viow transcribod

According to the guidelines I am allowed to answer only one question. So I am answering the 4th…

Answered: 1,2,3 are done code is below

Engineering

Computer Science

1,2,3 are done code is below

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

Here is the code for number 1. def reverse_list(old_list): new_list = [ele for ele in reversed(old_list)] return new_list if __name__ == "__main__": str = input("Enter the elements of the list: ").split() elements = list(map(int, str)) print(reverse_list(elements))
POEM_LINE = str POEM = List[POEM_LINE] PHONEMES = Tuple[str] PRONUNCIATION_DICT = Dict[str, PHONEMES] def all_lines_rhyme(poem_lines: POEM, lines_to_check: List[int], word_to_phonemes: PRONUNCIATION_DICT) -> bool: """Return True if and only if the lines from poem_lines with index in lines_to_check all rhyme, according to word_to_phonemes. Precondition: lines_to_check != [] >>> poem_lines = ['The mouse', 'in my house', 'electric.'] >>> lines_to_check = [0, 1] >>> word_to_phonemes = {'THE': ('DH', 'AH0'), ... 'MOUSE': ('M', 'AW1', 'S'), ... 'IN': ('IH0', 'N'), ... 'MY': ('M', 'AY1'), ... 'HOUSE': ('HH', 'AW1', 'S'), ... 'ELECTRIC': ('IH0', 'L', 'EH1', 'K', ... 'T', 'R', 'IH0', 'K')} >>> all_lines_rhyme(poem_lines, lines_to_check, word_to_phonemes) True…
def is_valid_index(idx, in_list): """ Checks whether the provided index `idx` is a valid positive index that can retrieve an element from `in_list`. Returns False if `idx` is negative or exceeds the size of `in_list` - 1. """ if (idx in in_list - 1): if len(idx) != 0: return idx else: return False Test Failed: We caught the following error caused by your code: unsupported operand type(s) for -: 'list' and 'int' Check the following: Incorrect number or type of parameters/arguments? Error inside the function? Did you run your code? Used some global scope variables? python debugging help
lst1= [4,3,2,6,2] and lst2=[1,2,4] then the new_list is [2,2,4]. Assign the new-list to variable new_list and sort. Code: What is wrong with this code? lst1= [4,3,2,6,2] lst2=[1,2,4] new_list=[] for elements1 in lst1: for elements2 in lst2: elements1==elements2: new_list.append(elements1) new_list.sort()
def small_index(items: list[int]) -> int:"""Return the index of the first integer in items that is less than its index,or -1 if no such integer exists in items.>>> small_index([2, 5, 7, 99, 6])-1>>> small_index([-5, 8, 9, 16])0>>> small_index([5, 8, 9, 0, 1, 3])3"""
def my_index_1(my_list:List[int], my_element:int)->int:"""Our version of the one-argument version of the index function.https://docs.python.org/dev/library/stdtypes.html#common-sequence-operations)This function takes a list and an element, and returns the smallestindex where the element occurs in the list. This function returnsNone if the element is not in the list.Arguments:my_list (list): A list of integers.my_element (int): The element to be found.Returns:int: The smallest index at which my_element is found in my_list.Examples:>>> print(my_index_1([], 2))None>>> print(my_index_1([1, 2, 3], 2))1>>> print(my_index_1([3, 1, 2, 3, 1], 2))2>>> print(my_index_1([3, 1, 2, 3, 1], 3))0""" Please solve this in Python
int[] list = {-35,4,-50,2} and the length= 4 details based on the given tracking Show the value of low, high, indexOfMin, min, swapping and the call. Sort the list and show the steps in table. The first function call is sort(list, 0, list.length - 1); The source code is eprivate static void sort(int [] list, int low, int high) { if (low < high) { // Find the smallest number and its index in list(low .. high) int indexOfMin = low; int min = list[low]; for (int i = low + 1; i <= high; i++) { e if (list[i] < min) { min = list[i]; indexOfMin = i; }// if }// for // Swap the smallest in list(low .. list[indexOfMin] list[low] = min; // Sort the remaining list(low+1 sort(list, low + 1, high); }// outer if } // end of function high) with list(low) list[low]; high) low high if (low < high) IndexOfmin=low min=list[low]i list[i] < min list min = indexOfMin = i; list[i] Swapping: list[indexOfMin] list[low];
#ifndef ___LINKED_LIST_H___#define ___LINKED_LIST_H___ #include<stdlib.h> typedef struct LINKED_LIST_NODE_s *LINKED_LIST_NODE;typedef struct LINKED_LIST_NODE_s {LINKED_LIST_NODE next;void *data;} LINKED_LIST_NODE_t[1]; typedef struct LINKED_LIST_s *LINKED_LIST;typedef struct LINKED_LIST_s {LINKED_LIST_NODE head;} LINKED_LIST_t[1]; //IMPLEMENT THESE FUNCTIONSLINKED_LIST linked_list_init();void linked_list_free(LINKED_LIST list);int linked_list_prepend(LINKED_LIST list, void *data);int linked_list_append(LINKED_LIST list, void *data);int linked_list_insert(LINKED_LIST list, void *data, int idx);void *linked_list_set(LINKED_LIST list, void *data, int idx);void *linked_list_get(LINKED_LIST list, int idx);void *linked_list_remove(LINKED_LIST list, int idx);void linked_list_removeall(LINKED_LIST list);void linked_list_concatenate(LINKED_LIST list, LINKED_LIST list2); LINKED_LIST linked_list_init(){LINKED_LIST list;list = (LINKED_LIST)malloc(sizeof(LINKED_LIST_t));if(list != NULL)…
• find_last(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the last element of the list which is equal to the second input; if it cannot be found, returns None instead. >> find_last(['a', 'b', 'b', 'a'], 'b') 2 >>> ind = find_last(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None
my_list = [1,2,3,4] for x in my_list:
What does the following error message normally mean? IndexError: list index out of range Select one: а. This error normally indicates that you have tried to access an element of a list that doesn't exist. O b. This error normally means that you have used the range() function incorrectly. С. This error normally means that you have used a list where you should have used a tuple. d. This error normally means that you used too many lines of code in your program.
Name: ID: A 6. Consider the following code segment. Assume that index1 is a number between 1 and LENGTH(theList), inclusive, and index2 is a number between 2 and LENGTH(theList) - 1, inclusive. theList [9, -1, 5, 2, 4, 8] x + theList[index1] + theList[index2] What is the largest possible value that the variable x can have after the code segment executes? а. 4 с. 14 b. 11 d. 17