Assignment 1Rewrite the following code in yourway so you will have lowercomplexity.36 def example5(A, B):37 Return the number of elements in B equal to the sum of prefix sums in A."n = len(A)39 count = 040 for i in range(n):# assume that A and B have equal length%3D# loop from 0 to n-1total = 042 for j in range(n):for k in range(1+j)total += A[k]45 if Blj == total:4641%3D# loop from 0 to n-1# loop from 0 to j4344count += 147 return count

In this program, I understand that we need to count the number of elements in B which are equal to…

Rewrite the following code in your way so you will have lower complexity. 36 def example5(A, B): # assume that A and B have equal length 37 Return the number of elements in B equal to the sum of prefix sums in A. 38 n= len(A) %3D 39 count = 0 10 for i in range(n): # loop from 0 to n-1 total = 0 for j in range(n): for k in range(1+j): total += A[k] if Bli) == total: count += 1 return count %3D # loop from 0 to n-1 # loop from 0 to j 3%3D

Rewrite the following code in your way so you will have lower complexity. 36 def example5(A, B): # assume that A and B have equal length 37 Return the number of elements in B equal to the sum of prefix sums in A. 38 n= len(A) %3D 39 count = 0 10 for i in range(n): # loop from 0 to n-1 total = 0 for j in range(n): for k in range(1+j): total += A[k] if Bli) == total: count += 1 return count %3D # loop from 0 to n-1 # loop from 0 to j 3%3D

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 Java program to find all triplets equal to a given sum in an unsorted array of integers
Complete the combinations function to generate all combinations of the characters in the string s with length k recursively
1 int[] a = new int[n]; 2 a[0] = 0; a[1] = 1; 3 int x = 0; 4 for (int i = 2; i < n; i++) { 5 x = 3 * (i-1) * (i-1); 6 x += 3 * i - 2; 7 a[i] = a[i-1] + x; 8 } The code can be simplified by replacing lines 5, 6, 7 with a single line of code. Write the single line of code below:
JAVA Code
Python
def findOccurrences(s, ch): lst = [] for i in range(0, len(s)): if a==s[i]: lst.append(i) return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n): word = input("welcome!") guesses = '' turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word): secrete_word = "-" * len(word) print(" the secrete word " + secrete_word) user_input = input("Guess a letter: ") if user_input in word: occurences = findOccurrences(word, user_input) for index in occurences: secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:] print(secrete_word) else: user_input = input("Sorry that letter was not found, please try again: ") def findOccurrences(s, ch): return [i for i, letter in enumerate(s) if letter == ch] *** enumerate not discussed in…
A popular word game involves finding words from a grid of randomly generatedletters. Words must be at least three letters long and formed from adjoining letters.Letters may not be reused and it is valid to move across diagonals. As an example,consider the following 4 * 4 grid of letters: A B C DE F G HI J K LM N O P The word “FAB” is valid (letters in the upper left corner) and the word “KNIFE”is valid. The word “BABE” is not valid because the “B” may not be reused. Theword “MINE” is not valid because the “E” is not adjacent to the “N”. Write a program that uses a 4 * 4 two-dimensional array to represent the gameboard. The program should randomly select letters for the board. You may wishto select vowels with a higher probability than consonants. You may also wish toalways place a “U” next to a “Q” or to treat “QU” as a single letter. The programshould read the words from the text file words.txt (included on the website withthis book) and then use a recursive algorithm to…
Question: Observe the following code: A0 = dict(zip(('a','b','c','d','e'),(1,2,3,4,5))) A1 = range(10)A2 = sorted([i for i in A1 if i in A0]) A3 = sorted([A0[s] for s in A0]) A4 = [i for i in A1 if i in A3] A5 = A6 = [[i,i*i] for i in A1] print(A0,A1,A2,A3,A4,A5,A6) Write down the output of the code.
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print:7 9 11 10 10 11 9 7 #include <iostream>using namespace std; int main() { const int NUM_VALS = 4; int courseGrades[NUM_VALS]; int i; for (i = 0; i < NUM_VALS; ++i) { cin >> courseGrades[i]; } /* Your solution goes here */ return 0;}
What are the correct loops to navigate to all * ?the two dimensional array (4x5) elements for(int i=0;i<20;i++) for(int i=0;i<5;i++) for(int i=0;i<=3;i++) for(int j=0;j<=3;j++) for(int i=0;i<4;i++) for(int j=0;j<5;j++)
2. Problem 2: In this problem you will test our "in class" version of Gaussian elimination against the version in numpy. Use both codes to solve some randomly chosen linear systems of size N 10, 20, 40, 80, 160, 320, 640, 1280, 2560, and 5120. Depending on your computer, the last two may or may not work. If they don't, just say so in your report. If you computer can do N- 10240 then try this as well. Note that in cach case N 10 * 2k for k = 1,..., 10. That is, each time we are doubling the size of the matrix. abone Plot the results as two curves. Our code in red and numPy in bluc. (Or whatever colors you prefer). Can you guess the function which governs the runtime? Based on this guess, how long would it take to do N 40960 using numPy? N=81920?
Write this method int maximum (int[] a) // returns the maximum element of a []