Please answer it in Python 1) Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant and the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v'

Please answer it in Python 1) Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant and the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v'

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 12PE

See similar textbooks

Similar questions

C++ A word is considered elfish if it contains the letters: e, l, and f in it, in any order. For example,we would say that the following words are elfish: whiteleaf, tasteful, unfriendly, and waffles,because they each contain those letters.Write a function called elfish that recursively checks, given a word, if that word is elfish or not.
C Programming-Plz fix this code We can return multiple values from functions using pointers. Let's see an example. # include <stdio.h> void add Gr.marks (int * m) { *m = * m + 10; } void main ( ) { int marks; clrscr ( ); printf("enter actual marks:"); scanf(" % d", & marks); add Gr.marks (& marks); printf(" \n the graced marks is :\t % d", marks); }
Need help in C++ for the below Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper function (IsPrimeRecur) which will recursively check if a number is prime or not - it will return true or false, not contain any loops to check if a number is prime, be the…
In c++ please with clear indentation thank you so much Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one…
Use Clojure to complete these questions: Please note that this is the beginning of the course so please use simple methods possible, thanks a. The built-in function type is useful for checking what kind of object an expression evaluates to. Write a function both-same-type? that takes two arguments, and returns true when they both have the same type, and false otherwise. b. Write a function list-longer-than? which takes two arguments: an integer n, and a list lst and returns true if lst has more than n elements, and false otherwise. For example, (list-longer-than? 3 '(1 2 3)) should return false, and (list-longer-than? 2 '(1 2 3)) should return true. c. See attached picture.
09. Question Write a recursive function printRev ( int a[ ], int s, int e) that receives an integer array a [ ], a start index s, and an end index e. The function should print the array elements in reverse order. void printRev ( int a[ ], int s, int e); Trace your function given the following array and function call. Draw your steps. int a[ ] = {4, 2, 3, 5};and printRev(a, 0, 3); language c++ .
C. In permutations and combinations, the term “n C r” refers to n combinationstaken r at a time.??? =?!/?! (? − ?)!Write a recursive function to find the factorial of a number.Use the defined function to compute the term “nCr” for the following scenario:The values of ‘n’ and ‘r’ are stored in two parallel arrays of any user definedsize . You have to Read the arrays n and r at run time. Compute n C r for eachcorresponding terms in the array ‘n’ and ‘r’, and display it properly formatted.Also your program should print the current date and time using libraryfunctions
Question: First write a function mulByDigit :: Int -> BigInt -> BigInt which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1] Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] [] Your implementation should not be recursive. Code: import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…
Create a recursive function that multiplies two positive integers without the need of the * (or /) operator. You can utilise addition, subtraction, and bit shifting, but you should keep the amount of operations to a minimum.
1. Write a recursive function that takes a string as an input and returns the reverse of the string. 2.Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: *ede cde bcde abcde Method call rec_string(‘abc’), will produce the following output: *cbc abc 3. Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the…
Use Clojure: a. The built-in function type is useful for checking what kind of object an expression evaluates to. Write a function both-same-type? that takes two arguments, and returns true when they both have the same type, and false otherwise. b. Write a function list-longer-than? which takes two arguments: an integer n, and a list lst and returns true if lst has more than n elements, and false otherwise. For example, (list-longer-than? 3 '(1 2 3)) should return false, and (list-longer-than? 2 '(1 2 3)) should return true.
/*Rewrite the given program using function overloading*/ /* Rewrite the given program using the concept of function overloading.*/#include<iostream>using namespace std;int findProductInt(int a, int b){ return (a*b);}double findProductDouble(double a, double b){ return (a*b);}int findProductThreeInt(int a, int b, int c){ return (a*b*c);}double findProductThreeDouble(double a, double b, double c){ return (a*b*c);}int main(){ int a,b,c; double x,y,z; cout<<"Enter three integers"<<endl; cin>>a>>b>>c; cout<<"Enter three double"<<endl; cin>>x>>y>>z; cout<<"Product of two integers a and b ="<<findProductInt(a,b)<<endl; cout<<"Product of three integers a,b and c ="<<findProductThreeInt(a,b,c)<<endl; cout<<"Product of two double x and y ="<<findProductDouble(x,y)<<endl; cout<<"Product of three double x,y and z…