1. area_of_equilateral_triangle An equilateral triangle is a triangle whose sides are all the same length, so all of its internal angles are 60 degrees. Write a function to compute its area, given the length of a side, a. Recall (or look up) that the formula for the area of an equilateral triangle is (V3 / 4) * a? Sample calls should look like: >>> area_of_equilateral_triangle (10) 43.30127018922193 >> area_of_equilateral_triangle(2.5) 2.7063293868263707

1. area_of_equilateral_triangle An equilateral triangle is a triangle whose sides are all the same length, so all of its internal angles are 60 degrees. Write a function to compute its area, given the length of a side, a. Recall (or look up) that the formula for the area of an equilateral triangle is (V3 / 4) * a? Sample calls should look like: >>> area_of_equilateral_triangle (10) 43.30127018922193 >> area_of_equilateral_triangle(2.5) 2.7063293868263707

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

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
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.
Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError() In [ ]: In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800
Write a function 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
Using C not (C++ or C#) Write a function int IsIncreasingOrder(int A[], int n) which will return 1 if A[i] < A[i+1] for i = 0 to n-2, otherwise it will return 0. Assume that elements are unique, i.e, no two elements have the same value.
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
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
PYTHON!!! Write a function called number_matrix(r,c) that takes two parameters r and c and PRINTS ON THE SCREEN a matrix of numbers as follows: 1 2 3 4 5 .... 2 3 4 5 6 .... 3 4 5 6 7 .... . .. In this pattern, each row contains c numbers and there are r rows. For example, number_matrix(4,3) results in: 1 2 3 2 3 4 3 4 5 4 5 6 Note that you shouldn't be printing anything other than the required matrix of numbers. Even empty strings may invalidate your answer . """ def number_matrix(r,c):
Write a function that accepts two arguments,, an array of integers, and a numberindicating the number of elements in the array. Th e function should recursive lycalculate the sum of all the numbers in the array. Demonstrate the use of the functionin a program that asks the user to enter an array of numbers and prints its sum.
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…
Write a function to find the maximum sum of a subarray within a given array of integers. The subarray should be contiguous, meaning the elements are adjacent to each other in the array. For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of a subarray is 6, which corresponds to the subarray [4, -1, 2, 1]. Write a function named maxSubarraySum that takes an array of integers as input and returns the maximum sum of a subarray. Note: If all the elements in the array are negative, the function should return 0. Example: Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Input: [-1, -2, -3, -4] Output: 0 Write the maxSubarraySum function that solves this problem efficiently.
Take a sorted array of 15 elements of type int and a value x from user, you need to find the ceilingand floor of x. The ceiling of x is the smallest element in array greater than or equal to x, and thefloor is the greatest element smaller than or equal to x. Assume than the array is sorted inascending order. Write a c++ program using functions to find floor and ceiling of x from the given array.Examples : For example, let the input array be {1, 2, 8, 10, 10, 12, 19}For x = 0: floor doesn't exist in array, ceil = 1For x = 1: floor = 1, ceil = 1For x = 5: floor = 2, ceil = 8For x = 20: floor = 19, ceil doesn't exist in array