![Question3 10 pts Let A [L.n] be a max-heap with n > 1 and consider the index ị such that l 〈 i 〈 n . Assume that all the elem](http://img.homeworklib.com/images/e55fe87b-7366-4871-af6c-eb8d081b1a80.png?x-oss-process=image/resize,w_560)
Homework Answers
![RecvaseKey CA,I) ACǐ]..n ght-) et C i3.lett clix Note,-Cordi Hons dill be checked after- checkby the ovlabluty o nodes only](http://img.homeworklib.com/images/037ba1bd-17e7-4939-b2f9-79e44b724902.png?x-oss-process=image/resize,w_560)
"if you have any doubts,
please use comment section. "
Add Answer to:
Question3 10 pts Let A [L.n] be a max-heap with n > 1 and consider the index ị such that l 〈 i 〈 n . Assume that a...
10 pts Question 2 Let A[1.n] and B[1.m] be two arrays, where n 2 mz 1....
10 pts Question 2 Let A[1.n] and B[1.m] be two arrays, where n 2 mz 1. Use pseudocode to write an algorithm which prints TRUE if the array A contains the sequence B, and FALSE otherwise. The elements from B must appear in order, but they do not have to occur as a contiguous sequence in A. The running time of the algorithm must be O(n). some examples: Here are <5,6,8> then the algorithm prints TRUE - if A =...
Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j...
Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j <= n, the index j is a happy index if A[i] < A[j] for all 1 <= i < j. Describe an O(n)- time algorithm that finds all the happy indices in the array A. Partial credit will be given for an O(n log(n))-time algorithm and a minimal credit will be given for an O(n^2) –time algorithm. What is the running time of your...
Suppose we are given two sorted arrays (nondecreasing from index 1 to index n) X[1] ·...
Suppose we are given two sorted arrays (nondecreasing from index 1 to index n) X[1] · · · X[n] and Y [1] · · · Y [n] of integers. For simplicity, assume that n is a power of 2. Problem is to design an algorithm that determines if there is a number p in X and a number q in Y such that p + q is zero. If such numbers exist, the algorithm returns true; otherwise, it returns false....
An m×n array A of real numbers is a Monge array if for all i,j,k, and l such that 1≤i<k≤m and ...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
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...
9. [10 points) Consider the following algorithm: procedure Algorithm(n: positive integer; ddd: distinet integers) for k:=1 to n-1 for 1-1 to n-k print(k, I, di,da...-1,dn) if ds dti then interch...
9. [10 points) Consider the following algorithm: procedure Algorithm(n: positive integer; ddd: distinet integers) for k:=1 to n-1 for 1-1 to n-k print(k, I, di,da...-1,dn) if ds dti then interchange dy and d (a) Assume that this algorithm receives as input the integer n 6 and the input sequence 하하하하하하, Miss ^-ruteae rehen i12|3141516 Fill out the table below: ds ds (b) Assume that the algorithm receives the same input values as in part a). Once the algorithm finishes, what...
17. Consider the following algorithm: procedure Algorithm(n: positive integer; di,d2.. ,dn: distinct integers) for 1 to n-1 for 1 to n-k if ddi+ then interchange di and di+ print(k, I, d,ddn-1, d...
17. Consider the following algorithm: procedure Algorithm(n: positive integer; di,d2.. ,dn: distinct integers) for 1 to n-1 for 1 to n-k if ddi+ then interchange di and di+ print(k, I, d,ddn-1, dn) (a) |3 points Assume that this algorithm receives as input the integer-6 and the corresponding input sequence 41 36 27 31 17 20 Fill out the table below ds (b) 1 point Assume that the algorithm receives the same input values as in part a). Once the algo-...
I need answers for attached questions Question 3. (30 Pts) Let LU is the Crout LU...
I need answers for attached questions
Question 3. (30 Pts) Let LU is the Crout LU decomposition of the nx n tridiagonal matrix 01. 1012 02.1 222 223 03.2 23,3 43,4 Gr-1,-2 -1,-1 On-1,60 BIL 332/532 - Numerical methods Homework 2 Note that the Crout decomposition implies that the diagonal of U consists of 1s. Besides, ky 0 if j < (i-1) and j>i and wij = 0 ifj<i and j> (i+1) because of the nonzero structure of A. Write...
1. [5 marks Show the following hold using the definition of Big Oh: a) 2 mark...
1. [5 marks Show the following hold using the definition of Big Oh: a) 2 mark 1729 is O(1) b) 3 marks 2n2-4n -3 is O(n2) 2. [3 marks] Using the definition of Big-Oh, prove that 2n2(n 1) is not O(n2) 3. 6 marks Let f(n),g(n), h(n) be complexity functions. Using the definition of Big-Oh, prove the following two claims a) 3 marks Let k be a positive real constant and f(n) is O(g(n)), then k f(n) is O(g(n)) b)...
Java Program Create a class to store an array of with enough space to store 10 integer values. Us...
Java Program Create a class to store an array of with enough space to store 10 integer values. Using the principle of recursion, implement the following: *getSize : returns the size of the array. *get (i): returns the i-th element of the array. If the element does not exist, it throws a "NoSuchElementException” which is a subclass of Java class RunTimeException. *add (val): inserts value as the last element of the array. If necessary, double the size of the current...
10 pts Question 2 Let A[1.n] and B[1.m] be two arrays, where n 2 mz 1. Use pseudocode to write an algorithm which prints TRUE if the array A contains the sequence B, and FALSE otherwise. The elements from B must appear in order, but they do not have to occur as a contiguous sequence in A. The running time of the algorithm must be O(n). some examples: Here are <5,6,8> then the algorithm prints TRUE - if A =...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
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...
9. [10 points) Consider the following algorithm: procedure Algorithm(n: positive integer; ddd: distinet integers) for k:=1 to n-1 for 1-1 to n-k print(k, I, di,da...-1,dn) if ds dti then interchange dy and d (a) Assume that this algorithm receives as input the integer n 6 and the input sequence 하하하하하하, Miss ^-ruteae rehen i12|3141516 Fill out the table below: ds ds (b) Assume that the algorithm receives the same input values as in part a). Once the algorithm finishes, what...
17. Consider the following algorithm: procedure Algorithm(n: positive integer; di,d2.. ,dn: distinct integers) for 1 to n-1 for 1 to n-k if ddi+ then interchange di and di+ print(k, I, d,ddn-1, dn) (a) |3 points Assume that this algorithm receives as input the integer-6 and the corresponding input sequence 41 36 27 31 17 20 Fill out the table below ds (b) 1 point Assume that the algorithm receives the same input values as in part a). Once the algo-...
I need answers for attached questions
Question 3. (30 Pts) Let LU is the Crout LU decomposition of the nx n tridiagonal matrix 01. 1012 02.1 222 223 03.2 23,3 43,4 Gr-1,-2 -1,-1 On-1,60 BIL 332/532 - Numerical methods Homework 2 Note that the Crout decomposition implies that the diagonal of U consists of 1s. Besides, ky 0 if j < (i-1) and j>i and wij = 0 ifj<i and j> (i+1) because of the nonzero structure of A. Write...
1. [5 marks Show the following hold using the definition of Big Oh: a) 2 mark 1729 is O(1) b) 3 marks 2n2-4n -3 is O(n2) 2. [3 marks] Using the definition of Big-Oh, prove that 2n2(n 1) is not O(n2) 3. 6 marks Let f(n),g(n), h(n) be complexity functions. Using the definition of Big-Oh, prove the following two claims a) 3 marks Let k be a positive real constant and f(n) is O(g(n)), then k f(n) is O(g(n)) b)...
Most questions answered within 3 hours.
-
The mean waiting time at the drive-through of a fast-food
restaurant from the time an order...
asked 8 minutes ago -
The pitch (p) of a helix is defined as p = dn, in which n is...
asked 10 minutes ago -
Do you agree that the declining stock of social capital is the
blame for the failure...
asked 13 minutes ago -
A researcher is interested in whether coffee consumption helps
with performance on reading comprehension tasks. The...
asked 23 minutes ago -
it has been estimated since the beginning of the human race that
about 133 metric ton...
asked 29 minutes ago -
Where must Medicare prescription drug plans allow for
participants to fill their prescriptions?
asked 32 minutes ago -
Five moles of monatomic ideal gas have initial pressure 2.50 ×
103 Pa and initial volume...
asked 46 minutes ago -
A resistor and the capacitor are used to control the timing in
the RC circuit of...
asked 46 minutes ago -
Living in a group could bring several disadvantages to an
individual. What are some of the...
asked 1 hour ago -
Complete and balance the following reactions. In case of no
reaction occurring write NR.
Mix #1:...
asked 1 hour ago -
If an economy consumes 75% of any increase in income, then an
increase in autonomous investment...
asked 1 hour ago -
A shotputter throws the shot with an initial speed of 15.8 m/s
at a 38.0 ∘...
asked 1 hour ago