Write a function that implements a simple calculator. It inputs 3 values, two numbers and an integer indicating which operation to conduct and returns the result. If the operation is not valid, it should print Non-Valid Operation and return None. Below, you can find the desired integer to operation mapping: Here are some examples: simple_calculator(5, 3, 1) -> 8 simple_calculator(5, 3, 2) -> 2 simple_calculator(5, 3, 3) -> 15 simple_calculator(5, 3, 4) -> 1.6 [] # Implementation def simple calculator (num1, num2, operation): # Do not edit the line above [ ] # Testing, DO NOT EDIT ANYTHING IN THIS CELL! print (simple_calculator (8, 3, 1)) print (simple_calculator(1, 7, 4)) print (simple_calculator (1, 8, 5)) print (simple_calculator (4, 4, 2)) print (simple_calculator (3, 3, 3)) Integer Operation 1 2 3 4 + * 1

Write a function that implements a simple calculator. It inputs 3 values, two numbers and an integer indicating which operation to conduct and returns the result. If the operation is not valid, it should print Non-Valid Operation and return None. Below, you can find the desired integer to operation mapping: Here are some examples: simple_calculator(5, 3, 1) -> 8 simple_calculator(5, 3, 2) -> 2 simple_calculator(5, 3, 3) -> 15 simple_calculator(5, 3, 4) -> 1.6 [] # Implementation def simple calculator (num1, num2, operation): # Do not edit the line above [ ] # Testing, DO NOT EDIT ANYTHING IN THIS CELL! print (simple_calculator (8, 3, 1)) print (simple_calculator(1, 7, 4)) print (simple_calculator (1, 8, 5)) print (simple_calculator (4, 4, 2)) print (simple_calculator (3, 3, 3)) Integer Operation 1 2 3 4 + * 1

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 8SA

See similar textbooks

Similar questions

Write the following three functions in c programming language: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…
Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Design a class ProblemSolution to overload a function solution. Write a function int solution(int N, char CH) that accepts integer N and character CH. The function should return square of a number (N) if a character (CH) is "s" otherwise return cube of a number. int solution(int N, int M, char CH) that accepts two integers (N and M) and one character CH. The function should return the product of two integers if a character (CH) is ‘p’ otherwise return their sum. boolean solution(String S1, String S2) that accepts two strings S1 and S2. The function should return true if S1 and S2 are equal otherwise false. Input 1 4 s where, First line represents a choice for calling one of the defined methods. (1 for solution(int N, char CH), 2 for solution(int N, int M, char CH) and 3 for solution(String S1, String S2)). Second line represents number input. Third line represents choice CH. Output 16 Here, the first line contains 1 and hence solution(int N, char…
Write a function below that will take a 2d array of booleans representing a map as a parameter which will construct a vgraph as a searchable graph. You many use go, python or java do to this.
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
Code in Python The function first_three takes one string parameter, word, and returns a slice of length three from the front of word. However, if word has length less than three, then the None object is returned instead. Hint: Use an if-else decision and the slicing operator [ : ] to solve this problem. For example: Test Result word = "happy" if type(first_three(word)) != type("ok"): print("error") else: print(first_three(word)) hap word = "dog" if type(first_three(word)) != type("ok"): print("error") else: print(first_three(word)) dog word = "" if type(first_three(word)) != type(None): print("error") else: print(first_three(word)) None
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
Write a function in c++ is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] """ def generate_parenthesis_v1(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) return ifright>0: add_pair(res, s+")", left, right-1) ifleft>0: add_pair(res, s+"(", left-1, right+1) res= [] add_pair(res, "", n, 0) returnres def generate_parenthesis_v2(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) ifleft>0: add_pair(res, s+"(", left-1, right) ifright>0andleft<right: add_pair(res, s+")", left, right-1).
Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b): """Finds if `str_a` matches `str_b` Keyword arguments: str_a -- string str_b -- string """ len_a, len_b = len(str_a) + 1, len(str_b) + 1 matches = [[False] * len_b for _ in range(len_a)] # Match empty string with empty pattern matches[0][0] = True # Match empty string with .* for i, element in enumerate(str_b[1:], 2): matches[0][i] = matches[0][i - 2] and element == '*' for i, char_a in enumerate(str_a, 1):…