Compute the edit distance between “PLASMA” and “ALTRUISM”. A) Write down the 7 × 9 array of distances between all prefixes as computed by the following algorithm. int EditDistance(char s[1..m], char t[1..n]) { // for all i and j, d[i,j] will hold the edit distance between the first i characters of s and the first j characters of t; note that d has (m+1)x(n+1) values declare int d[0..m, 0..n] for i from 0 to m d[i, 0] := i // the distance of any first string to an empty second string for j from 0 to n d[0, j] := j // the distance of any second string to an empty first string for j from 1 to n { for i from 1 to m { if s[i] = t[j] then d[i, j] := d[i-1, j-1] // no operation required else d[i, j] := minimum ( d[i-1, j] + 1, // a deletion d[i, j-1] + 1, // an insertion d[i-1, j-1] + 1 // a substitution ) } } return d[m,n]

Compute the edit distance between “PLASMA” and “ALTRUISM”. A) Write down the 7 × 9 array of distances between all prefixes as computed by the following algorithm. int EditDistance(char s[1..m], char t[1..n]) { // for all i and j, d[i,j] will hold the edit distance between the first i characters of s and the first j characters of t; note that d has (m+1)x(n+1) values declare int d[0..m, 0..n] for i from 0 to m d[i, 0] := i // the distance of any first string to an empty second string for j from 0 to n d[0, j] := j // the distance of any second string to an empty first string for j from 1 to n { for i from 1 to m { if s[i] = t[j] then d[i, j] := d[i-1, j-1] // no operation required else d[i, j] := minimum ( d[i-1, j] + 1, // a deletion d[i, j-1] + 1, // an insertion d[i-1, j-1] + 1 // a substitution ) } } return d[m,n]

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

Answer in java script Create a function that returns true if the first array can be nested inside the second. arr1 can be nested inside arr2 if: 1. arr1's min is greater than arr2 's min. 2. arr1's max is less than arr2 's max. Examples canNest([1, 2, 3, 4], [0, 6]) true canNest ([3, 1], [4, 0]) → true canNest ([9, 9, 8], [8, 9]) → false canNest([1, 2, 3, 4], [2, 3]) - false
Q: Write a program / Pseudo code / Algorithm that inserts the following numbers into two Separate arrays. L1 à 50 30 25 75 82 28 77 L2 à 50 40 25 75 80 21 37 30 After Insertion median should be calculated for each adjacent element from both array structures, after computing median print / Output that array M. if M is the median them M0 = (L1[0]+L2[0]) /2 M1 = (L1[1]+L2[1]) /2 …………..
___5___. You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters. Return the maximum possible length of s. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements. Example 1: Input: arr = ["un","iq","ue"] Output: 4 Explanation: All the valid concatenations are: - "" - "un" - "iq" - "ue" - "uniq" ("un" + "iq") - "ique" ("iq" + "ue") Maximum length is 4. Question is here to solve------.
6.Code for- an array of meeting time intervals consisting ofstart and end times [[s1,e1],[s2,e2],...] (si < ei),determine if a person could attend all meetings. For example,Given [[0, 30],[5, 10],[15, 20]],return false.""".
Write a code segment that initializes each cell in a three-dimensional array with an integer that represents its three index positions. Thus, if a position is (depth, row, column), the integer datum at position (2, 3, 3) is 233.
Rewrite the function pfind which searches an array for a specific value, and returns a pointer to the value in the array (if found), and nullptrif not. Instead of using a loop, use the standard algorithm find. arrays.cpp #include using namespace std; 1 3 const double* pfind(const double a[], size_t len, double value) { 4 7 8 | 9. } CodeCheck Reset
Create a function that takes an array of numbers and returns the second largest number. IN JS Examples secondLargest([10, 40, 30, 20, 50]) → 40 secondLargest([25, 143, 89, 13, 105]) → 105 secondLargest([54, 23, 11, 17, 10]) → 23
5. The following code relates to measurements of the concentration of paracetamol in a patient's bloodstream after the ingestion of a 500 mg paracetamol tablet. # Paracetamol concentration from pylab import * time = array([0, 0.5, 2, 6, 10, 12]) conc= array([0, 25, 34, 18, 6, 2]) plot (time, conc) xlabel("Time (hours)") ylabel ("Concentration (ug/mL)") show() total = 0 i = 1 while i < size (time): a = (time [i] time [i-1]) * (conc[i-1] + conc[i]) / 2 print (i, a) total total + a i i + 1 print (total) (a) Using the axes below (or drawing your own), create a plot of the data given in the code. Join the data points using straight lines segments. Use the information given in the code to ensure your graph is appropriately communicated.
write aprogram that inputs a line of text into chae array [100].output the line in alterante upercase letters and lowercase letters.
in C language Use one-dimensional arrays to solve the following problem. Read in two sets of numbers, each having 10 numbers. After reading all values, display all the unique elements in the collection of both sets of numbers. Use the smallest possible array to solve this problem.
Create a function that returns the majority vote in an array. A majority vote is an element that occurs > N/2 times in an array (where N is the length of the array). Examples majorityVote(["A", "A", "B"]) → "A" majorityVote(["A", "A", "A", "B", "C", "A"]) ➡ "A" majorityVote(["A", "B", "B", "A", "C", "C"]) → NULL
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);