Create a function that will test if a string is a valid PIN or not via a regular expression. A valid PIN has: • Exactly 4 or 6 characters. Only numeric characters (0-9). • No whitespace. Examples validate("121317") validate("1234") → true validate("45135") → false validate("89abc1") → false validate("900876") → true validate(" 4983") → true → false

Create a function that will test if a string is a valid PIN or not via a regular expression. A valid PIN has: • Exactly 4 or 6 characters. Only numeric characters (0-9). • No whitespace. Examples validate("121317") validate("1234") → true validate("45135") → false validate("89abc1") → false validate("900876") → true validate(" 4983") → true → false

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter3: Performing Calculations With Formulas And Functions

Section: Chapter Questions

Problem 4.9CP

See similar textbooks

Similar questions

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
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 program called p3.py. Write a function called validate() that takes a string as input, validates that it is a single letter, and returns the letter in lowercase.Example:validate(“A”) returns avalidate(“abc”) returns invalid
Write a program that reads in a line consisting of a student’s name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number and all the characters in the password are replaced by x. (The Social Security number is in the form 000-00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element. Use the appropriate functions described in Table 7-1 below. Expression Effect strVar.at(index) Returns the element at the position specified by index strVar[index] Returns the element at the position specified by index strVar.append(n, ch) Appends n copies of ch to strVar, where ch is a char variable or a char constant strVar.append(str) Appends str to strVar strVar.clear() Deletes all the characters in strVar strVar.compare(str) Returns 1 if strVar > str returns 0 if strVar == str; returns −1 if strVar < str strVar.empty() Returns…
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and checks whether a passed string is palindrome? function check_Palindrome(str_entry){var cstr = str_entry.toLowerCase().replace(/[^a-zA-Z0-9]+/g,''); //changes the str -> lowercase && rem all non-alpha numeric charsvar count = 0; if(cstr === ""){console.log("String is not found");return false;}if((cstr.length) % 2 === 0){ //checks if the str is even or oddcount = (cstr.length) / 2;} else {console.log("Num4");if(cstr.length === 1){ //if str length === 1 then it is palindromeconsole.log("The string is a palindrome.");return true;} else {count = (cstr.length - 1) / 2; //if the str length is odd, ignores the mid char}}var p;for(p = 0; p < count; p++){if(cstr[p] != cstr.slice(-1-p)[0]){ //compares char that doesn't matchconsole.log("The string is not a palindrome.");console.log("\n");return false;}}console.log("The string…
Write a Boolean function called contains_whitespace() that accepts a string as a parameter and returns True if the string contains one or more whitespaces (" ", "/t", "/n") characters, or False otherwise. Write a main() function to demonstrate how it works.
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.)
Question 12 kana .Which of the following statements is false? The re module's findall function finds every matching substring in a string and returns a list of the matching substrings. The following code extracts all phone numbers of the form ###-###-#### from a string:contact = 'Wally White, Home: 555-555-1234, Work: 555-555-4321're.findall(r'\d{3}-\d{3}-\d{4}', contact) The re module's finditer function works like findall, but returns a greedy iterable of match objects. For large numbers of matches, using finditer can save memory because it returns one match at a time, whereas findall returns all the matches at once. Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
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)
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; }
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#
The international standard letter/number mapping for telephones is: Write a function that returns a number, given an uppercase letter, as follows:def getNumber(uppercaseLetter):Write a test program that prompts the user to enter a phone number as a string. The input number may contain letters. The program translates a letter (uppercase or lowercase) to a digit and leaves all other characters intact. Here is a sample run of the program: Enter a string: 1-800 flowers1-800-3569377