.. write a function that, given a word and a set of characters, filters the all occurrences of those characters from the word. For e.g. remove_chars("abcdeeeeefmnop", "ebo") returns: acdfmnp i.e all occurrences of e, b and o have been removed from abcdeeeeefmnop You should acquire the word and set of characters both from the user and then pass them to the function. Note: std:cin terminates when it encounters a space, you should take the word and character set as separate inputs: std:cin >> word >> charset; Where word and charset are arbitrarily named variables to store the word and character set. Hint: You can use substr(i, I) function where i is the index into the string and I is the number of characters to extract. It would be easier if you stored the output in a separate variable. Write this function recursively. Do not use any loops. Hint: You will need to create a helper function (also recursive) that checks if any given letter in the word is present in the charset. This function can be prototyped as follows: bool contains(string letter, string charset) If you do the recursion properly, you will realize your code is more concise and readable

.. write a function that, given a word and a set of characters, filters the all occurrences of those characters from the word. For e.g. remove_chars("abcdeeeeefmnop", "ebo") returns: acdfmnp i.e all occurrences of e, b and o have been removed from abcdeeeeefmnop You should acquire the word and set of characters both from the user and then pass them to the function. Note: std:cin terminates when it encounters a space, you should take the word and character set as separate inputs: std:cin >> word >> charset; Where word and charset are arbitrarily named variables to store the word and character set. Hint: You can use substr(i, I) function where i is the index into the string and I is the number of characters to extract. It would be easier if you stored the output in a separate variable. Write this function recursively. Do not use any loops. Hint: You will need to create a helper function (also recursive) that checks if any given letter in the word is present in the charset. This function can be prototyped as follows: bool contains(string letter, string charset) If you do the recursion properly, you will realize your code is more concise and readable

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 that converts a phrase into pig Latin. A word is convertedto pig Latin by removing the first character of the word, placing it at theback of the word, and adding the characters “ay” to the word. For example,“hello world” in pig Latin is “ellohay orldway.” Your function can assumethat each word consists of at least two letters and that each word is separatedby one space, with no punctuation marks.
Write a function that, given a list of non-overlapping intervals of items, accepts an item as an input and decides which, if any, interval that item falls in. If the elements are integers and the intervals are 1643-2033, 5532-7643, 8999-10332, 5666653-5669321, then the question point 9122 is in the third interval and 8122 is not.
Write a C++ function, bool ok(int q[]), which takes an array q and returns true if the array represents a valid configuration of the eight queens and returns false otherwise.
Write a function find_phone_numbers(text, code='357') that uses a regex to find and extract all the Cypriot phone numbers in a given text sequence. A valid Cypriot phone number starts with either 00 or + followed by the country code 357 and afterwards, 8 numeric digits. Examples: >> find_phone_numbers("""dkdkkdldld +35799394903 dkdkfk 0035799802358 fkfkfld.\n dldld;s;sdd dkdk +30690040404 and +3579933040""") ['+35799394903', '0035799802358'] and also Write a function is_zip_code(zipcode) that uses a regex to test if a given string evaluates to a correct zip code. A correct zip code has a length of 6 characters with the 3 first being letters and followed by 3 digits. Examples: is_zip_code('ABC123') -> True is_zip_code('FYA598') -> True is_zip_code('wyz940') -> True is_zip_code('AB123') -> False is_zip_code('ABCD123') -> False is_zip_code('ABC12') -> False
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…
Write a Matlab function that will: read in the spreadsheet file, accept two textual/string arguments: first metric abbreviation/acronym (for example GP) from the list above, Second metric abbreviation/acronym (for example 3P%) from the list above, finds the player (A) who has the highest/maximum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, finds the player (B) who has the lowest/minimum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, computes FIRST METRIC average for all players, finds SECOND METRIC value for both players found above, computes SECOND METRIC average for all players,
Write a Matlab function called that will: read in the spreadsheet file, accept two textual/string arguments: first metric abbreviation/acronym (for example GP) from the list above, Second metric abbreviation/acronym (for example 3P%) from the list above, finds the player (A) who has the highest/maximum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, finds the player (B) who has the lowest/minimum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, computes FIRST METRIC average for all players, finds SECOND METRIC value for both players found above, computes SECOND METRIC average for all players.
Write a function that takes an item as an input and identifies which, if any, interval it falls in given a list of non-overlapping intervals for the item. The inquiry point 9122 lies in the third interval and 8122 lies in no interval, for instance, if the items are integers and the intervals are 1643-2033, 5532-7643, 8999-10332, and 5666653-5669321.
Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));
PLease! in c++ Write a function named “getNonNegativeSum” that takes in 4 input parameters: -a pointer to thearray of integers-its size, -the index tostart the sum from -the count of how many numbers from that starting index It will return the sum of all values from the startingindex with the number count of how many. It will add to the sum if the number in the array is positiveand skip all negative values. If there is an error in the indexor not enough numbers to count, it will return -1. For example,int numList[] = {10, 20, -1, 30}; If the starting index is 1 and the count of 3, it will return 50 If the starting index is 2 and the count of 2, it will return 30 If the starting index is -1 and the count of 2, it will return -1 If the starting index is 2and the count of 5, it will return -1.int priceList[] = {10, 20, 30, -1, 40}; If the starting index is 0, and the count is 1, it will return 10 If the starting index is 1, and the count is 3, itwill return 50 If the starting index is 0,…
Write a function that receives a vector of integers already sorted in ascending order, an integer n representing the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if it is the searched one, it returns the number of tests done so far, if it is not the searched one, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int bin_search(int array[], int n, int b){//code}
Write a function is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4