7. username_ends_with_digits This function decides whether a given username ends with some digits. It returns either True, if the username does end with digits, or False, if it does not. Check out the .isdigit method on strings! Sample runs should look like: >>> username_ends_with_digits("FunctionEnjoyer") False >>> username_ends_with_digits("this_username_95060") True

7. username_ends_with_digits This function decides whether a given username ends with some digits. It returns either True, if the username does end with digits, or False, if it does not. Check out the .isdigit method on strings! Sample runs should look like: >>> username_ends_with_digits("FunctionEnjoyer") False >>> username_ends_with_digits("this_username_95060") True

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

Topics: User-defined functions, list, string, docstringProblem Statement: This program finds the unique letters from a given string and printsthe unique letters and their count. For example: word ‘LITTLE’ has ‘L’, ‘I’, ‘T’, ‘E’ are theunique letters.Lab Scenario:The program repeats until hits ‘n’. The program takes a user input of a string. The programfinds the unique letters in the string, add them in a list and displays the list and their count.Consider the following important points:1) You need to design a user-defined function named count_unique_letters whichtakes user word as parameter and returns the list of unique letters calledunique_letters in the given word.a. Hint: Iterate over each letter in user word, check if the letter is in the list, if notadd it to the list, otherwise continue to the next letter. A ‘in’ keyword can helpto determine if a character in the unique_letters list.b. You need to write a simple docstring for this function.2) Your program must have a main()…
Here is a function that is supposed to return True if word (any string) ends with "s" and False otherwise: def ends_with_s(word):if len(word) < 1:return False return word[-1] == "s" Here is the test function I am using to test ends_with_s: def test_ends_with_s(): assert(ends_with_s("cats")) # option 1 assert(ends_with_s("") is False) # option 2 assert(ends_with_s("apple") is False) # option 3 assert(ends_with_s("S")) # option 4 Rewrite ends_with_s so that the test passes
Implement the following function which accepts a string as parameter and reverses it, without using any function from the string library. void strReverse(char *str)
please code in pythonis_phone_num: This Boolean function takes a string and returns True if it is in the formatddd-ddd-dddd, where d is a digit, False otherwise. Example calls:is_phone_num('123-456-7890') --> Trueis_phone_num('123-4556-7890') --> Falseis_phone_num('(123)456-7890') --> False
A Millenial is someone born between 1981 and 1996 (inclusive). Using boundary analysis write test cases to test the IsMillenial function: public bool IsMillenial(int year) that takes a year of birth (in the Gregorian Calendar) and returns true if the person is a millenial and false if it isn't. If the year is not a valid Gregorian Calendar year then the function throws ArgumentOutOfRangeException. Note: There is total of 13 test cases. using Microsoft.VisualStudio.TestTools.UnitTesting; using System; using System.Collections.Generic; [TestClass] public partial class { // Your code starts here // Your code ends here }
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,…
Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,
Unfair hurdles are hurdles which are either too high, or way too close together. Create a function which takes in an array of strings, representing hurdles, and returns whether or not they are unfair. For the purposes of this challenge, unfair hurdles are: • At least 4 characters tall. • Strictly less than 4 spaces apart. Examples // Hurdle are good distance apart but are way too tall. isUnfairHurdle ([ "# "# "# ]) → true ## // Hurdles are a fine height but are way too close together. isUnfairHurdle ([ "# # # #", "# # # #" "# # ]) → true "# "# ]) → false #" // These hurdles are mighty splendid. isUnfairHurdle([ #
Create a class Recursion. It will have two static methods: removeX and countSubstring and write each function recursively. Recursion class removeX The removeX function will take a String as a parameter. It will return a new String that is the same as the original String, but with all “x” characters removed. This method will be case insensitive. countSubstring The countSubstring function will take two strings as parameters and will return an integer that is the count of how many times the substring (the second parameter) appears in the first string without overlapping with itself. This method will be case insensitive. For example: countSubstring(“catwoman loves cats”, “cat”) would return 2 countSubstring(“aaa nice”, “aa”) would return 1 because “aa” only appears once without overlapping itself. Create a Main class to test and run your Recursion class.
Instructions There are four clubs in Tesset University South, North, West, and East. A Tesset student can choose to join any number of clubs. Your task is to determine how many students are enrolled in exactly two clubs. Write a function/method named dualClubCounter that will accept a string containing the student number and his desired club. Return a set containing the name of students are enrolled exactly in two clubs. Use SET in your solution Example #1 INPUT: "12300:East,12301:West, 12302:South, 12300:West, 123 Expected Content of Set = [12300] Example #2 INPUT: "12300:East,12301:West, 12302:South, 12300:West,123 Expected Content of Set = [12300, 12301]
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
Write a function findFirstUpper() that takes a string as parameter, finds returns the index of the first uppercase letter in the string. If there is no uppercase letter in the string, then the function will return -1.Example: Function call findFirstUpper("best course is CS104!") will return 15 (index of the 'C').Example: Function call findFirstUpper("good morning!") will return -1. CODEEE:PYTHON PLEASE