Finding the similarity between two strings, and searching for substrings in larger strings are two regularly occurring problems in computer science. For this problem you will be exploring an example of both. Write a function starting_string(str_one, str_two) that takes in two strings, and returns the common substring that begins each string. If the two strings do not begin with a common substring, return an empty string. For example, given the strings 'Episode II: Attack of the Clones' and 'Episode III: Revenge of the Sith', the starting common substring would be 'Episode II', since it's the longest string which can be found at the start of both strings with a length (10). Hints: • Be sure to avoid index out of range errors in situations where one string is longer than the other.

Finding the similarity between two strings, and searching for substrings in larger strings are two regularly occurring problems in computer science. For this problem you will be exploring an example of both. Write a function starting_string(str_one, str_two) that takes in two strings, and returns the common substring that begins each string. If the two strings do not begin with a common substring, return an empty string. For example, given the strings 'Episode II: Attack of the Clones' and 'Episode III: Revenge of the Sith', the starting common substring would be 'Episode II', since it's the longest string which can be found at the start of both strings with a length (10). Hints: • Be sure to avoid index out of range errors in situations where one string is longer than the other.

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

please code in python Write a function that receives a string and a number (n) as parameters and returns a new string that contains only every nth letter from the given string. print(everyNth('banana', 2)) # should return aaaprint(everyNth('carrot', 3)) # should return rtprint(everyNth('pear', 1)) # should return pear
Write a Boolean function called contains_whitespace() that accepts a string as a parameter and returns True if the string contains one or more whitespaces (" ", "/t", "/n") characters, or False otherwise. Write a main() function to demonstrate how it works.
Write a function is_mirror(s) that takes as input a string s and returns True if s is a mirrored string (i.e., a string that could have been produced by your mirror function) and False otherwise. Examples:>>> is_mirror('baconnocab')True>>> print(is_mirror('baconnoca'))False
Python The function f(s,ch) gets a strings and a character ch. Then it returns a string that is similar to s but does NOT have the character ch. If ch does not appear in s then the result string is equal to s. Example: f('abacadaeafaga', 'a')=='bcdefg' f('abacadaeafaga', 'A')=='abacadaeafaga' Complete the following code for the function f : def f(s, ch): return
Bartleby answered my homework and Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False. Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates. Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following. aaa has duplicatesabc has no duplicates Print a line like one of the above for each of the strings in test_dups. True needs to be defined. I tried to code it but didn't accept and got an error message.
code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“horse”, “rat”, “roar”, “dad”, “mom”], the returned value should be “dad”. Note that “mom” is also a palindrome, but it is not the first one.
Complete the scramble_text() function that takes a single string parameter text. The function returns a new string consisting of the characters in text scrambled order - every pair of characters have their positions swapped. You can assume that the parameter text will have a length of at least 1. For strings with an odd length, the last character remains unchanged in the scrambled text. Some examples of the function being called are shown below. For example: Test text = "I". print (f"{text} --scramble--> {scramble_text (text)}") text = "Hello" print (f"{text} --scramble--> {scramble_text (text)}") text = "superb" print (f"{text} --scramble--> {scramble_text (text)}") Result I --scramble--> I Hello --scramble--> eHllo superb --scramble--> usepbr
IN MAGICFS LANGUAGE The Fibonacci sequence begins like this: 0,1,1,2,3,5,8,13,21,... A number in the sequence is the sum of the previous two numbers in the sequence, with first two being 0 and 1. Implement a function named 'fibonacci' that expects a working value of an integer index, and returns the Fibonacci number at that position in the sequence. The index is zero-based. For instance, if given a value of 4, the function should return 3 because the sequence is 0, 1, 1, 2, 3, ... Use subroutines if necessary. Your answer will be evaluated for partial credit. Comments are encouraged.
Implement the following function which accepts a string as parameter and reverses it, without using any function from the string library. void strReverse(char *str)
c++ A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameter.
The international standard letter/number mapping for telephones is: Write a function that returns a number, given an uppercase letter, as follows:def getNumber(uppercaseLetter):Write a test program that prompts the user to enter a phone number as a string. The input number may contain letters. The program translates a letter (uppercase or lowercase) to a digit and leaves all other characters intact. Here is a sample run of the program: Enter a string: 1-800 flowers1-800-3569377
In C language, implement the function that gets a string str, changes all digits of str to 0 (zero), and returns the number of digits in the string. int digits_to_zero (char* str); For example: If str is "12ab0", then the function should change it to "00ab0", and return 3. If str is "abcde", then the function should keep it as is, and return 0. [Hint 1: you can check if a char is a digit using its numerical value. The numerical values of the digits are consecutive. For example, we have '3' + 2 =='5'] [Hint 2: you can also use the function isdigit (char c) implemented in the library <ctype.h> https://www.programiz.com/c-programming/library-function/ctype.h/isdigit]