Which of the following statements a), b) or c) is false? O a. List method sort modifies a list to arrange its elements in ascending order: numbers = [10, 3,7,1,9,4,2, 8, 5, 6] numbers.sort() O b. To sort a list in descending order, call list method sort with the optional keyword argument reverse-=False. c. Built-in function sorted returns a new list containing the sorted elements of its argument sequence-the original sequence is unmodified. O d. All of the above statements are true.

Which of the following statements a), b) or c) is false? O a. List method sort modifies a list to arrange its elements in ascending order: numbers = [10, 3,7,1,9,4,2, 8, 5, 6] numbers.sort() O b. To sort a list in descending order, call list method sort with the optional keyword argument reverse-=False. c. Built-in function sorted returns a new list containing the sorted elements of its argument sequence-the original sequence is unmodified. O d. All of the above statements are true.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

The list method reverse reverses the elements in the list. Define a functionnamed reverse that reverses the elements in its list argument (without using themethod reverse). Try to make this function as efficient as possible, and state itscomputational complexity using big-O notation. Using this template in Python: def reverse_elems(input_list):reversed_list = []#TODO: Your work here# Return reversed_listreturn reversed_listif __name__ == "__main__":my_list = [1, 2, 3, 4, 5]print(reverse_elems(my_list)) # Correct Output: [5, 4, 3, 2, 1]
• Create a function which takes a tuple and returns a dictionary which is a histogramto count how many times each number exists in the tuple:• The main program must take the dictionary, transform the items into a list,use sort () to order the list (in ascending order) and after that display the list. def histo_n (x):'' '(tuple) -> dictReturns a dictionaryPrecondition: the tuple contains integers>>> t = (1,2, -3,3,4, -3,3,3)>>> histo_n (t){1: 1, 2: 1, 3: 3, 4: 1, -3: 2}'' ' Subject: Python Programming
Alter insertion sort below to sort a list of strings instead of numbers. It shouldn't return anything - it should sort the list "in place". The sorting should ignore case. For example "Zebra" should come after "apple", "maRker" should come after "marble", etc. Name this function string_sort. After calling this function, the list that was passed in should now contain the exact same strings it did before, but in sorted order. def insertion_sort(a_list): """ Sorts a_list in ascending order """ for index in range(1, len(a_list)): value = a_list[index] pos = index - 1 while pos >= 0 and a_list[pos] > value: a_list[pos + 1] = a_list[pos] pos -= 1 a_list[pos + 1] = value
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
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, there is a need to copy the whole list to a new array B.The new node inserted might cause shifting of the existing elements C.The memory allocation can be very inefficient D.The insertion of a new element is proportional to the size of the list
A student writes a program that for any two lists L1 and L2, computes a list L3 that contains only the elements that are common between the two lists *without duplicates*. Which following statement makes the following portion of code that computes L3 correct: L3 = [] # line 1 for elem in L1: # line 2 if elem in L2: # line 3 L3.append(elem) # line 4
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, it whole list will be automatically copied to a new array B.The new node inserted might cause shifting of the existing elements C.The insertion of a new element is proportional to the size of the list D.The memory allocation can be very inefficient
// pre: list != null, list.length > 0 // post: return index of minimum element of array public static int findMin(int[] list) { assert list != null && list.length > 0 : "failed precondition"; int indexOfMin = 0; for(int i = 1; i < list.length; i++) { if(list[i] < list[indexOfMin]) { indexOfMin = i; } } return indexOfMin; } Question: draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)
Ask 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).
Implement a list of employees using a dynamic array of strings.Your solution should include functions for printing list, inserting and removingemployees, and sorting lists (use Bubble sort in C++ language).Keep list of employees sorted within the list after insertion.See the following example:How many employees do you expect to have?5 (Carriage Return)Menu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit2 (Carriage Return)Input name of new employee : MikeMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit1(Carriage Return)1 . MaryMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit
Given the following list { 10,9,-2,1}, sort the list using selection sort and fill out the following table. static void selectionSort(double [] list) {// find minimum in the list [i....list.length-1]for (int i=0;i<list.length;i++) {double currentMin=list[i];int currentMinIndex=i;for (int j=i+1;j<list.length;j++) {if (currentMin>list[j]){currentMin=list[j];currentMinIndex=j;}}// j for// swap list[i] with list[currentMindIndex ifnecessary.if (currentMinIndex!=i) {list[currentMinIndex]=list[i];list[i]=currentMin;}// if}// for}