**6.43 (Check substrings) Write the following function to check whether string sl isa substring of string s2. The function returns the first index in s2 if there is amatch. Otherwise, return -1.int index0f (const string& s1, const string& s2)Write a test program that reads two strings and checks whether the first string isa substring of the second string. Here is a sample run of the program:Enter the first string: welcome -EnterEnter the second string: We welcome you! -Enterindex0f ("welcome", "We welcome you!") is 3Enter the first string: welcomeEnter the second string: We invite you!index0f ("welcome", "We invite you!") is -1JEnter- Enter

Program: // C++ Version 114#include <iostream>#include <string> using namespace std; //…

Answered: int index0f (const string& s1, const…

Engineering

Computer Science

int index0f (const string& s1, const string& s2)

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

6.40 (Binary to Octal) Write a function that returns an octal number from a binary number. The function header is as follows: int bin20ctal(const string& binaryString) Write a test program that prompts the user to enter a binary number as a string and displays the corresponding octal value as a string.
Thank you
17.37 PRACTICE: Vectors**: Longest sequence C++ A common statistic of interest is the longest sequence of some pattern in a list of items. For example, in football, one may be interested in the longest sequence of consecutive complete passes. Given a list in which each item is either the letter "I" (for an incomplete pass) or a number (for a completed pass), output the length of the longest sequence of complete passes. The list is preceded by the number of items. Given 8 4 15 9 I 30 2 I 20, the output is 3 (because the longest sequence of complete passes is 4 15 9). Hints: Use two variables, one that keeps track of the current sequence length, and another for the longest sequence length. In a for loop that iterates through the vector, if you see an "I", set the current sequence length to 0. Otherwise, you are in sequence (either at the beginning or later in the sequence), so increment the current sequence length. A simple way to compute the longest sequence is to…
8.28 LAB: Check if list is sorted Write the in_order() function, which has a list of integers as a parameter, and returns True if the integers are sorted (in order from low to high) or False otherwise. The program outputs "In order" if the list is sorted, or "Not in order" if the list is not sorted. Ex: If the list passed to the in_order() function is [5, 6, 7, 8, 3], then the function returns False and the program outputs: Not in order Ex: If the list passed to the in_order() function is [5, 6, 7, 8, 10], then the function returns True and the program outputs: In order Note: Use a for loop. DO NOT use sorted() or sort(). this is the code im supposed to use def in_order(nums): # Type your code here. if __name__ == '__main__': # Test out-of-order example nums1 = [5, 6, 7, 8, 3] if in_order(nums1): print('In order') else: print('Not in order') # Test in-order example nums2 = [5, 6, 7, 8, 10] if in_order(nums2): print('In…
17.37 PRACTICE: Vectors**: Longest sequence C++ A common statistic of interest is the longest sequence of some pattern in a list of items. For example, in football, one may be interested in the longest sequence of consecutive complete passes. Given a list in which each item is either the letter "I" (for an incomplete pass) or a number (for a completed pass), output the length of the longest sequence of complete passes. The list is preceded by the number of items. Given 8 4 15 9 I 30 2 I 20, the output is 3 (because the longest sequence of complete passes is 4 15 9). Hints: Use two variables, one that keeps track of the current sequence length, and another for the longest sequence length. In a for loop that iterates through the vector, if you see an "I", set the current sequence length to 0. Otherwise, you are in sequence (either at the beginning or later in the sequence), so increment the current sequence length. A simple way to compute the longest sequence is to…
8.28 LAB: Check if list is sorted Write the in_order() function, which has a list of integers as a parameter, and returns True if the integers are sorted (in order from low to high) or False otherwise. The program outputs "In order" if the list is sorted, or "Not in order" if the list is not sorted. Ex: If the list passed to the in_order() function is [5, 6, 7, 8, 3], then the function returns False and the program outputs: Not in order Ex: If the list passed to the in_order() function is [5, 6, 7, 8, 10], then the function returns True and the program outputs: In order Note: Use a for loop. DO NOT use sorted() or sort().
6.13 (Rounding Numbers) An application of function floor is rounding a value to the nearest integer. The statement y = floor( x + 0.5 ); rounds the number x to the nearest integer and assigns the result to y. use c++ to Write a program that reads several numbers and uses the preceding statement to round each of these numbers to the nearest integer. For each number processed, print both the original number and the rounded number.
11.25 (Python please) (Markov matrix) An n * n matrix is called a positive Markov matrix if each element is positive and the sum of the elements in each column is 1. Write the following function to check whether a matrix is a Markov matrix: def isMarkovMatrix(m): Write a test program that prompts the user to enter a 3 * 3 matrix of numbers and tests whether it is a Markov matrix. Here are sample runs:
8.16 (Searching for Substrings) Write a program that inputs a line of text and a search string from the keyboard. Using function strstr, locate the first occurrence of the search string in the line of text, and assign the location to variable searchPtr of type char *. If the search string is found, print the remainder of the line of text beginning with the search string. Then, use strstr again to Locate the next occurrence of the search string in the line of text. If a second occurrence is found, print the remainder of the line of text beginning with the second occurrence. [Hint: The second call to strstr should contain searchPtr + 1 as its first argument.] Solve without using pointers
17.54 PRACTICE: Functions***: Output guitar tabs C++ An earlier problem introduced guitar tabs. In this problem, the user can enter a sequence of chords, and the program should output the tabs in sequence. The first input is the number of chords to follow. If the input is 4 G C G D, the output should be: e|-3-0-3-2- B|-0-1-0-3- G|-0-0-0-2- D|-0-2-0-0- A|-2-3-2--- E|-3---3--- Hints: Use 6 C++ strings, one for each guitar string ("string" below will mean C++ string unless otherwise noted). Start by the e string with "e|-", the B string with "B|-", etc. For each user chord, append (using append()) to each string the appropriate item (a number or -) plus -, like "2-". When done, print the 6 strings one at a time separated by newlines.
8.10 (Appending Part of a String) Write a program that uses function strncat to append part of a string to another string. The program should input the strings, and the number of characters to be appended, then display the first string and its length after the second string was appended. **Note:solve the questions without using pointers
***6.45 (Current year, month, and day) Write a program that displays the current year, month, and day using the time(0) function. Here is a sample run of the program: The current date is May 17, 2012