This function should reverse the words in a string. A word can be considered to be any characters, including punctuation, separated by spaces (only spaces, not tabs, \n etc.). So, for example, if s is “The Giants won the Pennant!” the function should change s to “Pennant! the won Giants The” void reverseWords(char *s)

This function should reverse the words in a string. A word can be considered to be any characters, including punctuation, separated by spaces (only spaces, not tabs, \n etc.). So, for example, if s is “The Giants won the Pennant!” the function should change s to “Pennant! the won Giants The” void reverseWords(char *s)

COMPREHENSIVE MICROSOFT OFFICE 365 EXCE

1st Edition

ISBN:9780357392676

Author:FREUND, Steven

Publisher:FREUND, Steven

Chapter3: Working With Large Worksheets, Charting, And What-if Analysis

Section: Chapter Questions

Problem 2.2EYK

See similar textbooks

Similar questions

Create a function that takes a number (int) and returns a corresponding string of dashes. Examples: num_to_dashes(1) ➞ "-" num_to_dashes(5) ➞ "-----" num_to_dashes(3) ➞ "---"
In the space below, write a function Def countVowels(wordPhrase): that returns a count of all vowels in wordPhrase. Vowels are the letters a, e, i, o, u, and their uppercase variants.
The following functions are all intended to check whether a string representing a dna sequence contains any characters that are not 'a','c','g','t', 'A', 'C', 'G', or 'T'. At least some of these functions are wrong. Which ones are correct? A) def valid_dna1(dna): for c in dna: if c in 'acgtACGT': return True else: return False B) def valid_dna3(dna): for c in dna: flag = c in 'acgtACGT' return flag C) def valid_dna4(dna): for c in dna: if not c in 'acgtACGT': return False return True -------------------------------------------------------------------------------------------------------------------------------------------------------- valid_dna1 only valid_dna4 only None of them. valid_dna1, and valid_dna4 only
C++ is my answer correct ? Write a function to convert a given string : Answer: #include <iostream> #include <string> using namespace std; void toUpper(string &str) { for (int i = 0; i < str.length(); i++) { str[i] = toupper(str[i]); } } void toLower(string &str) { for (int i = 0; i < str.length(); i++) { str[i] = tolower(str[i]); } } int main() { string str = "khaled"; toUpper(str); cout << str << endl; str = "MOHAMMED"; toLower(str); cout << str << endl; return 0; } Write a function to calculate the sum of the even number from 1 - 100. Answer: #include <iostream> using namespace std; int sumEven() { int sum = 0; for (int i = 1; i <= 100; i++) { if (i % 2 == 0) { sum += i; } } return sum; } int main() { cout << sumEven() << endl; return 0; }
Write a function that returns true if the two provided license plates strings are visually similar. For this test, we will only need to consider the 26 English uppercase characters A to Z and the digits 0 to 9. def similar_license_plates(plate1: str, plate2: str) -> bool: return False
Write a function to determine whether a string is a permutation of a palindrome given a string. A word or phrase that reads the same both forward and backward is known as a palindrome. Letters are rearranged in a permutation. The palindrome need not contain only words from dictionaries. EXAMPLEInput: Tact CoaOutput: True (permutations: "taco cat'; "atco eta·; etc.)
In C language, Write a function that gets a string containing a positive integer. The function subtracts 1 fromthat integer and puts the obtained value in the string. void str_subtract_one(char* num); For example:- if before we call str_subtract_one(str) we have str==“1997”, then after return str will be “1996”.- if before we call str_subtract_one(str) we have str==“12345678987650”, then after return str will be “12345678987649”.- if before we call str_subtract_one(str) we have str==“100”, then after return str will be “99”. 1. You may assume that the input is always legal, i.e., the string is a positive integer correctly formatted.2. Note that the numbers may be larger than the maximum of int or long. That is, you should not try to convert string to int
Question 6 # This function checks whether a given number is even or not def isEven(number): """ what it takes? a number what it does? determines if a number is even what it returns? if even, return 1 if odd, return -1 """ # your code goes in here defisEven(number): #check if the number is divisible by 2 by checking the remainder. if number % 2==0: #If remainder is 0, then its divisble by 2 and an even number #hence return-1 return1 else: #if remainder is not 0, it'll be 1, so its NOT divisible by 2 and its an odd number #hence return -1 return-1 Test case for question 6 try: if isEven(5) == -1: score['question 6'] = 'pass' else: score['question 6'] = 'fail' except: score['question 6'] = 'fail' isEven(5)
is it correct ? Write a function to change all the upper case to lower case in a given string. Answer: #include <iostream> #include <string> using namespace std; string toLowerCase(string str) { for (char& c : str) { if (isupper(c)) { c = tolower(c); } } return str; } int main() { string str = "HI, MY NAME IS KHALED MOHAMMED!"; cout << toLowerCase(str) << endl; return 0; }
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#
To translate a sentence into pig Latin, create a function. When a word is written in pig Latin, its first character is dropped, shifted to the word's tail, and the letters "ay" are added. For instance, "hello world" would be "ellohay orldway" in pig Latin. Your function can be written to assume that each word has at least two characters, is separated by a space, and is free of punctuation.
In Python, program a function named wordsCount with the following header (hint, use the "find" function): # wordsCount: str str -> int# receives two strings: a lowercase phrase and a lowercase word.# count the number of occurrences of the word in the phrase.# example: wordsCount("abracadabra","ab") return 2# example: wordsCount("tangananicatanganana", "an") return 6# example: wordsCount("aaaaaaaaaa", "aa") return 9def wordsCount(phrase, word):...