In your reading you'll find pseudocode for finding one C-string inside another. Use that code to count the number of times that s2 appears inside the C-string sl. cstrings.cpp 1 /** Count the number of times that s2 appears in sl. @param sl the string to search through. @param s2 the substring to search for. @return the number of times s2 appears in sl. 2 3 4 5 6 */ int countCopies(const char* s1, const char* s2) { int count{0}; 7 10 11 12 13 return count; 14

In your reading you'll find pseudocode for finding one C-string inside another. Use that code to count the number of times that s2 appears inside the C-string sl. cstrings.cpp 1 /** Count the number of times that s2 appears in sl. @param sl the string to search through. @param s2 the substring to search for. @return the number of times s2 appears in sl. 2 3 4 5 6 / int countCopies(const char s1, const char* s2) { int count{0}; 7 10 11 12 13 return count; 14

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

Two String values are passed as input. Find if the second string s2 is a substring of the first strings1. If it is, print the index of the first occurrence.Else print -1.Inputmake123India123Output4*/#include<iostream>#include<string.h>using namespace std;int isSubstring(string s1, string s2) { int temp,j; for(int i=0;s1[i]!='\0';i++) { j=0; if(s1[i]==s2[j]) { temp=i+1; while(s1[i]==s2[j]) { i++; j++; } if(s2[j]=='\0') { return temp-1; } else { i=temp; temp=0; } } } if(temp==0) return -1;} int main(int argc, char const *argv[]){ string s1,s2; getline(cin,s1); getline(cin,s2); int res = isSubstring(s1,s2); if(res==-1) cout<<res; else cout<<"Found at index: "<<res;.
Code_Program to check if strings are rotations of each other or not? Approach Create a temp string and store concatenation of str1 to str1 in temp. temp = str1.str1 If str2 is a substring of temp then str1 and str2 are rotations of each other. Example:str1 = "ABACD" str2 = "CDABA".
Design an algorithm or function to find the longest substring which contains 2 unique characters in a given string. You may list steps or psuedo code. Example: In the string "abaacacaacda" return "aacacaac"
Return the smallest number of steps it takes to convert a string entirely into uppercase or entirely into lower case, whichever takes the fewest number of steps. A step consists of changing one character from lower to upper case, or vice versa. Examples stepsToConvert("abC") → 1 // "abc" converted to "abc" in 1 step steps ToConvert("abCBA") → 2 // "abCBA" converted to "ABCBA" in 2 steps stepsToConvert("aba") → 0 steps ToConvert("abaCCC") -3
hideshow Write a function hideshow that accepts two string arguments, an input string and a masking string. The masking string is a string consisting of '0's and '1's that has the same length as the input string. The function then returns a new string that is the same as the input string, except that it is masked. That is, in any position where the masking string contains a '0' the input character is replaced by a '#', whereas if the masking string contains a '1', the character is unchanged. Sample usage: >>> hideshow('apple', '11001') 'ap##e' >>> hideshow('apple', '00000') '#####' >>> hideshow('apple', '11111') 'apple' >>> hideshow('abcdefghijklmnopqrstuvwxyz', 13*'01') '#b#d#f#h#j#1#n#p#r#t#v#x#z' >>> hideshow 'df###re##', '101010101' ) 'd#####e##' >>> hideshow( 'df###re%%', '101010101' )=='d#####e##' True
LAB WORK How can I check whether the user entered string is palindrome or not? If it is a palindrome, print 1 else print 0. In Java Programming language.
Q1: Write a program that asks the user to enter their first name and their last name,separated by a space. Break the input string up into two strings, one containing thefirst name and one containing the last name. You can do that by using the indexOf()subroutine to find the position of the space, and then using substring() to extracteach of the two names. Also output the number of characters in each name andoutput the user’s initials. (The initials are the first letter of the first name togetherwith the first letter of the last name.) A sample run of the program should looksomething like this:Please enter your first name and last name, separated bya space.? Mary SmithYour first name is Mary, which has 4 charactersYour last name is Smith, which has 5 charactersYour initials are MS
PART F: MIDDLE TWOGiven a string str, print out a string made of the middle two chars. Assume the string length is at least 2 and iseven.Methods to use: substring(), length()Testing cases: string => ri code => od Practice => ct ab => ab 0123456789 => 45
To convert int to String we use Integer.toString() Integer.parselnt() int() Integer()
Return the smallest number of steps it takes to convert a string entirely into uppercase or entirely into lower case, whichever takes the fewest number of steps. A step consists of changing one character from lower to upper case, or vice versa. Examples stepsToConvert("abC") → 1 // "abc" converted to "abc" in 1 step steps ToConvert("abCBA") → 2 // "abCBA" converted to "ABCBA" in 2 steps stepsToConvert("aba") → 0 steps ToConvert("abaCCC") -3
Write a function that accepts a pointer to an integer array and the array's size as arguments. The function should allocate a new array, copy the items from the original array to the new one in reverse order, and then deallocate the original array.
WHNAVAWNS