Task Given a string str and one of its character ch, the coverage of ch is computed as the number of elements between its leftmost and rightmost appearances (inclusive). For example, if str="babaac" and ch='a' then its leftmost and rightmost appearances occur at indices 1 and 4, respectively. Thus, the coverage of ch is 4. In this example, if ch= 'b' then its coverage is 3 since its leftmost and rightmost appearances occur at indices 0 and 2. Also, if ch='c', its coverage is 1. Write a function named findMaxCoverage that ● takes a string (str) and its size (n) as given below int findMaxCoverage (char str[], int n) . returns the maximum coverage in str. For example, ● if str "babaac", then the call findMaxCoverage (str, 6) should return 4, since this is the maximum of all character coverages found in the string, i.e., coverage of 'a' is 4, coverage of 'b' is 3, coverage of 'c' is 1. • if str="abcdefg", then the call findMaxCoverage (str, 7) the function should return 1 since all characters have coverage 1. [NOTE] Do NOT change the function return type or its parameters. . Your solution must be prepared using file template.c

Task Given a string str and one of its character ch, the coverage of ch is computed as the number of elements between its leftmost and rightmost appearances (inclusive). For example, if str="babaac" and ch='a' then its leftmost and rightmost appearances occur at indices 1 and 4, respectively. Thus, the coverage of ch is 4. In this example, if ch= 'b' then its coverage is 3 since its leftmost and rightmost appearances occur at indices 0 and 2. Also, if ch='c', its coverage is 1. Write a function named findMaxCoverage that ● takes a string (str) and its size (n) as given below int findMaxCoverage (char str[], int n) . returns the maximum coverage in str. For example, ● if str "babaac", then the call findMaxCoverage (str, 6) should return 4, since this is the maximum of all character coverages found in the string, i.e., coverage of 'a' is 4, coverage of 'b' is 3, coverage of 'c' is 1. • if str="abcdefg", then the call findMaxCoverage (str, 7) the function should return 1 since all characters have coverage 1. [NOTE] Do NOT change the function return type or its parameters. . Your solution must be prepared using file template.c

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

The mapped list pattern Our second pattern is the mapped list pattern, described in video 4 3 mapped list pattern. Often we need to write a function that takes a list as a parameter and returns a new list in which each item in the original list is "mapped" to a new item in the result list. For example, the following function takes a list of numbers as a parameter and returns a list of all the numbers squared, e.g. squares ( [1, 3, 7]) returns [1, 9, 49]. def squares (nums): "Returns the squares of the given numbers""" result = [] for num in nums: result.append (num * num) return result Although this is just a special case of the accumulator pattern, it is so common that we give it its own name: the mapped list pattern. Consider the following function: def squares(nums): ""Returns the squares of the given numbers""" result = [] for num in nums: result.append (num * num) return result If the main program calls print(squares ( [5, -3, 2, 7]) what is the state table for the function…
card_t * moveCardBack (card t *head); The moveCardBack function will take the card in front of the pile and place it in the back. In coding terms, you are taking the head of the linked list and moving it to the end. The function has one parameter which is the head of the linked list. After moving the card to the back, the function returns the new head of the linked list.
Allow student to insert one arbitrary string. Save the letters of the string into a list. Design and perform the following tasks and display your results: • Summarizing letters in a string. Write a function that receives a string and returns a list of tuples containing the unique letters and their frequencies in the string. Test your function and display each letter with its frequency. Your function should ignore case sensitivity (that is, 'a' and 'A' are the same) and ignore spaces and punctuation. When done, write a statement that says whether the string has all the letters of the alphabet. • Present descriptive statistics and graphs about the string data. • Sorting letters in different order and removing duplicates • Write a code that produces anagrams of a given string. An anagram of a string is another string formed by rearranging the letters in the first. program must accept inputs from a user, performs an operation using a userdefined function which will accept parameters and…
Q1. Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b): """Finds if `str_a` matches `str_b` Keyword arguments: str_a -- string str_b -- string """ len_a, len_b = len(str_a) + 1, len(str_b) + 1 matches = [[False] * len_b for _ in range(len_a)] # Match empty string with empty pattern matches[0][0] = True # Match empty string with .* for i, element in enumerate(str_b[1:], 2): matches[0][i] = matches[0][i - 2] and element == '*' for i, char_a in enumerate(str_a, 1):…
Q1: Assignment Difficulty Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers a. The i-th problem’s difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list a is any list you can obtain…
hi I really need help with this assignment problem flip_matrix(mat:list)->list You will be given a single parameter a 2D list (A list with lists within it) this will look like a 2D matrix when printed out, see examples below. Your job is to flip the matrix on its horizontal axis. In other words, flip the matrix horizontally so that the bottom is at top and the top is at the bottom. Return the flipped matrix. To print the matrix to the console: print('\n'.join([''.join(['{:4}'.format(item) for item in row]) for row in mat])) Example: Matrix:W R I T XH D R L GL K F M VG I S T CW N M N FExpected:W N M N FG I S T CL K F M VH D R L GW R I T X Matrix:L CS PExpected:S PL C Matrix:A D JA Q HJ C IExpected:J C IA Q HA D J
Question 1 5 pts A regular expression is shorthand for a set of strings. For example (b+ba)* ba (a+ab)* represents a set of strings for which the first two elements (when listed in length order with same length strings listed in alphabetical order) are: ba and baa. What are the next three strings in this sequence? Next string: Next after that: Next after that:
1c) Average sentence length We will create a function (avg_sentence_len) to calculate the average sentence length across a piece of text. This function should take text as an input parameter. Within this function: sentences: Use the split() string method to split the input text at every '.'. This will split the text into a list of sentences. Store this in the variable sentences. To keep things simple, we will consider every "." as a sentence separator. (This decision could lead to misleading answers. For example, "Hello Dr. Jacob." is actually a single sentence, but our function will consider this 2 separate sentences). words: Use the split() method to split the input text into a list of separate words, storing this in words. Again, to limit complexity, we will assume that all words are separated by a single space (" "). (So, while "I am going.to see you later" actually has 7 words, since there is no space after the ".", so we will assume the this to contain 6 separate words in our…