. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False

. Specify the best-case and worst-case asymptotic runtime of the following Python functions using big- notation in terms of n, the number of elements in the list of integers vals. Justify your answers in a sentence or two. a. b. def test1 (vals): out = [] for i in range (2, 10): total = 0 for j in range (len (vals)): if vals[j] % i == 0: total += 1 out.append(total) return out def test2 (vals): for ele in vals: for ele2 in vals: if ele+ ele2 == 10: return True for ele3 in vals: for ele4 in vals: if ele3* ele4 == 10: return True return False

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

Python Question QUESTION 1 Recursively count the occurrences of a substring. Implement a function that counts the number of times a target string occurs in the main string. In particular, provide the implementation for count(s, target), where 's' is the main string and 'target' is the substring you wish to count. Note that 'target' is not just a single character, but a substring of any length greater than zero (length guaranteed to be positive). Some of the sample cases include, but are not limited to, the following. Input: s= 'aaabbb', target = 'aa' Output: 2 Input: s= 'bbaaa', target = 'c' Output: 0 Input: s= 'abcbc', target='bcb' Output: 1 Input: s = 'aab', target='bbbb' Output: 0 Here are the constraints: • You mustn't use any of the string methods provided by Python. (Indexing is okay) • You must use recursion. • Write a paragraph detailing the base and recursive cases. Your answer should also include the *why* and *how*.
In Python, The function concatAltChars takes a string parameter s and a boolean parameter even; the function concatenates together either the even-position characters of s or the odd-position characters of s, depending on whether even is True, or False, respectively. The accumulated string is returned. For example, the even-indexed characters of "HANOVER" are at indexes 0, 2, 4, and 6: H N V R. So, concatAltChars("HANOVER", True) returns the string result "HNVR". But concatAltChars("HANOVER", False) returns the string result "AOE". For example: Test Result s = "goldfinches" print(concatAltChars(s, True)) glfnhs s = "A" print(concatAltChars(s, True)) A s = "A" print(concatAltChars(s, False))
‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9]) (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]
in Python: You wish to generate all possible 3-letter subsets from the letters in an N-letter word (N>3). Which of the above recursive functions is the closest (just enter the function's name)?
In python. Include docstring. Please follow code requirements as listed below. Write a recursive function named is_subsequence that takes two string parameters and returns True if the first string is a subsequence of the second string, but returns False otherwise. We say that string A is a subsequence of string B if you can derive A by deleting zero or more letters from B without changing the order of the remaining letters. The empty string (which has zero characters) is considered a subsequence of any string (since you can derive it by deleting zero or more letters from any string). You can assume that the only characters in the strings will be lower case letters (though that shouldn't really affect your code). Note: subsequences are different than substrings, since the characters of a subsequence don't have to be consecutive. For example, 'aeiou' is a subsequence of 'faceitious', since all the characters appear in the same order, even though they're not consecutive. You may use…
Given L = {w = {a, b}*: |w| is even}, the correct statements are: (aa U ab Uba U bb)* is a regular expression that generates L. (ab Uba)* is a regular expression that generates L. aa U ab U ba U bb is a regular expression that generates L. ab U ba is a regular expression that generates L.
PYTHON! Can someone help me with this problem? Write a NON-recursive function that takes an array of strings as an argument and returns the longest string and None if empty.
I have a math assignment using python in jupyter. I am given a list of fruits, as seen below: list = ['apple', 'pear', 'orange', 'banana', 'avocado', 'kiwi', 'mango', 'tomato', 'blueberry', 'apricot', 'peach', 'papaya'] I have to print the second, fourth, sixth, ect. fruit in the list, but I don't know what the correct comand is. I have tried splicing, but I can only get the second and fouth fruit to print.
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…
Create a Python function that takes a sentence as input, performs lemmatization using StanfordNLP, and removes stopwords from the lemmatized sentence. Use a list of stopwords. Return the cleaned and lemmatized sentence
Implement the following function which accepts a string as parameter and reverses it, without using any function from the string library. void strReverse(char *str)