Your program needs to read in two words on a single line. If the pair of words are Super Anagrams of each other, print out Super word1, word2 = input("Enter words: ").split(" ") if word1 == word2: print("Super Anagram!") Anagram!. If the pair of words is not a Super Anagram (so a else: human couldn't read it), then print out Huh?. For one-letter words, print("Huh?") the first letter is the last letter. if__name__== "_main_": So, for example: main() Enter words: brain brian Super Anagram! A Submissions <> Output File "program.py", line 8 if__name__ == "_main_": and another example: Enter words: too two SyntaxError: invalid syntax Huh? O Hint

Your program needs to read in two words on a single line. If the pair of words are Super Anagrams of each other, print out Super word1, word2 = input("Enter words: ").split(" ") if word1 == word2: print("Super Anagram!") Anagram!. If the pair of words is not a Super Anagram (so a else: human couldn't read it), then print out Huh?. For one-letter words, print("Huh?") the first letter is the last letter. ifname== "_main_": So, for example: main() Enter words: brain brian Super Anagram! A Submissions <> Output File "program.py", line 8 ifname == "_main_": and another example: Enter words: too two SyntaxError: invalid syntax Huh? O Hint

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Python question Question 19 (Algorithmic problem) Write a RECURSIVE function that, given a text (as a string), returns the same text with vowels replaced with a hyphen (-). See the examples given below (doctests) Note: No marks will be awarded for non-recursive implementations. def remove_vowels(text): """ Input: a string of text Output: the same text with vowels removed Examples: >>> remove_vowels('this text') 'th-s t-xt' >>> remove_vowels('Python') 'Pyth-n' >>> remove_vowels('') '' >>> remove_vowels('Apple') '-ppl-' >>> remove_vowels('myths') 'myths' """
3. Debugging Lists File: debugging.py Similar to the previous practical's debugging exercises: Copy the code from debugging.py debugging.py - """CP1401 - Practical 8 - Debugging.""" # Debug program 1 - friends' namesnames = ["Abby", "Jerome", "Olivia", "Monique"]print("My friends' names: ")for i in range(1, len(names)): print(f"{i}. {names[i]}")last_number = len(names)print(f"The last name (number {last_number}) is {names[last_number]}") # Problem(s) for program 1:# ? # Fixed code for program 1: # Debug program 2 - title-casing country namescountries = ("australia", "new zeaLAND", "India")for i in range(len(countries)): countries[i] = countries[i].title()print(countries) # country names should be in title-case now # Problem(s) for program 2:# ? # Fixed code for program 2: Run the code and see what problems you can find. Complete the template in this file, adding comments to explain the problems (bugs) you find. Remember: debugging is about finding bugs, not just generally…
Write in c language please, The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
Regex, APIs, BeautifulSoup: python import requests, refrom pprint import pprintfrom bs4 import BeautifulSoup complete the missing bodies of the functions below: def mathmatic(target):"""Question 1You are doing fun math problems. Given a string of combination of '{}', '[]','()', you are required to return the substring included by the outermost '{}'.You need to write your code in one line.Args:target (str): the string to search inReturns:str>>> mathmatic('{[[[[]()]]]}')'[[[[]()]]]'>>> mathmatic('[(){([{}])}]')'([{}])'"""pass test code: # print(mathmatic('{[[[[]()]]]}'))# print(mathmatic('[(){([{}])}]'))
CHOSE THE CORRECT ANSWERS: (Some questions have more than one answer) a. adding comments to a program makes the program error-free. corrects. better understandable. run faster. b.The datatype of stacks is often used in Computer Science within operating systems. databases. compilers. software engineering. c. When following guidelines such as MR's rule book on commenting or Alexander's book "A Pattern Language" there can be situations in which several different solutions are correct. there is scope for subjective decisions. for no solution it can be said that it is correct. it is always the case that there is only one correct solution. d. A method is referentially transparent if it is behaves like a mathematical function. if it does not change a global variable. its return value is an integer. if its return values depend solely on its parameters. e. The documentary comments from the lectures ask one to write a preamble for the each file, which needs to…
Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence ? of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ..., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…
CODE USING C++ 2. I'm Lost, Help! by CodeChum Admin Thanks for your help previously, Programmer. I'm now on my to the enemy's base but it seems that I'm lost. I've been going on for quite some time now and it seems that things are always the same. Can you help me fix this map I am holding? Instructions: In the code editor, you are provided with an initial main() code and an initial walk() recursive function. The walk() recursive function is basically printing the values from 1 to 1000. However, currently, the walk() function is broken - it's always printing 1. It seems that there's something wrong with its recursive case. Try to fix it so Agent J. will find his way to the enemy's base. Output 1 2 3 4 5 6 7 8 9 10 . . .
C Language From a list of bid bonds, find out whether the bonds can be equally divided between 2 people with same value. Output explanation: ➢ Sample 1 yes: sum 2,782,351,934, 1 st person: {10022120, 2343520822, 428808992}, 2nd person: {2779943396, 2408538} ➢ Sample 2 no, there’s no possibility to equally divide the bid bonds. Questions: a. Design your algorithm in a pseudocode! (PS: use dynamic programming algorithm) b. Do analysis for your algorithm resulting in an asymptotic notation! (PS: the bid bond value can be quite large in trillion (1012)) c. Prove that your algorithm is correct and create your own input / output for 4 cases, and minimum number of bid bonds for each case is 20!
write a code using binary tree linked list data structures. In quiz game, questions are chosen in such a a way that they cover all fields of a typical quiz contest. The user’s general knowledge is tested with quiz questions regarding science, technology, movies, sports, general health, geography and many more. Quiz Game Project Introduction: Functions of projects and below is some function used in project:- Edit score--adds the prize won to the previous one upon giving the right answer to a question Help-- menu with game summary and rules Show record--shows the highest cash prize won by a particular user Show score--to view the highest score Reset score--to reset the highest score/ default In quiz game project, we can store the user’s name, view the highest score secured by a user, and even reset the score. The game ends when the user’s cash prize piles up to…
In C++ Please make sure to match the outputs provided. Do not add any additional libraries. Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names separated by a comma, one ordering per line. When the input is: Julia Lucas Mia -1 then the output is (must match the below ordering): Julia, Lucas, Mia Julia, Mia, Lucas Lucas, Julia, Mia Lucas, Mia, Julia Mia, Julia, Lucas Mia, Lucas, Julia
OCaml Code: Please fix all the errors needed for interpreter.ml and use the test cases to test the code. Make sure to give the correct code with the screenshots of the test cases passing the code. interpreter.ml type stackValue = BOOL of bool | INT of int | ERROR | STRING of string | NAME of string | UNIT type command = ADD | SUB | MUL | DIV | PUSH of stackValue | POP | REM | NEG | TOSTRING | SWAP | PRINTLN | QUIT let interpreter (input, output) = let ic = open_in input in let oc = open_out output in let rec loop_read acc = try let l = String.trim (input_line ic) in loop_read (l :: acc) with End_of_file -> List.rev acc in let strList = loop_read [] in let str2sv s = match s with | ":true:" -> BOOL true | ":false:" -> BOOL false | ":error:" -> ERROR | ":unit:" -> UNIT | _ -> let rec try_parse_int str = try INT…
C++ only Upvote for your own work and correct answer/ Downvote for copying the answer from a different website. It must be in C++ and it must be a working code. It needs to follow the required directions for example: MAKE SURE IT POINTS OUT EVERY TIME THE STATEMENT IS INVALID IF IT IS INDEED INVALID. Thank You. Assignment: Create a C++ program that can test the validity of propositional logic. Remember, a propositional logical statement is invalid should you find any combination of input where the PROPOSITIONAL statements are ALL true, while the CONCLUSION statement is false. Propositional Statements: If someone has a rocket, that implies they’re an astronaut. If someone is an astronaut, that implies they’re highly trained. If someone is highly trained, that implies they’re educated. Conclusion Statement: A person is educated, which implies they have a rocket. Your output should declare the statement to either be valid or invalid. If it’s invalid, it needs to state which combination…