fill out the python code 1 # Read integers into a list and return the list.2 def read_nums ():3nums = input().split()return [int (num) for num in nums]456 # Output the content of a list, separated by spaces.7 def print_nums (numbers):for num in numbers:8print (num, end=' ')9101112 def merge(numbers, i, j, k):13merged_size=ki + 1141516171819202122232425262728293031323334353637383940414246474849print()5051merged_numbers = [0] * merged_size6061merge_pos= 0left_posright_pos= j + 1while left_pos <= j and right_pos <= k:if numbers [left_pos] < numbers [right_pos]:merged_numbers [merge_pos] = numbers [left_pos]left_pos += 1else:merged_numbers [merge_pos] = numbers [right_pos]right pos += 1merge_pos += 1while left_pos <= j:merged_numbers [merge_pos]left pos + 1merge_pos += 1while right pos <= k:merged_numbers [merge_pos]43 def merge_sort (numbers, i, k):j = 04445if i < k:right_pos += 1merge pos += 152 if _name___ == '____main____':53545556575859=for merge pos in range (merged_size):numbers [i + merge_pos]=numbers = read_nums ()print("unsorted:", end=' ')=j = (1 + k) // 2print(i, j, "I", j+¹, k)merge_sort (numbers, i, j)merge_sort (numbers, j+1, k)merge (numbers, i, j, k)print('\nsorted:', end='')print_nums (numbers)numbers [left_pos]numbers [right_pos]merged_numbers [merge_pos]print_nums (numbers)print()merge_sort (numbers, 0, len(numbers)-1) The program is the same as shown at the end of the Merge sort section, with the following changes:Numbers are entered by a user in a separate helper function, read_nums(), instead of defining a specific list.Output of the list has been moved to the function print_nums().• An output has been added to merge_sort(), showing the indices that will be passed to the recursive function calls.Add code to the merge sort algorithm to count the number of comparisons performed.Add code at the end of the program that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons:12")Hint: Use a global variable to count the comparisons.Note: Take special care to look at the output of each test to better understand the merge sort algorithm.Ex: When the input is:3 2 1 5 9 8the output is:unsorted: 3 2 1 5 9 8023 52 21 10 10 03 41553 3 4 4sorted: 1 2 3 5 8 9comparisons: 8

Step1: We have create a function read_num() Step2: Then we have print_nums function that takes…

The program is the same as shown at the end of the Merge sort section, with the following changes: Numbers are entered by a user in a separate helper function, read_nums(), instead of defining a specific list. • Output of the list has been moved to the function print_nums (). • An output has been added to merge_sort(), showing the indices that will be passed to the recursive function calls. Add code to the merge sort algorithm to count the number of comparisons performed. Add code at the end of the program that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons 12") Hint: Use a global variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 3 2 1598 the output is: unsorted: 3 2 1 5 9 8 021 35 0 1 0 0 N 2 1 1 34155 3344 sorted: 1 2 3 5 8 9 comparisons: 8

The program is the same as shown at the end of the Merge sort section, with the following changes: Numbers are entered by a user in a separate helper function, read_nums(), instead of defining a specific list. • Output of the list has been moved to the function print_nums (). • An output has been added to merge_sort(), showing the indices that will be passed to the recursive function calls. Add code to the merge sort algorithm to count the number of comparisons performed. Add code at the end of the program that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons 12") Hint: Use a global variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 3 2 1598 the output is: unsorted: 3 2 1 5 9 8 021 35 0 1 0 0 N 2 1 1 34155 3344 sorted: 1 2 3 5 8 9 comparisons: 8

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

* allSame returns true if all of the elements in list have the same value. * allSame returns false if any two elements in list have different values. * The array may be empty and it may contain duplicate values. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * * * * true == allSame (new double[] { }) true == allSame(new double[] {11}) true == allSame (new double[] { 11, 11, 11, 11 }) false == allSame(new double[] { 11, 11, 11, 22 }) false == allSame (new double[] { 11, 11, 22, 11 }) true == allSame (new double[] { 22, 22, 22, 22 }) * */ public static boolean allSame (double[] list) { return StdRandom.bernoulli(); //TODO: fix this
Write the following function that merges two sorted lists into a new sorted list:def merge(list1, list2): Implement the function in a way that takes len(list1) + len(list2) comparisons. Write a test program that prompts the user to enter two sorted lists and displays the merged list.
Modify the recursive Fibonacci function to employ the memoization technique discussed in this chapter. The function creates a dictionary and then defines a nested recursive helper function named memoizedFib. You will need to create a dictionary to cache the sum of the fib function. The base case of the fib function is the same as before. However, before making any recursive calls, the helper function looks up the value for the function’s current argument in the dictionary (use the method get, with None as the default value). If the value exists, the function returns it and skips any recursive calls. Otherwise, after the helper function adds the results of its two recursive calls, it saves the sum in the dictionary with the current argument of the function as the key. Note: The program should output in the following format: n fib(n) 2 1 4 3 8 21 16 987 32 2178309 ---------------------------------------------------------------------------------- def…
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.
Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed.
Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise:
QUESTION: NOTE: This assignment is needed to be done in OOP(c++/java), the assignment is a part of course named data structures and algorithm. A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in list Display all items. Traverse…
def removeMultiples(x, arr) - directly remove the multiples of prime numbers (instead of just marking them) by creating a helper function. This recursive function takes in a number, n, and a list and returns a list that doesn’t contain the multiples of n.def createList(n) - a recursive function, createList(), that takes in the user input n and returns an array of integers from 2 through n (i.e. [2, 3, 4, …, n]). def Sieve_of_Eratosthenes(list) - a recursive function that takes in a list and returns a list of prime numbers from the input list.Template below: def createList(n): #Base Case/s #ToDo: Add conditions here for base case/s #if <condition> : #return <value> #Recursive Case/s #ToDo: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once all ToDo is completed return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your…
Write a recursive function that finds the number of occurrences of a specified character in a list. You need to define the following two functions. The second one is a recursive helper function.def count(chars, ch):def countHelper(chars, ch, high):Write a test program that prompts the user to enter a list of characters in one line, and a character, and displays the number of occurrences of the character in the list.
in python. Please include docstring. Write a recursive function named list_max that takes as its parameter a list of numbers and returns the maximum value in the list. You can assume the list contains at least one element. If multiple elements of the list are tied for the maximum, you would still return that value. You cannot call the built-in max() function. You may use default arguments and/or helper functions. Your recursive function must not: use any loops use any variables declared outside of the function use any mutable default arguments (see the Code Style Requirements)
Computer Science In Racket, write a recursive function called "first-index" that returns only the first index of the specified element in a list. Ex : (first-index '1 '(3 5 1 4 5 2 1)) Would return 3 The function must take 2 arguments, the item you wish to find its index and a list
Python only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…