Write the following function to check whether string s1 is a substring of string s2. The function returns the first index in s2 if there is a match. Otherwise, return -1. int indexOf(const string& s1, const string& s2) Write a test program that reads two strings and checks whether the first string is a substring of the second string.

Write the following function to check whether string s1 is a substring of string s2. The function returns the first index in s2 if there is a match. Otherwise, return -1. int indexOf(const string& s1, const string& s2) Write a test program that reads two strings and checks whether the first string is a substring of the second string.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

Write a function that reverses a string. The header of the function is: def reverse(s):Write a test program that prompts the user to enter a string, invokes the reverse function, and displays the reversed string.
Write a function that returns a binary string from an octal number. The function header is as follows: string octal2Binary(const int& octalNumber) Write a test program that prompts the user to enter an octal number, uses octal- 2Binary function to parse it into an equivalent binary string and displays the binary string.
Complete the check_strings_same_start(word1, word2) function which is passed two string parameters. The function returns True if the two parameter strings start with the same character and only one (not both) of the parameter strings has an even number of characters (including any space characters), otherwise the function returns False. For example: Test Result result = check_strings_same_start("blue", "bag") True print(result) print(check_strings_same_start("babyproofing", "baby")) False print(check_strings_same_start("check", "fact")) False
Write a function that finds the number of occurrences of a specified character in a string using the following header:def count(s, ch):The str class has the count method. Implement your method without using the count method. For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character and displays the number of occurrences of the character in the string.
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)
4. Complete the function show_upper. This function takes one parameter - a string (s). It should return a string made up of all the upper-case characters in s. For example, if s is “aBdDEfgHijK” then show_upper should return “BDEHK”. It should return the upper-case string - not print it. Do not change anything outside show_upper.
Topics: User-defined functions, list, string, docstringProblem Statement: This program finds the unique letters from a given string and printsthe unique letters and their count. For example: word ‘LITTLE’ has ‘L’, ‘I’, ‘T’, ‘E’ are theunique letters.Lab Scenario:The program repeats until hits ‘n’. The program takes a user input of a string. The programfinds the unique letters in the string, add them in a list and displays the list and their count.Consider the following important points:1) You need to design a user-defined function named count_unique_letters whichtakes user word as parameter and returns the list of unique letters calledunique_letters in the given word.a. Hint: Iterate over each letter in user word, check if the letter is in the list, if notadd it to the list, otherwise continue to the next letter. A ‘in’ keyword can helpto determine if a character in the unique_letters list.b. You need to write a simple docstring for this function.2) Your program must have a main()…
Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams.
Write a function that searches for a particular character in a string using the following header: void search(string& s, char& key) Write a test program that prompts the user to enter the string and a character and displays if the character is found.
Here is a function that is supposed to return True if word (any string) ends with "s" and False otherwise: def ends_with_s(word):if len(word) < 1:return False return word[-1] == "s" Here is the test function I am using to test ends_with_s: def test_ends_with_s(): assert(ends_with_s("cats")) # option 1 assert(ends_with_s("") is False) # option 2 assert(ends_with_s("apple") is False) # option 3 assert(ends_with_s("S")) # option 4 Rewrite ends_with_s so that the test passes
Write a function that counts the occurrences of a specified non-overlapping string s2 in another string s1 using the following header:def count(s1, s2):For example, count("system error, syntax error", "error") returns 2. Write a test program that prompts the user to enter two strings and displays thenumber of occurrences of the second string in the first string.
Task 2: Implement the function Searchingstrings that allow to search a sub-string in a given string and display the: First occurrence, Last occurrence, First occurrence from a given index and Last occurrence from a given index. You can use the following String methods: string. IndexOf(searchvalue, start) return the position of the first occurrence of specified character(s) in a string. string.lastIndexOf(searchvalue, start) return the position of the last occurrence of specified character(s) in a string. You can use the following string to test your solution: var letters = "abcdefghijklmnopqrstuvwxyzabcdefghijklm"; Write the code in a separate.js and separate.html file.