Answered: string ToUpper(const string& phrase){…

string ToUpper(const string& phrase){ string retVal phrase; for (size_t i = 1; i < phrase.length(); i++) retVal[i] = toupper(retVal[i]); %3D return retVal; }

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

String Manipulation In this question, you will be implementing the following functions int findChar(char * str, char c); Searches for the character c in the string str and returns the index of the character in the string. If the character does not exist, returns -1 int replaceChar(char * str, char c1, char c2); Searches for the character c1 in the string str and if found, replace it with c2.The function returns the number of replacements it has performed. If the character does not exist, returns 0. int removeChar(char * str1, char * str2, char c); Creates a copy of str1 into str2 except for the character c that should be replaced with ‘*’ For example, if str1=”Hello World” and c=’l’ then the function should make str2=”He**o Wor*d” int isPalindrome(char * str) Checks to see if a string is Palindrome(reversible). If it is, returns 1, otherwise returns 0. A palindrome string reads similarly from left to right and from right to left like madam, level, radar, etc. int reverseString(char…
Probelm part 1: Define a function called common_divisors that takes two positive integers m and n as its arguments and returns the list of all common divisors (including 1) of the two integers, unless 1 is the only common divisor. If 1 is the only common divisor, the function should print a statement indicating the two numbers are relatively prime. Otherwise, the function prints the number of common divisors and the list of common divisors. Complete each to do with comments to expalin your process. Problem part 2: complete the following todo's and make comments to explain each step # TODO: Define the function 'common_divisors' with two arguments 'm' and 'n'. # TODO: Start with an empty list and append common divisors to the list. # TODO: Create a conditional statement to print the appropriate statement as indicated above. Problem part 3: Call the function common_divisors by passing 5 and 38. Your output should look like this: 5 and 38 are relatively prime. # TODO: Call…
C Programming Language Write a function that takes 2 strings, word1 and word2 as parameters. The function must return if,starting from word1, by only deleting some characters you can get word2.Example: word1: pineapple and word2:nap result: true; word1: orange, word2: one; results: true;word1: cyberspace; word2: peace, result: false
In C programming language Question (Strings) Write a function find_Substring() that finds a substring into a string. Pass array s1 and s2 to this function and prints if the substring is present or not. Expected Output 1: Enter string This is a javascript Enter substring script The substring is present Expected Output 2: Enter string This is a javascript Enter substring Jscript The substring is not present
Complete the zero_extend_number() function that takes two parameters: • The integer parameter number which represents the number that needs to be zero-extended • The integer parameter length which represents the length of the number string that the function needs to return. The function returns a string representation of the parameter number with the length specified by the parameter length. If the number of digits in number is less than the length, then the function will need to zero-extend number by appending the required number of zeroes to the front of it. You can assume that the parameter length will always be greater than or equal to the number of digits in number. Some examples of the function being used are shown below: For example: Test Result print(zero_extend_number (1, 5)) 00001 print(zero_extend_number(10, 4)) 0010 Answer: (penalty regime: 0 %) Reset answer 1 v|def zero_extend_number(number, length):
vowelIndex Write a function vowelIndex that accepts a word (a str) as an argument and returns the index of the first vowel in the word. If there is no vowel, -1 is returned. For this problem, both upper and lower case vowels count, and 'y' is not considered to be a vowel. Sample usage: >>> vowelIndex('hello') 1 >>> vowelIndex('string') 3 >>> vowelIndex('string') 3 >>> vowelIndex('BUY') 1 >>> vowelIndex('APPLE') 0 >>> vowelIndex('nymphly') -1 >>> vowelIndex('string')==3 True >>> vowel Index ('nymphly')==-1 True
Instructions: In the code editor, you are provided with a main() function that asks the user for a string and passes this string and the size of this string to a function call of the function, preserveString(). This preserveString() function has the following description: Return type - void Name - preserveString Parameters The string Length of the string Description - this is a recursive function that prints the string repeatedly. Each time it prints the string, it excludes the last character of the string until only one character is left. This preserveString() function has already been partially implemented. Your only task is to add the recursive case of this function. Please Finish the code ASAP: This is my current given code: #include<stdio.h>#include<string.h> #define STR_MAX_SIZE 100 void preserveString(char*, int); int main(void) { char str[STR_MAX_SIZE]; printf("Enter string: "); fgets(str, STR_MAX_SIZE, stdin); preserveString(str,…
C code blocks Implement a function which receives a character array and determines if the word is a palindrome or not. A palindrome is a string that is spelt the same way forwards and backwards (see the example below). The function should return 1 if the character array is a palindrome and 0 if it is not. Write the entire function in the space below. Your answer should not include the function prototype, the main function or any include statements. The function should not contain any printf statements. Define your function in the same way as the given function prototype. Function prototype: int palindrome(char a[]); For example: Input Result hello 0 radar 1 acca 1
def function_1(a,b): c = (a * b) return c
mplement a function gct according to these guidelines: The function accepts a single positive integer which represents a number of tablespoons of a liquid. You may assume that this number is always between 0 and 25599 (inclusive of both). The function returns a formatted str containing an equivalent number of gallons, cups andtablespoons. The answer should use as many gallons, then cups as possible. For example:gct(312) would return '01g,03c,08t' as 312 tablespoons is equivalent to 1 gallon, 3 cups, and 8 tablespoons. Each of the output quantities (gallons, cups, tablespoons) should occupy two digits. If the values have less than two digits, they should be padded with leading zeroes. I.e., 2 cups is represented by '02c' .
Code using C++ language Write the definition of a function named isSorted that receives three arguments: an array of int, an int that indicates the number of elements of interest in the array, and a bool.If the bool argument is true then the function returns true if and only if the array is sorted in ascending order. If the bool argument is false then the function returns true if and only if the array is sorted in descending order. In all other cases the function returns false.You may assume that the array has at least two elements.
Consider the following function. int my_func(int a) { return(a+3); } If the function is called using my_func(5), what will the function return?