Dynamic Programming: What is the main difference between the Longest Common Subsequence (LCS) and the longest common substring of two sequences of characters? Use the LCS-LENGTH procedure to find the Longest Common Subsequence (LCS) of two sequences: A <1, 0, 0, 1, 0, 1, 0, 1> and B <0, 1, 0, 1, 1, 0, 1, 1, 0>. You need to show the step-by-step procedure based on a table and also illustrate the path to reconstruct the LCS you have found by drawing lines through the centers of the grids on the path in the table. What is the running time of the LCS algorithm based on dynamic programming? Justify your answer.

Write a function nth_largest that takes any list of numbers num_lst and a positive integer n, and that returns the nth largest element in num_lst. For example, if lst = [-4, -5, 1, 6, 2, -7, 5], then nth_largest(lst, 2)should return 5 and nth_largest(lst, 5) should return-4.

Complete the given CPP function definition and run it for a test case. void swapString(string &str, int i, int j) { //check whether i and j are in the range //0 to str.length ()-1 and i is less than j. //if the conditions are true then swap the //characters at index i and j in the string. }

*Data Structures (a) The function g(n) is a/an [?] bound on f(n). A. upper B. tight C. lower (b) The function f(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (c)  The function g(n) is a/an [?] bound on h(n). A. upper B. tight C. lower (d) The function j(n) is a/an [?] bound on g(n). A. upper B. tight C. lower   (e) The function h(n) is a/an [?] bound on k(n). A. upper B. tight C. lower (f)  The function k(n) is a/an [?] bound on f(n). A. upper B. tight C. lower

Write a function ones_and_tens_digit_histogram(numbers) that takes as input a list of numbers and produces as output a list of 10 numbers.   Each element of the result indicates the frequency with which that digit appeared in the ones place or the tens place in the input. here is an example call and result:   Call: ones_and_tens_digit_histogram([0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765]) Return: [0.21428571428571427, 0.14285714285714285, 0.047619047619047616, 0.11904761904761904, 0.09523809523809523, 0.09523809523809523, 0.023809523809523808, 0.09523809523809523, 0.11904761904761904, 0.047619047619047616] In this example call, the index 1 of the list contains the element 0.14285714285714285 because the value 1 appears in 14.285714285714285% of the ones or tens digits of the given numbers. In a number that is less than 10, such as 3, the tens place is implicitly zero. That is 3 must be treated as 03. Your code should treat the tens digits…

Please write the function using SML -

Write the polynomial function, which takes a list of tuples and returns the polynomial function corre- sponding to that list. Each tuple in the input list consists of (i) the coefficient, and (ii) the exponent. # (* below is the polynomial function f(x) = 3x^3 2x + 5 *) # let f = polynomial [3, 3; -2, 1; 5, 0];; val f : int -> int = # f 2; ; : int = 25

Program in C

Which of the following is the definition of a higher-order function?     func xs = sum (map (^2) xs)     func x = x * 2     func (x,y) = (y,x)     func (x:y:zs) = y     func f [x,y] = [f x, f y]

Define a function named check_game_finished (encrypted_list) which takes a list of characters as a parameter. The function returns True if the game is over, and False otherwise. The game is over when there is no longer any "*" characters in the parameter list. For example: Test Result False True data = ['h', '*', ¹*¹, ¹*¹, ¹*'] print(check_game_finished (data)) data = ['h', 'e', '1', '1', 'o'] print(check_game_finished(data)) data = ['s', ¹*¹ 'd'] False print(check_game_finished (data))