Create a function that takes a string txt and returns the string in monkeys language. You have to figure out their language from test cases. Examples monkeyTalk ("Mubashir Hassan") → "Ook ook." monkeyTalk ("Hello") → "Ook." monkeyTalk ("Matt") - "Ook." monkeyTalk ("Everyone") → "Eek." monkeyTalk ("Edabit is Amazing") ➡ "Eek eek eek." Notes A hint in the comments section.

Create a function that takes a string txt and returns the string in monkeys language. You have to figure out their language from test cases. Examples monkeyTalk ("Mubashir Hassan") → "Ook ook." monkeyTalk ("Hello") → "Ook." monkeyTalk ("Matt") - "Ook." monkeyTalk ("Everyone") → "Eek." monkeyTalk ("Edabit is Amazing") ➡ "Eek eek eek." Notes A hint in the comments section.

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

Write a function called monkey_experiment that takes in a goal string (e.g., "methinks it is like a weasel") and a number of iterations as an argument. Run the experiment for that many iterations, and return a tuple with the highest-scoring text that was generated along with the score that it got. Test results: >>> monkey_experiment("methinks it is like a weasel",100000) ('m ojindoebjrerloiuc m oaanvl', 8) >>> monkey_experiment("methinks it is like a weasel",100) ('yeanpqj twosisjcvqrrfu eagbi', 5) >>> monkey_experiment("brevity is the soul of wit",100000) ('nnebptorcrytbe wogl uygdsn', 8) >>> monkey_experiment("to be",100000) ('tofbe', 4) >>> monkey_experiment("to be",200000) ('tbhbe', 3) >>> monkey_experiment("to be",500000) ('eo be', 4)
Write a function that takes a String and checks whether or not it ends with one of "!", "?.", or ".". Return true if it does, otherwise false. Try writing your solution using regular String methods and again as a RegExp. Using your solution, do a check on the following sentences: - a sentence ending with ! - a sentence ending with ? - a sentence ending with . - a sentence ending with *
Implement a function that checks whether a given string is a palindrome or not. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward, disregarding any spaces, punctuation, or capitalization. Write a function named isPalindrome that takes a string as input and returns True if it is a palindrome, and False otherwise. Example: Input: "racecar" Output: True Input: "hello" Output: False Input: "A man, a plan, a canal: Panama" Output: True Write the isPalindrome function that solves this problem efficiently.
Implement a function eligible in Python that returns a list of the names of people that are eligible for vaccination, subject to a minimum age requirement. The function eligible must: accept two arguments: 1. the minimum age for eligibility, a positive integer 2. a multiline string, containing the people waiting to be vaccinated. Each line of the stringcontains a person's name and their age, separated by a single space. return a list of the people who are eligible to be vaccinated, i.e., those whose ages is at least that of the minimum age for eligibility. They should be listed in the order they occur in the input string. Sample: >>> people = 'Sue 25\nAli 45\nSyd 45\nSally 105\nIan 16\nUli 65\nOliver 23\nZoe 95'>>> print(people)Sue 25Ali 45Syd 45Sally 105Ian 16Uli 65Oliver 23Zoe 95
Implement a function alterCase in Python that converts a word to "alterCase". Given a word, using any mix of upper and lower case letters, the function then returns the same word, except that the first letter is upper case, the second is lower case, and then cases of letters alternate throughout the rest of the word. >>> alterCase('apple')'ApPlE'
Answer the given question with a proper explanation and step-by-step solution. Write a python function that accepts a string object and counts the number of vowels in the string object Example 1: Input: bear Output: a 1 e 1 strobj = 'bear' countvowels(strobj)
Write a JavaScript function that takes two strings as input and determines whether they are anagrams of each other. An anagram is a word or phrase formed by rearranging the letters of another. In this case, you should consider only alphanumeric characters and ignore spaces and letter casing
Write a function in C progarmming language that gets a string str, changes all lower case letters to * (asterisk), and all upper case letters to $ (dollar sign). All other characters remain unchanged. The function returns the total number of letters modified. int hide_letters(char* str); For example: - If str is "12ab0", then the function changes it to "12**0", and returns 2. - If str is "aBCDe*", then the function changes it to "*$$$**", and returns 5. - If str is "0123&***", then the function keeps the string as is, and returns 0. - An empty string is also a string.
Write a program that provide space in the sentence.For example;-if user input:- Ilikeredandblue output:- I like red and blue 1- Use C language. 2- Create a function called space . For example:-int main( ){char a[50];printf(“enter a string”);fgets(a, 50, stdin);printf(“original output: %s”, a);space(a); // here we call space function so we can provide space between the words . printf(“modified output: %s”, a); . // Expect original output : Ilikeredandblue // Expected modified output: I like red and blue
//Write a function that loops through and console.log's the numbers from 1 to 100, except multiples of three, log (without quotes) "VERY GOOD" instead of the number, for the multiples of five, log (without quotes) "SUPER AWESOME". For numbers which are multiples of both three and five, log (without quotes) "VERY GOOD SUPER AWESOME" Console log out: 12VERY GOOD4SUPER AWESOMEVERY GOOD78VERY GOODSUPER AWESOME11VERY GOOD1314VERY GOOD SUPER AWESOME1617VERY GOOD19SUPER AWESOMEVERY GOOD2223VERY GOODSUPER AWESOME26VERY GOOD2829VERY GOOD SUPER AWESOME
Write a function biggestBuried(s), which the parameter s is a string, and the function returns the largest integer buried in the string. If there is no integer inside the string, then return 0. For example, biggestBuried('abcd51kkk3kk19ghi') would return 51, and biggestBuried('kkk32abce@@-33bb14zzz') would return 33, since the '-' character is treated like any other non digit. Note that a character is a digit if it is greater than or equal to '0' and less than or equal to '9'. Alternatively, you can use string.isdigit() to check if the string is a digit. Use the function in a program to test that it works properly by saying print(biggestBuried('abcd51kkk3kk19ghi')) answer should be 51 print(biggestBuried('kkk32abce@@-33bb14zzz')) answer should be 33 print(biggestBuried('this15isast22ring-55')) answer should be 55
Implement the FindText() function, which has two strings as parameters. The first parameter is the text to be found in the user provided sample text, and the second parameter is the user provided sample text. The function returns the number of instances a word or phrase is found in the string. In the PrintMenu() function, prompt the user for a word or phrase to be found and then call FindText() in the PrintMenu() function. Before the prompt, call cin.ignore() to allow the user to input a new string.Ex: Enter a word or phrase to be found: more "more" instances: 5