Given the find_word function, which phrase most accurately describes the WORST case running time of a call to the find_word function on a string and a string of length 3. def find_word(s: str, word: str) -> bool: word_len = len(word) for i in range(len(s) - word_len): if s[i:i + word_len] == word: return True return False O constant running time, independent of len(s) O logarithmic running time with respect to len(s) O linear running time with respect to len(s) O quadratic running time with respect to len(s) O something else O it is impossible to determine

Given the find_word function, which phrase most accurately describes the WORST case running time of a call to the find_word function on a string and a string of length 3. def find_word(s: str, word: str) -> bool: word_len = len(word) for i in range(len(s) - word_len): if s[i:i + word_len] == word: return True return False O constant running time, independent of len(s) O logarithmic running time with respect to len(s) O linear running time with respect to len(s) O quadratic running time with respect to len(s) O something else O it is impossible to determine

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 function print_matching_indexes (items, target) that prints the indexes of all the occurrences of the target in the list items. Check the test cases for how the function should work. Note: Your answer must use a for loop. You are not allowed to use a while loop. For example: Test Result nums = [10, 20, 30] 1 print_matching_indexes (nums, 20) pets = ['dog', 'cat', 'fish', 'cat', 'dog', 'iguana'] 1 print_matching_indexes (pets, 'cat') 3 empty = [] print_matching_indexes (empty, 42)
22 Consider a hash table with size m=7, fill the following items in the table if the hash function used is (6k-5) mod m. AAB, ABA,CDF,STW,YZQ,PFG (ASCII code) . Then count the number of collisions and solve the collision ( if possible) using one of the methods studied
I have this function that works for the selection sort. I need a function that would work using the same logic for the BubbleSort and InsertionSort. void Selection_Sort(struct studentTag STUDENTS[], int nStudents){ struct studentTag s, t, temp; int i, j; for(i = 0; i < nStudents; i++) { for(j = i + 1; j < nStudents; j++) { s = STUDENTS[i]; t = STUDENTS[j]; if (strcmp(s.name.last, t.name.last) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } else if (strcmp(s.name.last, t.name.last) == 0) { if (strcmp(s.name.first, t.name.first) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } } } } }
Write a function nth_largest that takes any list of numbers num_lst and a positive integer n, and that returns the nth largest element in num_lst. For example, if lst = [-4, -5, 1, 6, 2, -7, 5], then nth_largest(lst, 2)should return 5 and nth_largest(lst, 5) should return-4.
Using list comprehensions, define functions smaller :: Int -> [Int] -> [Int] larger :: Int -> [Int] -> [Int] that return the numbers in a list that are strictly smaller and larger than a given number, e.g. smaller 3 [2,4,1,5] should return [2,1].
Python help
Consider the function fun :: Num a => [a] -> [a] fun (x:y:xs) = (x + y): (fun (y:xs)) fun _ = 0 Which is the best description of the return value (RETURNS) of fun 1? Select one alternative: O The pairs of consecutive elements of I A list of numbers that is shorter than I O A list of consecutive elements of I O Lists of consecutive elements of I O The sums of consecutive elements of I
Using Lambda expressions, write a function List getRandomSubset ( List< Integer> list) that returns a random subset of arbitrary size. All subsets (including the empty set) should be equally likely to be chosen.
Write a C function strShuffle() that takes two strings (say s1, s2) as parameters, stores into s2 first the even indexed characters of s1 then the odd indexed characters of s1. Example: if s1 is "Abcd1234", the function will make s2 as "Ac13bd24" Prototype: void strShuffle(char s1[], char s2[]);
Write a function called mutate_list() that takes a 2D-list of integers as the input parameter and performs the following mutations: a. any even integer (non-zero) gets divided by 2, b. any odd integer less than 10 gets multiplied by 10, and c. any row (an element of the 2D-list) with less than 5 elements should be padded with zeroes to exactly 5 elements. Sample run, >>> print( mutate_list( [ [1, 2, 3], [20, 3, 40, 5, 60] ] ) ) [[10, 1, 30, 0, 0], [20, 30, 40, 50, 60]] >>> print( mutate_list( [[8,5,7,2],[13,12,9,17,5],[10,20],[1,2,3,4,5,6]] ) ) [[4, 50, 70, 1, 0], [13, 6, 90, 17, 50], [5, 10, 0, 0, 0], [10, 1, 30, 2, 50, 3]]
Using Lambda expressions, write a function List getRandomSubset ( List< Integer> list) that returns a random subset of arbitrary size. All subsets (including the empty set) should be equally likely to be chosen
TRANSFORM THE C++ CODE BELOW INTO JAVA CODE. raw code:- #include<bits/stdc++.h> using namespace std; using namespace std::chrono; //method to find countries between two cities using BFS traversal vector<string > shortestpathusingbfs(map<string,vector<string> >&graph,string start,string end) { map<string,vector<string> >::iterator it; //creating a queue to store the cities queue<string> q; q.push(start); //creating a map to store the visited cities map<string,bool> visited; visited[start]=true; //creating a vector to store the path map<string,string> parent; parent[start]=""; //running a loop till the queue is empty while(!q.empty()) { //dequeing the city string s=q.front(); q.pop(); //checking if the city is the destination it=graph.find(s); if(it!=graph.end()) { //if the city is the destination vector<string>::iterator it1; for(it1=it->second.begin();it1!=it->second.end();it1++) { //checking if the city is already…