Given algorithm- procedure factorial (n: nonnegative integer) if n = 0 then return 1 else return...
Given algorithm- procedure factorial (n: nonnegative integer) if n = 0 then return 1 else return n*factorial(n-1) {output is n!} Trace the above algorithm when it is given n = 7 as input. That is, show all steps used by above algorithm to find 7!
Homework Answers
factorial(1) = 1 factorial(2) = 2 * factorial(1) = 2 * 1 = 2 factorial(3) = 3 * factorial(2) = 3 * 2 = 6 factorial(4) = 4 * factorial(3) = 4 * 6 = 24 factorial(5) = 5 * factorial(4) = 5 * 24 = 120 factorial(6) = 6 * factorial(5) = 6 * 120 = 720 factorial(7) = 7 * factorial(6) = 7 * 720 = 5040
Add Answer to:
Given algorithm- procedure factorial (n: nonnegative integer) if
n = 0 then return 1 else return...
ALGORITHM RecS(n) // Input: A nonnegative integer n ifn=0 return 0 else return RecS(n+ n n...
ALGORITHM RecS(n) // Input: A nonnegative integer n ifn=0 return 0 else return RecS(n+ n n n Determine what this algorithm computes. You must justify your answer. made by this algorithm and solve it. You must justify your answer. same thing using for/while loop(s) developed in (3). You must justify your answer. 1) 2) Set up the initial condition and recurrence relation for the number of multiplications 3) Write the pseudocode for the non-recursive version of this algorithm, i.e., compute...
5. (10 points) The factorial of a nonnegative integer n is written n! and is defined...
5. (10 points) The factorial of a nonnegative integer n is written n! and is defined as follows. n 2) ..1 (for values of n greater than 1) nn (n-l) and n-# 1 (for n 0 or n-1) l. Write a program that reads a nonnegative integer and computes and prints its factoria
What is the time-complexity of the algorithm abc? Procedure abc(n: integer) s := 0 i :=1...
What is the time-complexity of the algorithm abc? Procedure abc(n: integer) s := 0 i :=1 while i ≤ n s := s+1 i := 2*i return s consider the following algorithm: Procedure foo(n: integer) m := 1 for i := 1 to n for j :=1 to i2m:=m*1 return m c.) Find a formula that describes the number of operations the algorithm foo takes for every input n? d.)Express the running time complexity of foo using big-O/big-
permutations are there with people)? 34. A class has enough time for 4 questions. 10 students...
permutations are there with people)? 34. A class has enough time for 4 questions. 10 students are present. Suppose a student can ask up to 4 questions, how many combinations can there be of students asking questions? (How many 4- combinations are there from 10 students, with repetition)? 35. Show that if there are 30 students in a class, then at least two of the students have first names that 3pts begin with the same letter. What principle can you...
The factorial of a nonnegative n written as n! is defined as follows: n!= n*(n-1)*(n-2) *...
The factorial of a nonnegative n written as n! is defined as follows: n!= n*(n-1)*(n-2) * .... *1 (for all values of n greater than 0) and 0! =1. For example 5! = 5*4*3*2*1 which is 120. (can also be 1*2*3*4*5) Write a C++ program that reads a nonnegative integer and computes and prints its factorial.
Write a C++ function to find factorial of an integer number N >0. Using the factorial...
Write a C++ function to find factorial of an integer number N >0. Using the factorial function print the factorial of two inputs as shown below: Sample input: 1 4 Expected output: 1 24
1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm...
1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm we can write m=qn+r, with 0 <r<n-1. As in class define (m,n) = {mc+ny: I,Y E Z} and S(..r) = {nu+ru: UV E Z}. Prove that (m,n) = S(n,r). (Remark: If we add to the definition of ged that gedan, 0) = god(0, n) = n, then this proves that ged(m, n) = ged(n,r). This result leads to a fast algorithm for computing ged(m,...
Algorithm Riddle(A[0..n-1]) //Input: An array A[0..n-1] of real numbers if n=1 return A[0] else temp =...
Algorithm Riddle(A[0..n-1]) //Input: An array A[0..n-1] of real numbers if n=1 return A[0] else temp = Riddle(A[0..n-2]) if temp<=A[n-1] return temp else return A[n-1] what does it compute? explain please
urgent L. Consider the following pseudocode for finding binomial coefficients: Binom(n, r) Input: integers n and r Output: n choose r if r-0 or r-n thern return 1 end else return Binom(n-1, r-1) B...
urgent
L. Consider the following pseudocode for finding binomial coefficients: Binom(n, r) Input: integers n and r Output: n choose r if r-0 or r-n thern return 1 end else return Binom(n-1, r-1) Binom(n-1, r); end running time of this algorithm. Prove your bound for the upper bound. (5 points) Rewrite the above algorithm so that it is efficient. (You have 2 choices!) Analyze the worst case time of your new algorithm. (5 points) Find the edit distance between "SPOKE...
If n is an integer greater than 0, n factorial (n!) is the product: n* (n-1)...
If n is an integer greater than 0, n factorial (n!) is the product: n* (n-1) * (n-2) * ( n-3)… * By convention, 0! = 1. You must write a program that allows a user to enter an integer between 1 and 7. Your program must then compute the factorial of the number entered by the user. Your solution MUST actually perform a computation (i.e., you may not simply print “5040” to the screen as a literal value if...
ALGORITHM RecS(n) // Input: A nonnegative integer n ifn=0 return 0 else return RecS(n+ n n n Determine what this algorithm computes. You must justify your answer. made by this algorithm and solve it. You must justify your answer. same thing using for/while loop(s) developed in (3). You must justify your answer. 1) 2) Set up the initial condition and recurrence relation for the number of multiplications 3) Write the pseudocode for the non-recursive version of this algorithm, i.e., compute...
5. (10 points) The factorial of a nonnegative integer n is written n! and is defined as follows. n 2) ..1 (for values of n greater than 1) nn (n-l) and n-# 1 (for n 0 or n-1) l. Write a program that reads a nonnegative integer and computes and prints its factoria
permutations are there with people)? 34. A class has enough time for 4 questions. 10 students are present. Suppose a student can ask up to 4 questions, how many combinations can there be of students asking questions? (How many 4- combinations are there from 10 students, with repetition)? 35. Show that if there are 30 students in a class, then at least two of the students have first names that 3pts begin with the same letter. What principle can you...
Write a C++ function to find factorial of an integer number N >0. Using the factorial function print the factorial of two inputs as shown below: Sample input: 1 4 Expected output: 1 24
1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm we can write m=qn+r, with 0 <r<n-1. As in class define (m,n) = {mc+ny: I,Y E Z} and S(..r) = {nu+ru: UV E Z}. Prove that (m,n) = S(n,r). (Remark: If we add to the definition of ged that gedan, 0) = god(0, n) = n, then this proves that ged(m, n) = ged(n,r). This result leads to a fast algorithm for computing ged(m,...
urgent
L. Consider the following pseudocode for finding binomial coefficients: Binom(n, r) Input: integers n and r Output: n choose r if r-0 or r-n thern return 1 end else return Binom(n-1, r-1) Binom(n-1, r); end running time of this algorithm. Prove your bound for the upper bound. (5 points) Rewrite the above algorithm so that it is efficient. (You have 2 choices!) Analyze the worst case time of your new algorithm. (5 points) Find the edit distance between "SPOKE...
Most questions answered within 3 hours.
-
To be done in java code. 2 words are anagrams if 1 word can be
formed...
asked 5 minutes ago -
Bright Sun, Inc. sold an issue of 30-year $1,000 par value bonds
to the public. The...
asked 2 minutes ago -
Two players take turns at removing 1 to 4 coins from an original
pile of 16...
asked 2 minutes ago -
The income statement for the month of June, 2014 of Happy Smiles
Enterprises contains the following...
asked 8 minutes ago -
1-Calculate the mass in grams of 2.55 moles of KCl
2- Calculate how many moles are...
asked 8 minutes ago -
1. Choose value for p between 0.20 and 0.80. It should have at
least two decimal...
asked 9 minutes ago -
QUESTIONS: 500 words for the question
In defining abnormality, the criteria of “deviance”, “distress”
and “dysfunction”...
asked 11 minutes ago -
A sample of n = 25 scores produces a t statistic of t =
-2.062. If...
asked 29 minutes ago -
Given the following, compute the after tax cost of debt: The par
value of the firms...
asked 22 minutes ago -
Coding in C. Please only use stdio.h (which would mean no malloc
or anything like that)...
asked 28 minutes ago -
Use the fundamental accounting equation to find the missing
amounts.
Scenario
Assets
Liabilities
Equity
1
$...
asked 26 minutes ago -
A population has a mean of 200 and a standard deviation of 60.
Suppose a sample...
asked 30 minutes ago