(i) get_index(dictionary, list) takes two input arguments, a dictionary(crime_dict) and a list of strings (keywords). This function searches if any crime typematches at least one of the keywords provided in that input list (note: keywords are notcase sensitive and any partial matches are allowed). For every valid search result, thisfunction stores the index of the crime type to another 1D-list, and finally returns this list.If no matches are found, your function should return an empty list. See sample outputsbelow.result = get_index(crime_dict, ["ar", "break", "theft"]) )print(result)[3, 4, 8, 9, 10]result = get_index(crime_dict, ["misc", "theft over", "break"]) )print(result)[6, 10, 4]result = get_index(crime_dict, ["homicide", "shooting"]))print(result)Page 7 of 10ssignment # 4Due: Nov. 27* 10:00 PM EST0) get_crimes_in_range(adict, 20list, 1Dlist, high, low) takes five inputarguments as follows, a dictionary (crime_dict), a 2D-list (database), a ID-list ofstrings (keywords), and two positive integer values, high and low, with high > low.The last argument low has a default value 0. This function searches, for any crime type thatmatches any of the given keywords, if the total number of crimes of this type falls betweenthe range (high, low] inclusive. Partial matches are allowed, and the keywords are not casesensitive. For cach such valid search, the function stores the results in a 2D-list in thefollowing format:[[crime type 1, total crimes of this type], [crime type 2, total crimesof this type], ].If there is no keyword that matches a crime type or there is no data in the given range, thislist should be empty. Your function should return this 2D-list. See the sample outputs forexamples.list = get_crimes_in_range(crime_dict, database, ["theft", "ar"], 15000,100) )display_2D1ist(list)['Theft - Motor Vehicle', 168]['Theft $5000 and Under', 4793]list = get_crimes_in_range(crime_dict, database, ["theft", "ar"], 15e0e,100) )display_2Dlist(list)['Theft - Motor Vehicle', 168]['Theft $5000 and Under', 4793]['Theft Over $5000', 96]['Arson', 10]list = get_crimes_in_range(crime_dict, database, ["theft"], 5) )display_20list(list)No data in list

Objective: This program includes a function that takes two parameters and returns a list. The method…

O get_index(dictionary, list) takes two input arguments, a dictionary (crime_dict) and a list of strings (keywords). This function searches if any crime type matches at least one of the keywords provided in that input list (note: keywords are not case sensitive and any partial matches are allowed). For every valid search result, this function stores the index of the crime type to another ID-list, and finally returms this list. If no matches are found, your function should return an empty list. See sample outputs below. result - get_index(crime_dict, ["ar", "break", "theft"]) ) print(result) (3, 4, 8, 9, 10] result = get index(crine_dict, ["misc", "theft over", "break"]) ) print(result) [6, 10, 4] result get index(crime_dict, ["homicide", "shooting"])) print(result) Page 7 of 10

O get_index(dictionary, list) takes two input arguments, a dictionary (crime_dict) and a list of strings (keywords). This function searches if any crime type matches at least one of the keywords provided in that input list (note: keywords are not case sensitive and any partial matches are allowed). For every valid search result, this function stores the index of the crime type to another ID-list, and finally returms this list. If no matches are found, your function should return an empty list. See sample outputs below. result - get_index(crime_dict, ["ar", "break", "theft"]) ) print(result) (3, 4, 8, 9, 10] result = get index(crine_dict, ["misc", "theft over", "break"]) ) print(result) [6, 10, 4] result get index(crime_dict, ["homicide", "shooting"])) print(result) Page 7 of 10

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

Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, wherelength(TAM) is the number of letters of TAM. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
NEED CODING IN PYTHON OR JAVASCRIPT BUT NOT C++ consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The…
Problem Statement: Consider an input string PAL of letters ‘P’, ‘A’, and ‘L’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called PAL_TAB. The number of each of these letters is unknown. We have a function, called SWAP(PAL, i, j), which places the ith letter in the jth entry of string PAL and the jth letter in the ith entry of PAL. Note that SWAP(PAL, i, j) is defined for all integers i and j between 0 and length(PAL) – 1, where length(PAL) is the number of letters of PAL. 1. Using our algorithmic language, write an algorithm, called Sort_PAL, which sorts the letters in the array PAL_TAB in a way that all P’s appear first, followed by all A’s, and followed by all L’s. The algorithm Sort_PAL should have one parameter: The array PAL_TAB. Also, your solution is correct only if the four constraints below are satisfied: - Constraint 1: Each letter (‘A’, ‘L’, or ‘P’) is evaluated only once. - Constraint 2: The function SWAP(PAL, i, j) is…
create this function from this written code.
3. CODE IN PYTHON For this exercise, accept a string input from the user and pass that input to a function. That function should count the letters (lowercased) of the string in a dictionary and then return that dictionary. Print out the resulting dictionary.
-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'
Functions- Write a C++ function that takes an integer argument, say n, and prints hello n times.
*********How can I ensure the Capital letters are in the right place?"** Explanation 1) Below is program that define function which accepts a text string and returns a new string constructed by finding all its vowels and reversing their order while keeping all other characters in same order It defines a function reverse_vowels returns new string with vowels reversed Create a list to store vowels in text Loop through all characters in text append the vowels in list Create a new text string to store vowels in reverse Loop through all characters in text if character is vowel pop one vowels from end and update new_text else keep the other text same return new text It has a test code which calls function reverse_vowels with multiple inputs and display new returned text 2) Save program in python file and run Program """Program that define function which accepts a text string and returns a new stringconstructed by finding all its vowels and reversing their order while…
Can you help with with the following questions, regarding population genetics and the Wright Fisher model in python? 1. Go through the given WFtrajectory function and give a short explanation of what each line of code does. Pay attention to the variables in the function and explain what they contain. 2. Make a new version of the WFtrajectory function which does exactly the same thing except that instead of appending to a list it initialises a numpy vector with zeroes and fills the vector with a for loop instead of a while loop. Make a plot of the output from a few example trajectories.
- in this exercise, please do not include and use string class. The function is using only array notation and manipulation.- string functions such as strlen is not allowed.- it should not have multiple return statements in the same function- there should be no global variable.- the function should not traverse the arrays more than once (e.g. looping through the array once only) A C++ PROGRAM named "changeCase" that takes an array of characters terminating by NULL character (C-string) and a boolean flag of toUpper. If the toUpper flag is true, it will go through the array and convert all lowercase characters to uppercase. Otherwise, it will convert all uppercase to lowercase. For example, if the array is {'H', 'e', 'l', 'l', 'o', '\0'} and the flag is true, then the array will become{'H', 'E', 'L', 'L', 'O', '\0'}. And if the flag is false, the array will become{'h', 'e', 'l', 'l', 'o', '\0'}