CODE MUST BE IN PYTHON. Convert any given statement or word tothe Pig-latin equivalent. The rule for Pig-latin can be described as follows: given aword, if the first alphabet in the word is aconsonant, then move the consonant tothe end of the word and add "ay" to it. Ifthe first alphabet in the word is a vowel,leave it as it is but add "yay" to the end.Example:Please enter a word: ComputerOutput is: "omputercay"Please enter a word: ScienceOutput is: "ciencesay"Please enter a word: PythonOutput is: "ythonpay"Please enter a word: includeOutput is: "includeyay"Please enter a word: echoOutput is: "echoyay"Please enter a word / sentence:"Computer science includes Pythonlanguage"Output is: "omputercay ciencesayincludesyay ythonpay anguagelay"Hint: "IN", "+", "if / elif", "split()", lower(),upper() and slicing functions would bevery helpful.

Code: function pigLatin(str) { // Convert string to lowercase str = str.toLowerCase() //…

Convert any given statement or word to the Pig-latin equivalent. The rule for Pig- latin can be described as follows: given a word, if the first alphabet in the word is a consonant, then move the consonant to the end of the word and add "ay" to it. If the first alphabet in the word is a vowel, leave it as it is but add "yay" to the end.

Convert any given statement or word to the Pig-latin equivalent. The rule for Pig- latin can be described as follows: given a word, if the first alphabet in the word is a consonant, then move the consonant to the end of the word and add "ay" to it. If the first alphabet in the word is a vowel, leave it as it is but add "yay" to the end.

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

A finite sequence of symbols from a given alphabet will be called a string over the alphabet. A string that consists of a sequence a1, a2, a3, a4, … … … … , ?? of symbols will be denoted by the juxtaposition a1 a2 a3 a4 … … … … ??. Given the strings: ? = a2bab2and v = bab2, Evaluate the following operations for strings: (i) ԑu(ii) u + v(iii) u(u| v)(iv) v | (v | u)
Write a program that reads an integer age of kids, finds the maximum of them, and counts its occurances, finds the minimum of them, and counts its occurances. And Find the average ages. Assum that the input ends with number -1.
Write a program by using c++ that inputs a number and checks whether it is a perfect number or not. A perfect number is the number that is numerically equal to the sum of its divisors. For example, 6 is a perfect number because the divisors of 6 are 1, 2, 3 and 1+2+3=6
Write a program in c++ that will allow a user to find the hypotenuse of a right triangle using the Pythagorean Theorem. Note: In triangle ABC, given the figure, side c is the hypotenuse.
Write a Python program to find the first appearance of the substring 'too' and 'good' from a given string. If 'good' follows the 'too', replace the whole 'too'' good' substring with 'excellent' and print the resulting string. If the above does not appear, print the string as it is. Sample InputThe book is not too good!This book is good too! Sample OutputThe book is not excellent!This book is good too!
Write a program that reads two integers as input, and outputs the first integer and subsequent increments of 10 as long as the value is less than or equal to the second integer. Answer in Coral Language Ex: If the input is: -15 30 the output is: -15 -5 5 15 25 Ex: If the second integer is less than the first as in: 20 5 the output is: Second integer can't be less than the first. For coding simplicity, output a space after every integer, including the last.
Give English language translations of the following wffs where L(x, y) is “x loves y”, H(x) is “x ishandsome”, M(x) is “x is a man”, P(x) is “x is pretty”, W(x) is “x is a woman”, k is “Kathy”, andj is “John”.(a) (∀x)(W(x) → (∀y)[L(x, y) → M(y) ∧ H(y)])(b) (∃x)[M(x) ∧ H(x) ∧ L(x, k)](c) (∃x)(W(x) ∧ P(x) ∧ (∀y)[L(x, y) → H(y) ∧ M(y)]) (d) (∀x)[W(x) ∧ P(x) → L(j, x)]
Write a C program that input a single letter and prints out the corresponding digits on the phone. The letters and digits on a phone are grouped following way. 2 = ABC 3 = DEF 4 = GHI 5 = JKL 6 = MNO 7 = PRS 8 = TUV 9 = WXY No digits corresponds to Q and Z. For these two letters, your program should prints a message indicating that they are not used on a phone.
Write a program that reads an integer and displays all its smallest factors in an increasing order. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5.
Write a program that translates a letter grade into a number grade. Letter grades are A, B, C, D, and E, possibly followed by + or -. Their numeric values are 4, 3, 2, 1, and 0. There is no F+ or F-. A + increases the numeric value by O.3, a – decreases it by 0.3. However, an A+ has value 4.0. Enter a letter grade: B- The numeric value is 2.7.
A very known application in natural language processing is to extract information from a given text. In this lab, you will be able to extract some emotions (Sad and Happy) from a given string and calculate the score of each emotion. You will be given below the words that express sadness, anger, and happiness. For each word, you will be given weight as well, so that when you are calculating for example the score for sadness in the text (string), you can use this formula:
Write a program that simulates a simple calculator. It reads two integers and a character. If the character is a ‘+’, the sum is printed; if it is a ‘-’, the difference is printed; if it is a ‘*’, the product is printed; if it is a ‘/’, the quotient is printed; and if it is a ‘%’, the remainder is printed. (Refrance C++)