ercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array. 7

Q: 2: (Knapsack Problem) Using exhaustive search, find the most valuable subset of items that fit into…

A: Given that:

Q: Solve these questions

A: The objective of the question is to estimate the values of the given integrals using the Monte Carlo…

Q: 1. Trace each of the above algorithm using specific values for a and b. 2. Compare both algorithms.

A: 1. Trace each of the above algorithms using specific values of a and b. Take a=20, b=5. GCD of…

Q: Task- Median elements (C Language) Example #4 expected output is 5, but from the program below its…

A: To fix the issue and get the correct output, change the line: median = a[n/2 + 1]; to: median =…

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.