Question 3: ----- Write a function replace_head_tail that takes a string strl and replaces the first X and last Y characters of the string and returns the resulting string. For example, replace_head_tail("corona virus", 4, 3) returns "rusna vicoro". You can assume that the string will always contain at least X+Y characters. def replace_head_tail (stri, X, Y) : # Remove this line before you answer this question. If you will NOT answer # this question, then do NOT remove this line. return

Question 3: ----- Write a function replace_head_tail that takes a string strl and replaces the first X and last Y characters of the string and returns the resulting string. For example, replace_head_tail("corona virus", 4, 3) returns "rusna vicoro". You can assume that the string will always contain at least X+Y characters. def replace_head_tail (stri, X, Y) : # Remove this line before you answer this question. If you will NOT answer # this question, then do NOT remove this line. return

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter9: Completing The Basics

Section9.4: Character Manipulation Functions

Problem 5E

See similar textbooks

Similar questions

Write a function replace_head_tail that takes a string str1 and replaces the first X and last Y characters of the string and returns the resulting string. For example, replace_head_tail("corona virus", 4, 3) returns "rusna vicoro".
Question 3: Write a function that computes the ratio of vowels vs. consonants (????????????????��) in a given sentence. The ratio should be given as a floating-point number rounded off to two decimal places. When writing your function, be sure to appropriately cater for the following punctuation marks: apostrophes (') quotations (") full stops (.) commas (,) exclamations (!) question marks (?) colons (:) semicolons (;) Arguments: sentence (string) →→ sentence required to compute the ratio. Return: ratio (float) →→ a ratio that describes the number of vowels to consonants: vowels/consonants. ?HINT? Remember to cater for the white spaces that appear in your sentence. Expected outputs vowel_consonant_ratio("This is a random sentence!")==0.62 vowel_consonant_ratio("Thomas! Where have you been?")==0.83
7. Write a function password_check() that takes as input two stringsnewpassword and oldpassword, and that accepts the new password (i.e., returnsTrue) if newpassword is different from oldpassword and newpassword is atleast 6 letters long. If the new password fails the check, your functions should returnFalse.>>> password_check('E10-s2ff', 'E10.s2ff')True>>> password_check('E10sf', 'E10.s2ff')False>>> password_check('E10-s2ff', 'E10-s2ff')False(Extra Credit) For extra credit, extend your password function so that it also checks thatthe new password contains a digit.>>> password_check('E10-s2ff', 'E10.s2ff') True>>> password_check('Eej-sdff', 'E10.s2ff')False
Create a function that accepts a string (of a person's first and last name) and returns a string with the first and last name swapped. Examples NameShuffle("Donald Trump") - "Trump Donald" NameShuffle ("Rosie O'Donnell") - "O'Donnell Rosie" NameShuffle ("Seymour Butts") - "Butts Seymour" • There will be exactly one space between the first and last name. In c#
Please fill the blanks for C. /*getchar VS scanf*/ #include<stdio.h> #define length 70 //Putting all function headers to top __1__ print_scanf(); __2__ print_getchar(); int main() { //print 2 sentences using getchar() for(int i = 0; i < 2; i++) { print_getchar(); } //print 2 sentences using scanf() for(int i = 0; i < 2; i++) { print_scanf(); } return 0; } //Function to print using getchar void print_getchar() { __3__ str[__4__]; //create a string called str with length defined above printf("Enter your sentence for getchar:"); int i = 0; while(1) //run forever,unless there's a break or return { /*save user's input to curChar since we need to check 2 cases: Case 1. if the inputted character is a letter we save curChar to our string (array of char) Case 2. if it's a new line character.…
1. Write a function that converts a phrase into pig Latin. A word is convertedto pig Latin by removing the first character of the word, placing it at theback of the word, and adding the characters “ay” to the word. For example,“hello world” in pig Latin is “ellohay orldway.” Your function can assumethat each word consists of at least two letters and that each word is separatedby one space, with no punctuation marks.2. Write a function that counts the occurrences of a word in a string. Thefunction should return an integer. Do not assume that just one space separates words and a string can contain punctuation. Write the function sothat it works with either a String argument or a StringBuilder object.3. Write a function that takes a number, such as 52, and returns the numberas a word, as in fifty-two.4. Write a subroutine that takes a simple sentence in noun-verb-object formand parses the sentence into its different parts. For example, the sentence“Mary walked the dog” is parsed into…
14. In written text small numbers are often written out, e.g. you'd write 'I have twobrothers and one sister', rather than 'I have 2 brothers and 1 sister'. Here we want toimplement one (1?) function that helps us realize this. Write a function smallnr() thattakes a number x and if x is an integer between 0 and 6 it returns the name of thenumber, otherwise it simply returns x as a string.>>> smallnr(2)'two'>>> smallnr(0)'zero'>>> smallnr(7)'7'
3. Write a function that uses regular expressions to extract SIN numbers with either dashes or spaces between the numbers, but not any other characters. E.g. the string 'My SINs are 123-456-798 and 987 654 321, and 987/432/321' should return the list ['123-456-798', '987 654 321']
Create a function sumofAllOdd(s,e) that will return the sum of all odd numbers in a range of inputted numbers s (starting number), e(ending number). For example: Test Result sumofAllOdd(22,55) sumofAllOdd(5,10) Answer:(penalty regime: 10, 20, ... %)
How could a create a function that drops the lowest grade on this grading calculator? For example: John 100 100 0 = D Create a function to drop the lowest grade so John 100 100 (0 dropped) = A #include<iostream>#include<string>using namespace std; char getGrade(double average){ if(average>=90)return 'A'; else if(average>=80)return 'B'; else if(average>=70)return 'C'; else if(average>=60)return 'D'; else return 'F';} void sort(string lastnames[] , char grades[], int n){ for(int i=0;i<n;i++){ for(int j=0; j<n-i-1;j++){ if(lastnames[j].compare(lastnames[j+1])>0){ string temp = lastnames[j];lastnames[j]=lastnames[j+1];lastnames[j+1]=temp; char t = grades[j];grades[j]=grades[j+1];grades[j+1]=t; } } }} int main(){ int students; int s1,s2,s3; double average; cout<<"This is an automatic grade calculator. Please enter the number of students in the class:\n"; cin…
Write a function str_replace that takes three strings, str1, str2 and str3; and replaces the first occurence (if any) of str2 in str1 with str3, and returns the newly formed string. For example, str_replace("Nuclear Energy Engineering", "Nuclear Energy", "Mechanical") returns "Mechanical Engineering"
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…