Complete the scramble_text() function that takes a single string parameter text. The function returns a new string consisting of the characters in text in scrambled order - every pain of characters have their positions swapped. You can assume that the parameter text will have a length of at least 1. For strings with an odd length, the last character remains unchanged in the scrambled text. Some examples of the function being called are shown below. For example:

Complete the scramble_text() function that takes a single string parameter text. The function returns a new string consisting of the characters in text in scrambled order - every pain of characters have their positions swapped. You can assume that the parameter text will have a length of at least 1. For strings with an odd length, the last character remains unchanged in the scrambled text. Some examples of the function being called are shown below. For example:

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

Given string stringVal on one line, integer idxStart on a second line, and integer choiceLen on a third line, replace choiceLen characters with "1234", starting at index idxStart. Ex: If the input is: Fuzzy bear 3 4 then the output is: Fuz1234ear Note: Using a pre-defined string function, the solution can be just one line of code. #include <iostream>#include <string>using namespace std; int main() { string stringVal; int idxStart; int choiceLen; getline(cin, stringVal); cin >> idxStart; cin >> choiceLen; /* Your code goes here */ cout << stringVal << endl; return 0;}
Task 2: Implement the function Searchingstrings that allow to search a sub-string in a given string and display the: First occurrence, Last occurrence, First occurrence from a given index and Last occurrence from a given index. You can use the following String methods: string. IndexOf(searchvalue, start) return the position of the first occurrence of specified character(s) in a string. string.lastIndexOf(searchvalue, start) return the position of the last occurrence of specified character(s) in a string. You can use the following string to test your solution: var letters = "abcdefghijklmnopqrstuvwxyzabcdefghijklm"; Write the code in a separate.js and separate.html file.
1. What does the following code segment return assuming the argment passed is a single word or short phrase def mystery3(word: str) -> str:output = ""for char in word:output = char + outputreturn output 2. Write a function called removeVowels that accepts a string as a parameter and return a copy of that string with no vowels (aeiou) in it. Upper case and lower case vowels will be remove and the rest of the string is not changed. For example removeVowels("The Quick Brown Fox) would return "Th Qck Brwn Fx"
Write a function that when given a URL as a string, parses out just the domain name and returns it as a string. Examples:domain_name("http://github.com/SaadBenn") == "github" domain_name("http://www.zombie-bites.com") == "zombie-bites"domain_name("https://www.cnet.com") == "cnet"Note: The idea is not to use any built-in libraries such as re (regular expression) or urlparse except .split() built-in function""" # Non pythonic waydef domain_name_1(url): #grab only the non http(s) part full_domain_name = url.split('//')[-1] #grab the actual one depending on the len of the list actual_domain = full_domain_name.split('.') # case when www is in the url if (len(actual_domain) > 2): return actual_domain[1] # case when www is not in the url return actual_domain[0] # pythonic one linerdef domain_name_2(url):
String Manipulation In this question, you will be implementing the following functions int findChar(char * str, char c); Searches for the character c in the string str and returns the index of the character in the string. If the character does not exist, returns -1 int replaceChar(char * str, char c1, char c2); Searches for the character c1 in the string str and if found, replace it with c2.The function returns the number of replacements it has performed. If the character does not exist, returns 0. int removeChar(char * str1, char * str2, char c); Creates a copy of str1 into str2 except for the character c that should be replaced with ‘*’ For example, if str1=”Hello World” and c=’l’ then the function should make str2=”He**o Wor*d” int isPalindrome(char * str) Checks to see if a string is Palindrome(reversible). If it is, returns 1, otherwise returns 0. A palindrome string reads similarly from left to right and from right to left like madam, level, radar, etc. int reverseString(char…
Create a function that takes a number (int) and returns a corresponding string of dashes. Examples: num_to_dashes(1) ➞ "-" num_to_dashes(5) ➞ "-----" num_to_dashes(3) ➞ "---"
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()…
4 Write a program that prompts the user to input a string. The program then use the function substr to remove all the vowels from the string. For example if str = "There", then after removing all the vowels, str = "Thr". After removing all the vowels, output the string. Your program must contain a function to remove all the vowels and a function to determine whether a character is a vowel.
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. public static int countSubstring(String s, String x) { if (s.length() == 0 || x.length() == 0) return 1; if (s.length() == 1 || x.length() == 1){ if (s.substring(0,1).equals(x.substring(0,1))){ s.replaceFirst((x), " "); return 1 + countSubstring(s.substring(1), x); } else { return 0 + countSubstring(s.substring(1), x); } } return countSubstring(s.substring(0,1), x) + countSubstring(s.substring(1), x); } public class Main { public static void main(String[] args) { System.out.println(Recursion.countSubstring("catwoman loves cats","cat"));…
Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount("abcde") duplicateCount("aabbcde") → 2 duplicateCount("Indivisibilities") - duplicateCount("Aa") 0 // Case sensitive N
In C language / Please don't use (sprint) function. Write a function fact_calc that takes a string output argument and an integer input argument n and returns a string showing the calculation of n!. For example, if the value supplied for n were 6, the string returned would be 6! 5 6 3 5 3 4 3 3 3 2 3 1 5 720 Write a program that repeatedly prompts the user for an integer between 0 and 9, calls fact_calc and outputs the resulting string. If the user inputs an invalid value, the program should display an error message and re-prompt for valid input. Input of the sentinel -1 should cause the input loop to exit. Note: Don't print factorial of -1, or any number that is not between 0 and 9. SAMPLE RUN #4: ./Fact Interactive Session Hide Invisibles Highlight: None Show Highlighted Only Enter·an·integer·between·0·and·9·or·-1·to·quit:5↵ 5!·=·5·x·4·x·3·x·2·x·1·x··=·120↵ Enter·an·integer·between·0·and·9·or·-1·to·quit:6↵ 6!·=·6·x·5·x·4·x·3·x·2·x·1·x··=·720↵…
Implement the following function: Code should be written in python.