def bubble_down(values: list, left: int, right: int) -> None:"""Bubble down through values[left: right+1], swapping items that are outof order. Note that use of this slicing notation means that itemsvalues[left], values[left + 1], values[left + 2],be modified.values[right] couldPrecondition: left and right are valid indexes in values.>> list_example_1>> bubble_down(list_example_1, 1, 3)>> list_example_1[4, 1, 3, 2, 0]>> list_example_2 = [4, 3, 2, 1, 0]>> bubble_down(list_example_2, 0, 4)>> list_example_2[о, 4, 3, 2, 1][4, 3, 2, 1, 0]

According to the information given:-We have to write the bubble_down function to swap the items in…

def bubble_down(values: list, left: int, right: int) -> None: """Bubble down through values[left: right+1], swapping items that are out of order. Note that use of this slicing notation means that items values[left], values[left + 1], values[left + 2], II I values[right] could be modified. Precondition: left and right are valid indexes in values. [4, 3, 2, 1, 0] >> list_example_1 >> bubble_down(list_example_1, 1, 3) >> list_example_1 [4, 1, 3, 2, 0] >> list_example_2 >> bubble_down(list_example_2, 0, 4) >> list_example_2 [о, 4, 3, 2, 1] [4, 3, 2, 1, 0]

def bubble_down(values: list, left: int, right: int) -> None: """Bubble down through values[left: right+1], swapping items that are out of order. Note that use of this slicing notation means that items values[left], values[left + 1], values[left + 2], II I values[right] could be modified. Precondition: left and right are valid indexes in values. [4, 3, 2, 1, 0] >> list_example_1 >> bubble_down(list_example_1, 1, 3) >> list_example_1 [4, 1, 3, 2, 0] >> list_example_2 >> bubble_down(list_example_2, 0, 4) >> list_example_2 [о, 4, 3, 2, 1] [4, 3, 2, 1, 0]

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

What is the value of the median-of-3 for the following list. [80, 47, 41, 21, 40, 68, 78, 18, 75, 46, 30] Notes: • Your answer should be a single valid, non-negative, literal Python int value. For example, 123 is a valid int literal. • This question is asking about before any partition operation is carried out. • This is not asking for the median-of-3 index. • You can pre-check your answer (to check it's a valid, non-negative, literal int).
Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary. Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]
def large_matrix(matrix: list[list[int]]) -> int:"""Returns the area of the rectangle in the area of a rectangle is defined by number of 1's that it contains.The matrix will only contain the integers 1 and 0.>>> case = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_in_matrix(case1)6"" You must use this helper code: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = rowb = colmax = 0temp = 0rows = len(matrix)column = len(matrix[a])while a < rows and matrix[a][col] == 1:temp = 0while b < column and matrix[a][b] == 1:temp = temp + 1b = b + 1column = ba = a + 1if (a != row+1):temp2 = temp * (a - row)else:temp2 = tempif max < temp2:max = temp2b = colreturn max """ remember: Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import""'
1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate? 2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one. 3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one. 4-get(int index): Returns the element at the index position of the list, no change in the list. 5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one. 6-findMin(): returns the index of the smallest number in the list. 7-findMax(): returns the index of the largest number in the list. 8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it. 9-ToArray(): Return an…
Write the following function that partitions the list using the first element, called a pivot:def partition(lst): After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition.
Find the body for:def find_first_occurrence(msg: str, string_to_find: str) -> int: """Return the index of the first occurence of string_to_find in msg, or -1 if it does not occur, ignoring case. >>> find_first_occurrence('October holidays: Halloween and Thanksgiving', 'H') 8 >>> find_first_occurrence('Because DEC 25 == OCT 31', 'H') -1 >>> find_first_occurrence('hip hip hooray', 'ip') 1 """
Create a list – l1 with element 1,2,3,4,5. Convert this list into an array name ar. What is the dimension of this array – one dimension, 2 dimension or multidimension What is the datatype of elements of array. Print the second element of an array. Create a nested list – l2 with three lists. Elements of each lists are – [1,2,3];[4,5,6];[7,8,9] Convert this list into an array ar2. What is the dimension of this array. Observe the parenthesis. Print 8 from this array. Without using list, create an array ar3, which has the even number from 2 -10. Use the np.arange(start, end, skip). Run the following code and observe the output.
251e def intersection (self, source): 252e 253 254 Efficiency: 255 Returns a new set with only the values that appear in both self and source. 256 257 258 Maximum size of target Set is the smaller of the maximum sizes of 259 self and source. 260 Use: target = self.intersection(source) 261 262 Parameters: 263 source - a set (Set) 264 Returns: 265 target - a set containing one copy of all the values that appear in both self and source (Set) 266 267 268 Examples: (1,2,3) intersection (3,2,1) is (1,2,3) (1,2,3) intersection (4,5,6) is () (1,2,3,4,5,6) intersection (0,2,4,6,8) is (2,4,6) 269 270 271 272 273 274
Implementation in pseudocode
What is the index of the median-of-3 for the following list. [39, 27, 67, 91, 24, 28, 17, 70, 12, 89, 16, 69] Notes: • Your answer should be a single valid, non-negative, literal Python int value. For example, 123 is a valid int literal. • This question is asking about before any partition operation is carried out. • This is not asking for the median-of-3 value. • You can pre-check your answer (to check it's a valid, non-negative, literal int). Answer: (penalty regime: 10, 20, ... %) Precheck Check
PART A. We will start by finding the largest value. Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is initialized to the first element in the array. We then compare the element that maxValue is storing with every element in the list. Whenever we find an element in the array larger than the element that maxValue is storing, we update maxValue so that it stores the value of the newer larger element. Algorithm ArrayLargestElement Declare and initialize maxValue to the first element in the array. Use a FOR loop to traverse the array. // You already checked the first element, so you should start the loop at the second element. If the element at this index is larger than maxValue Update maxValue Output maxValue. Write a program MyArray_ABC that declares an array containing the following elements: 45, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 78, and outputs the largest value. Additionally,…
def grade_manipulation(grade_list): ''' Question You are working as a TA and the professor asks you to handle the uncleaned student grades. - First, substitute all grades that are None with a 0 - Second, reverse the order of the student grades - Third, change the type of the list to a tuple Args: grade_list (list) Returns: tuple >>> grade_manipulation([67, 95, 60, None, 100]) (100, 0, 60, 95, 67) ''" # print(grade_manipulation([67, 95, 60, None, 100])) # print('---')