Write Algorithm procedure code to illustrates the procedure for Fibonacci search. Here n, the number of data elements is such that: i) Fk+1 > (n+1); and ii) Fk + m = (n +1) for some m ≥ 0, where Fk+1 and Fk are two consecutive Fibonacci numbers.

Given two arrays of integers, write a function to find the intersection of the arrays. The intersection should include only distinct elements and the result should be in sorted order. Solve this problem using the hash set approach.

Write Algorithm procedure code to illustrates the procedure for Fibonacci search. Here n, the number of data elements is such that:i) Fk+1 > (n+1); andii) Fk + m = (n +1) for some m ≥ 0, where Fk+1 and Fk are two consecutiveFibonacci numbers.

2. Suppose the function MergeSort( Vis a recursive implementation of the merge sort algorithm, which takes as input an integer array A. How many times is MergeSort( ) recursively called, if A is of size n? Answer: Select T Select Olnlogn 3. How many times is the Merge routine called in total, O(1) Oln 2) nswer. ISelect ]

Prime numbers can also be generated by an algorithm known as the Sieve of Eratosthenes . The algorithm for this procedure is presented here. Write a program that implements this algorithm so as to find all prime numbers up to n = 150. Sieve of Eratosthenes Algorithm To Display All Prime Numbers Between 1 and n Step 1: Define an array of integers P . Set all elements P i to 0, 2 <= i <= n. Step 2: Set i to 2. Step 3: If i > n , the algorithm terminates. Step 4: If P i is 0 (value i is a prime number), then i is prime and display its value. Step 5: For all positive integer values of j , such that i * j ≤ n , set P i ∗ j to 1 (non - prime). Step 6: Add 1 to i and go to step 3

the drop down bar is the selection you have to choose from for each answer

Apply merge sort on below array 12 31 25 8 32 17 40 42

In python, how do you generate a distance matrix H where in each entry hij, the distance between row i and row j are stored, distance is computed by the inner product <x,y>C := xTCy, where the matrix C is a 3x3 matrix: [3 1 6 1 2 1 6 1 27]. The dataset is a 26x5 matrix and I need to find the distance using the above inner product between each row - I should end up with a 26x26 distance matrix H, where each diagonal entry (i=j) is 0.

The contents of the array below represent a BST (Binary Search Tree). What would be the contents of the array after 30 is deleted. Briefly explain how 30 would be deleted. Use an X to represent any empty spots in the array. 30 2050 10 25 40 60

The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1...n] and return to step 1 –Otherwise, set your range of elements to [0...(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

1. Write an algorithm to determine whether a given element x belongs to a set S := {s1, . . . , sn}.

The pseudo-code to create the matrix:Procedure AdjacencyMatrix(N): //N represents the number of nodesMatrix[N][N]for i from 1 to N for j from 1 to N Take input -> Matrix[i][j] endforendfor Make Java code implemented using above pseudo-code:

Use recurrence relation: T(n) = T(n – 1) + n if n> 1 T(n) = 1 if n = 1 Use the substitution method with a guess of cn2. Sub.Remainder: What is the remainder after substituting in the guess? Enter an expression