Given the fand_word) function, what function call would demonstrate the WORST case running time behaviour? 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 find_word('catnappers', 'cat') O find word('uneducated', 'cat') O find word('depricated, 'cat') fınd_word('appreciate', 'cat') O find word('flycatcher', 'cat') O it is impossible to determine

Given the fand_word) function, what function call would demonstrate the WORST case running time behaviour? 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 find_word('catnappers', 'cat') O find word('uneducated', 'cat') O find word('depricated, 'cat') fınd_word('appreciate', 'cat') O find word('flycatcher', 'cat') 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 public ABList<String> both(ABList<String> listOne, ABList<String> listTwo)that creates and returns an ABList which is contains theelements which are contained in bothlistOne andlistTwo. USE AN ITERATOR.For example, if listOne contains "blue" "purple" "pink" "white" "red" and listTwo contains "red" "pink" "black" "blue" then the function should return a list that contains "blue" "red". The items in the new list can be in any order.THIS IS A CLIENT FUNCTION OF THE ABLIST CLASS.
Find the error in each of the segments. If the error can be corrected, explain how ? short* numPtr, result;void* genericPtr{numPtr};result = *genericPtr + 7;
Find the recurrence relation of the code below and find the runtime analysis of it using any method. function mult(a, b) if b = 0: return 0 else if b is odd: return (mult(2a,[b/2 )+a) else: return (mult(2a, [b/2 ))
int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; i<n; i++) if (arr[i] >mx) mx=arr[i]; returnmx; } Can u give me the code for this one as well....this is the first function and countsort is the second
write the following usong for loops
Does it hold for lists? :Write a function holds_for_lists : ’a list -> ’b list -> (’a -> ’b -> bool) -> bool = that takes an ’a list, an ’b list, a function f: ’ a -> ’b ->bool and returns true if and only if • The two list are of the same length, and • (f a b) is true for all pairs a, b such that a is from the first list, b is from the second list, and a and b appear in the same position in their lists. (oCaml)
In this task, you will implement a recursive function all_perm(n: int) -> set[tuple[int, ...]] that takes an integer n> 0 and returns a set containing all the permutations of 1,2,3,..., n. Each per- mutation must be represented as a tuple. For example: • all_perm(1) • all_perm(2) • all_perm(3) {(1,)} {(1,2), (2,1)} == {(1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), (3,2,1)} %3D%3D Restrictions: Do not write a helper function. Your function must be recursive, and must work with sets and tuples directly. You are not allowed to import anything. Hints: Consider how we can use all_perm(2) to create the answer for all_perm(3). Perhaps the following diagram will help (pay close attention to the color coding and numbers in boldface fonts): all_perm(2) == {(1,2), (2,1)} all_perm(3) == {(3,1,2), (1,3,2), (1,2,3), (3,2,1), (2,3, 1), (2,1,3)} all_perm(4) == {(4,3,1,2), (3,4, 1,2), (3, 1, 4, 2), (3, 1,2, 4), (4, 1,3,2), (1,4,3, 2), (1,3,4,2), (1,3,2,4), (4, 1,2,3), (1,4,2,3), (1,2,4,3), (1,2,3,4),…
Implement a function void printAll(void) to print all the items of the list.
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; } } } } }
Extend this implementation with a function int getexact (counter *c) which always returns the globally exact value of the counter rather than an approximation. I typedef struct _counter_ti int pthread mutex_t lock; value; . I counter_ti • void init (counter t c) { c->value 0 Pthread mutex_init (sc->lock, NULL); void increment (counter_t c) { Pthread mutex_lock (se->lock); e->value Pthread mutex_unlock (6c->lock); 14 void decrement (counter_t c) 17 Pthread mutex_lock (6c->lock); e->value-- Pthread mutex_unlock (se->lock); * int get (counter_t c)( Pthread nutex_lock (se->lock); int re - c->value, Pthread mutex_unlock (ke->lock): return re; 15 x Precise O Approximate 10 Threads (spuooos) ou
Write a C++ class called BSTArray with five basic functions for the BST: insert, search, findmin, findmax, and print: 1. int search(x): Find and return the index that stores element x using binary search tree mechanism. Print out all the elements in the search path. You must use the binary tree search algorithm. In other words, do NOT just do a linear search of the array. If the x value is not found, report an error and return -1. 2. int findmax( ): Find and return maximum value in BST. You must use the binary tree search algorithm. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 3. int findmin( ): Find and return minimum value in BST. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 4. void print( ): Print out the BST structure in the form of an array with index. Specifically, print the index of the array and the value stored at that index starting at zero and ending at the capacity of…
Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).(Note: It is to be remembered that both the size of Arr and k are unknown.)Array index is starting from 1 not 0 [pseudo code needed]Example:Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …key: 15returned value: 5Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …key: 900returned value: -1