Programming Python Q1. Approximation and Bi-section Search 1)….
Question Answered step-by-step Programming Python Q1. Approximation and Bi-section Search 1)…. Programming Python Q1. Approximation and Bi-section Search 1). Write a function find_square_root_approaximation(x, epsilon, increment), that takes three arguments: an integer, epsilon, and increment. And returns its square root and the number of guesses it took to compute the result. Use approximation algorithm to compute it and take these parameters x, epsilon, increment as input from the user..Example:Enter a number: 16Enter an epsilon: 0.1Enter an increment: 0.01Output:Num_guesses = 3994.0 is a close to the square root of 16Enter a number: 24Enter an epsilon: 0.01Enter an increment: 0.005Output:Num_guesses = 10004.999999999999916 is close to the cube root of 25 2). Write a function find_square_root_bisection_search(x, epsilon), that takes two arguments: an integer argument and epsilon. And returns it’s square root and number of guesses it took to compute the result. Use the Bisection search method to compute it. Example:Enter a number: 16Enter an epsilon: 0.1Output:Num_guesses = 1 4.0 is a close to the square root of 16Enter a number: 24Enter an epsilon: 0.01Output:Num_guesses = 94.8984375 is close to the cube root of 25 Hint: We have done an example for cube root in our Lecture 5, modify it to make it a function and square root. Q2. Dictionaries 3). Write a function to count the frequency of each word in a given song.4). Write another function that returns the most frequent word or words.Q3. Recursion We can determine how many digits a positive integer has by repeatedly dividing by 10 (without keeping theremainder) until the number is less than 10, consisting of only 1 digit. We add 1 to this value for each time wedivided by 10. Here is the recursive algorithm:1. If n < 10 return 1.2. Otherwise, return 1 + the number of digits in n/10 (ignoring the fractional part).Implement this recursive algorithm in Python and test it using a main function that calls this with the values 15,105, and 15105.Hint: Remember that if n is an integer, n/10 will be an integer without the fractional part.Example:Input a positive integer: 15 Output: The number of digits: 2Input a positive integer: 105 Output: The number of digits: 3Input a positive integer: 15105 Output: The number of digits: 5 Computer Science Engineering & Technology Python Programming COMPUTER S 001 Share QuestionEmailCopy link Comments (0)
