Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 15.2, Problem 2E
Program Plan Intro
To describe a recursive
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Determine a recurrence relation for the divide-and-conquer sum-computation algorithm. The
problem is computing the sum of n numbers. This algorithm divides the problem into two
instances of the same problem: to compute the sum of the first Ln/2J numbers and compute
the sum of the remaining Ln/2J numbers. Once each of these two sums is computed by
applying the same method recursively, we can add their values to get the sum in question.
T(n) = T(n/2) + 1
T(n) = 2T(n/2) + 2
T(n) = 2T(n/2) + 1
T(n) = T(n/2) + 2
Another recursive algorithm is applied to some data A = (a₁, ..., am) where
m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer ≥ 1. The running time T is
characterised using the following recurrence equations:
T(1) = c when the size of A is 1
T(m) = 2T (2) + c otherwise
Determine the running time complexity of this algorithm.
Write the Python code to find the transitive closure when given zero-one matrix. DO NOT use the Warshall Algorithm in this code. Pseudo code:
A := MR
B := A
for i := 2 to n
A:= A ⊙ MR
B:= B ∨ A
return B (the zero-one matrix for R*)
Chapter 15 Solutions
Introduction to Algorithms
Ch. 15.1 - Prob. 1ECh. 15.1 - Prob. 2ECh. 15.1 - Prob. 3ECh. 15.1 - Prob. 4ECh. 15.1 - Prob. 5ECh. 15.2 - Prob. 1ECh. 15.2 - Prob. 2ECh. 15.2 - Prob. 3ECh. 15.2 - Prob. 4ECh. 15.2 - Prob. 5E
Ch. 15.2 - Prob. 6ECh. 15.3 - Prob. 1ECh. 15.3 - Prob. 2ECh. 15.3 - Prob. 3ECh. 15.3 - Prob. 4ECh. 15.3 - Prob. 5ECh. 15.3 - Prob. 6ECh. 15.4 - Prob. 1ECh. 15.4 - Prob. 2ECh. 15.4 - Prob. 3ECh. 15.4 - Prob. 4ECh. 15.4 - Prob. 5ECh. 15.4 - Prob. 6ECh. 15.5 - Prob. 1ECh. 15.5 - Prob. 2ECh. 15.5 - Prob. 3ECh. 15.5 - Prob. 4ECh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12P
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Let m be a matrix with n rows and n columns whose entries are either 1 or 0. recall that the element of m on row i and column j is denoted by mij . the diagonal entries of m are {mii} for 1 ≤ i ≤ n. We call M permutable if it is possible to swap some of the rows and some of columns so that all diagonal entries are 1. Design a polynomial time algorithm that decides whether a binary matrix M is permutable or not. Note that we can swap any two rows or two columns. Also, the order in which these swaps are done is not important.arrow_forwardDetermine a recurrence relation for the divide-and-conquer sum-computation algorithm. The problem is computing the sum of n numbers. This algorithm divides the problem into two instances of the same problem: to compute the sum of the first ⌊n/2⌋ numbers and compute the sum of the remaining ⌊n/2⌋ numbers. Once each of these two sums is computed by applying the same method recursively, we can add their values to get the sum in question. A-)T(n)=T(n/2)+1 B-)T(n)=T(n/2)+2 C-)T(n)=2T(n/2)+1 D-)T(n)=2T(n/2)+2arrow_forwardPls Use Python If there is a non-singular matrix P such as P-1AP=D , matrix A is called a diagonalizable matrix. A, n x n square matrix is diagonalizable if and only if matrix A has n linearly independent eigenvectors. In this case, the diagonal elements of the diagonal matrix D are the eigenvalues of the matrix A. A=({{1, -1, -1}, {1, 3, 1}, {-3, 1, -1}}) : 1 -1 -1 1 3 1 -3 1 -1 a)Write a program that calculates the eigenvalues and eigenvectors of matrix A using NumPy. b)Write the program that determines whether the D matrix is diagonal by calculating the D matrix, using NumPy. Ps: Please also explain step by step with " # "arrow_forward
- We are given a code symmetry, that takes an n x n matrix as its argument. It returns true if the matrix is symmetric and false if it is not. The run time of the code is calculated by counting how many times the /= comparison is executed. procedure symmetry(M) for x:=1 to (n-1) for y:=(i+1) to n if mxy /= myx then return false else return true (a) Calculate the best case run time for symmetry (will be a number). (b) Calculate the worst case run time for symmetry (will be a polynomial in n, it will be helpful to draw matrices of different sizes and compare the number of comparisons to find a pattern). (c) Determine the worst case run time in big O notation (d) Using the following definition of big O notation, prove the answer to (c) Definition: Let f and g be functions from the set of integers or the set of real numbers to the set of real numbers. We say that f(x) is O(g(x)) if there are constants C and k such that whenever x > k. [This is…arrow_forwardShow Let f(.) be a computable, strictly monotonic function, that is, f(n+ 1) > f(n) for all n. Show B = {f(n) | n ∈ N} is recursive.arrow_forwardes remaining 8. Consider the function f:NxN-N defined recursively by: 1) Base case: Let meN and define (0,m) = 0 2) Recursive case: For any x,meN, x>0, define f(x,m) = (x-1,m) + (m+m) Prove the following theorem holds using proof by induction: Thereom: For any n,meN, m>0 we have (n.m) I m = n+n Fill in your answer here 9 Help BIU X, x L - ɔE =N E X Formatarrow_forward
- Consider an n by n matrix, where each of the n2 entries is a positive integer. If the entries in this matrix are unsorted, then determining whether a target number t appears in the matrix can only be done by searching through each of the n2 entries. Thus, any search algorithm has a running time of O(n²). However, suppose you know that this n by n matrix satisfies the following properties: • Integers in each row increase from left to right. • Integers in each column increase from top to bottom. An example of such a matrix is presented below, for n=5. 4 7 11 15 2 5 8 12 19 3 6 9 16 22 10 13 14 17 24 1 18 21 23 | 26 | 30 Here is a bold claim: if the n by n matrix satisfies these two properties, then there exists an O(n) algorithm to determine whether a target number t appears in this matrix. Determine whether this statement is TRUE or FALSE. If the statement is TRUE, describe your algorithm and explain why your algorithm runs in O(n) time. If the statement is FALSE, clearly explain why no…arrow_forward2. Expand the following recurrence to help you find a closed-form solution, and then use induction to prove your answer is correct. T(n) = T(n-1) + 5 for n> 0; T(0) = 8. 3. Give a recursive algorithm for the sequential search and explain its running time.arrow_forwardCreate a 3-by-3 matrix. A = [1 7 3; 2 9 12; 5 22 7]; Calculate the right eigenvectors, V, the eigenvalues, D, and the left eigenvectors, W. [V,D,W] eig(A) %3!arrow_forward
- 7. For n 2 1, in how many out of the n! permutations T = (T(1), 7(2),..., 7 (n)) of the numbers {1, 2, ..., n} the value of 7(i) is either i – 1, or i, or i +1 for all 1 < i < n? Example: The permutation (21354) follows the rules while the permutation (21534) does not because 7(3) = 5. Hint: Find the answer for small n by checking all the permutations and then find the recursive formula depending on the possible values for 1(n).arrow_forwardThe Legendre Polynomials are a sequence of polynomials with applications in numerical analysis. They can be defined by the following recurrence relation: for any natural number n > 1. Po(x) = 1, P₁(x) = x, Pn(x) = − ((2n − 1)x Pn-1(x) — (n − 1) Pn-2(x)), n Write a function P(n,x) that returns the value of the nth Legendre polynomial evaluated at the point x. Hint: It may be helpful to define P(n,x) recursively.arrow_forwardGive a clear description of an efficient algorithm for finding the k smallest element of a very large n_element vector. Compare its running time with that of other plausible ways of achieving the same results, including that of applying. K time your solution for part(a).[note that in part(a) the result of the function consists of one element, where as here it consists of k elements. As above, you may assume for simplicity that all the element of the vector are different.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Binary Numbers and Base Systems as Fast as Possible; Author: Techquikie;https://www.youtube.com/watch?v=LpuPe81bc2w;License: Standard YouTube License, CC-BY
Binary Number System; Author: Neso Academy;https://www.youtube.com/watch?v=w7ZLvYAi6pY;License: Standard Youtube License