10. Consider the following program, implementing binary search to look for a word in a list of words: Here we're looking for the string target, in the list list of words. def search_binary(list of_words, target, debug_print-False): "** Find and return an index of target in list_of_words # 1 and r represent the region of interest that we search over. # initially this is the whole of xs 1 - 0 r = len(list_of_words) while 1 < r: m = (1 + r)// 2 # The mid point of the interval if debug_print: print("Interval [{0}:{1}](size-{2}), probed=D'{3}', target-(4}" .format (1, r, r-1, list_of_words[m], target)) if target < list_of_words[m][0]: r = m elif target > list_of_words[m][0]: 1 - m+1 else: assert target == list_of_words[m][0] return list_of_words[m][1] return What has to be true about list of words in order for this function to find the index of the target word? You m to look at Lecture 17 for reference if this seems mysterious, Is this search function fast? Can you explain why

10. Consider the following program, implementing binary search to look for a word in a list of words: Here we're looking for the string target, in the list list of words. def search_binary(list of_words, target, debug_print-False): "** Find and return an index of target in list_of_words # 1 and r represent the region of interest that we search over. # initially this is the whole of xs 1 - 0 r = len(list_of_words) while 1 < r: m = (1 + r)// 2 # The mid point of the interval if debug_print: print("Interval [{0}:{1}](size-{2}), probed=D'{3}', target-(4}" .format (1, r, r-1, list_of_words[m], target)) if target < list_of_words[m][0]: r = m elif target > list_of_words[m][0]: 1 - m+1 else: assert target == list_of_words[m][0] return list_of_words[m][1] return What has to be true about list of words in order for this function to find the index of the target word? You m to look at Lecture 17 for reference if this seems mysterious, Is this search function fast? Can you explain why

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

10. Consider the following program, implementing binary search to look for a word in a list of words: Here we're looking for the string target, in the list list_of_words. def search_binary(list_of_words, target, debug_print=False): "*" Find and return an index of target in list_of_words # 1 and r represent the region of interest that we search over. # initially this is the whole of xs 1 = 0 r = len(list_of_words) while 1 list_of_words[m][@]: 1 = m+1 else: assert target == list_of_words[m][®] return list_of_words[m][1] return 1 What has to be true about list_of_words in order for this function to find the index of the target word? You might want to look at Lecture 17 for reference if this seems mysterious. Is this search function fast? Can you explain why?
Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.
2. Write a program in 'C' language that implements a list using array. The elements of the list are strings. Do the following operations : Add the strings "red", "blue", "oránge", "black" and "green" in positions 1, 2, 3, 4 and 5, respectively. (a) (b) Insert "yellow" at the first position. (c) Insert "purple" at the fourth position. (d) Remove "orange" from the list. (e) Print all the elements in list in the order in which they are stored.
Implement bubble sort, selection sort iteratively, and recursively. Implement linear search. Familiarize with C++ STL class vector Program Execution: The following example illustrates how your program should work. The program first reads the length of the vector (as 5 in example below), then reads this number of integers, and push them into a vector. The program then reads a command (selection, bubble, rselection, rbubble), and call the corresponding sorting function to sort the vector. The vector after being sorted will be displayed. Note that the user input are underscored. [storm:]$ g++ lab1.cpp -o lab1.exe [ storm:]$ ./lab1.exe 5 74 25 32 99 24 selection 24 25 32 74 99 [storm:]$ ./lab1.exe 317 5 23bubble 5 17 23 General Hints:* Write your main function first. * Incrementally write one function and test it before moving to the next. Please refer to the slides on how to implement these functions. 1. selection: iterative selection sort function bubble: iterative bubble…
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
USING PYTHON Chapter 5 -Programming Project: Implement a function that takes in two sorted lists and merges them into one list, the new list must be sorted. The function MUST run in O(m+n), where m is the length of list 1 and n the length of list 2. In other words, the function cannot do more than one pass on list 1 and list 2.
Write a C++ program to find the number of comparisons using binarySearch and the sequintial search algorithm as follows:Suppose list is an array of 1000 elements.1.1 Use a random number generator to fill list.1.2 Use any sorting algorithm to sort the list.1.3 Search list for some items as follows:a. Use the binary search algorithm to searcg the list. (You may need to modify the algorithm to count the number of comparisons.b. Use the binary search algorithm to search the list, switching to a sequentialsearch when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted list.)Print the number of comparisons for Questions 1.3a and b. If the item is found in the list, then print its position.
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*.
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
please code in python isupper() checks if all the letters in a string upper case. the task is to write a program that will do the same without isupper. (for this we need to create a list of letters in the upper case and check the entry of each element in the list; use if, for, all(), the program needs to show 'true /false' as a result.I am posting this question again as the previous answer did not give me the right output.
All the problems are to be coded in Python/Java. You must explicitly solve each problem below using your own logic. For example, Do not use existing library functions, such as sum( ), which computes the sum of a list. Instead, you must use for/while loop to sum up the items in a list. a. Write code for a CharList class which converts a string to a linked list of characters in the string. * b. Add a class member function which outputs if the linked list in Problem a. is a palindrome. What is the Big-O upper bound? c. What change could be made to the class definition in Problem a. to make your solution in Problem b. more efficient? Explain. What is the Big-O upper bound? Hint: Think of how the palindrome determination problem is solved for a regular string. d. Add a method to the classic List class we discussed in class that reverses the list. That is, if the original list is A -> B ->C, all of the list's links should change so that C-> B-> A. Make your solution as efficient as possible.…
C Language Write a program to take two numerical lists of the same length ended with sentinel value and store the lists in array X and array Y, each of which has 20 elements. Let N be the actual number of data values in each list. Store the product of corresponding elements of array X and array Y into third array Z of size 20. Display the square root of the sum of the items in array Z. Make up your own data and be sure to test your program on at least one data set with number exactly 20 items.