Develop a WCF-REST Web service that takes a string (without spaces) as a parameter and performs following analysis of the string. The service contains two operations: string reverse(string str); // return the original string in the reverse order. int someOfDigits(int number) // return sum of digits in the integer value. for example, if the input number is 1234, sum of digits is 1+2+3+4 = 10

Develop a WCF-REST Web service that takes a string (without spaces) as a parameter and performs following analysis of the string. The service contains two operations: string reverse(string str); // return the original string in the reverse order. int someOfDigits(int number) // return sum of digits in the integer value. for example, if the input number is 1234, sum of digits is 1+2+3+4 = 10

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

PHP Write a matchIPAddress function Write a function matchIPAddress($str) that takes a string representing an IP address as a parameter. The function should return true if the IP address is valid, and false if it is not. An IP address consists of a series of 4 numbers on the range 0-255 separated by dots (e.g. 192.168.0.1). Use regular expressions with capture groups and some additional validation in your solution (e.g. preg_match).]
write the following as a function that takes in a string and returns a string. for (int i=0; i != user_string. size(); i++){ if (islower(user_string[i])){ user_string[i]=toupper(user_string[i]); } elseif(isupper(user_string[i])){ user_string[i]=tolower(user_string[i]); } } cout<<user_string; return0; }
in python pls
Java - Text Message Expander
In python: Implement the get_num_of_non_WS_characters() function. get_num_of_non_WS_characters() has a string parameter and returns the number of characters in the string, excluding all whitespace. Implement the get_num_of_words() function. get_num_of_words() has a string parameter and returns the number of words in the string
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…
Write a JavaScript function that would accept a string and returns its letters in alphabetical order. alphabet("CSIT201") - returns "012CIST"
Ex: Use getline() to get a line of user input into a string. Output the line. Enter text: IDK if I'll go. It's my BFF's birthday. You entered: IDK if I'll go. It's my BFF's birthday. Search the string (using find()) for common abbreviations and print a list of each found abbreviation along with its decoded meaning. Ex: Enter text: IDK if I'll go. It's my BFF's birthday. You entered: IDK if I'll go. It's my BFF's birthday. BFF: best friend forever IDK: I don't know Support these abbreviations: BFF -- best friend forever IDK -- I don't know . JK -- just kidding TMI -- too much information TTYL-talk to you later 1 #include 2 // FIXME include the string Library 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } /* Type your code here. */ return 0; main.cpp
Write a Java program to count the number of occurences of a temp_string in a String. Assume the length of temp_string should be less or equal to String. You have to take the temp_string & String from the user.
Define a function FilterStr() that takes a string parameter and returns "Acceptable" if the first character and the character at index 3 in the string parameter are the same. Otherwise, the function returns "Unacceptable". Ex: FilterStr("surfing") returns Unacceptable Recall string's at() returns a character at the specified position in the string. Ex: myString.at(3) #include <iostream>#include <string>#include <cctype>using namespace std; /* Your code goes here */ int main() { string input; string output; getline(cin, input); output = FilterStr(input); cout << output << endl; return 0;}
Write a program email.cc that takes an email address in the following format: firstname.lastname@hotmail.com, such as jon.doe@hotmail.com, extracts from it the firstname and the lastname, and prints them in the following format: Lastname, Firstname. Your program should have and use at least the following functions:(a) getEmaillAddress that prompts a user to enter an email address as a string andreturns it.(b) extract that takes as its parameter an email address and returns the firstname andlastname.(c) capitalize that takes as its parameter a string and capitalize its first letter.(d) display that takes as its parameters 2 strings corresponding to the firstname andlastname, and displays them in the following format: Lastname, Firstname.Your program should repeatedly prompts the user to enter the email address in the previous format. The program should then output it as in the examples below. jon.doe@uleth.caDoe, JonTry again (Y/N) -- Ycarol.smith@uleth.caSmith, CarolTry again (Y/N)…
Create a function that takes a string of words and returns the word with the highest score. Each letter of the word gets points according to its position in the alphabet: a = 1, b = 2, C = 3, etc. Examples wordRank ("A quick brown fox.") → "brown" wordRank ("Nancy is very pretty.") "pretty" wordRank ("Come back tomorrow, man!") → "tomorrow" wordRank ("Wednesday is hump day.") "Wednesday" Solution in JS 10