A Vandermonde Matrix is a two-dimensional array in which the terms in each row form a geometric progression. In other words, for a given list of real values £0, x1, . . ., Im Є R, the Vandermonde matrix formed from these values is given by: x 1 ΤΟ 1 21 17 ... V = B B 1 xm x where m, nЄ N. The module test contains a list h of integers. Construct a Numpy array that gives a Vandermonde matrix formed from these values, with m equal to the length of this list and n = 15, and assign this array to the variable a.

You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index.  Write code with explanation

haskell is the programming language

Write a program that inputs a matrix and displays the trans- pose of that matrix. A transpose of a matrix is obtained by converting all the rows of a given matrix into columns and vice versa.

Complete the implementation of scrabble.c, such that it determines the winner of a short scrabble-like game, where two players each enter their word, and the higher scoring player wins. Notice that we’ve stored the point values of each letter of the alphabet in an integer array named POINTS. For example, A or a is worth 1 point (represented by POINTS[0]), B or b is worth 3 points (represented by POINTS[1]), etc. Notice that we’ve created a prototype for a helper function called compute_score() that takes a string as input and returns an int. Whenever we would like to assign point values to a particular word, we can call this function. Note that this prototype is required for C to know that compute_score() exists later in the program. In main(), the program prompts the two players for their words using the get_string() function. These values are stored inside variables named word1 and word2. In compute_score(), your program should compute, using the POINTS array, and return the score…

Write a program to maintain a list of items as a circular queue, which isimplemented using an array. Simulate insertions and deletions to the queue anddisplay a graphical representation of the queue after every operation.Write a program to maintain a list of items as a circular queue, which isimplemented using an array. Simulate insertions and deletions to the queue anddisplay a graphical representation of the queue after every operation.

In Java Script

Person receives text (string) messages on his/her phone. Message memory of a phone is very limited. A buffer is provided for storing messages when phone memory gets full. Message from buffer is loaded into phone memory when space is available. Messages are moved from buffer to phone in such a way that first received message is viewed first on screen. Implement buffer only using array. question solved in data structure

Jeff loves to develop code for random scenarios. Today Jeff started playing with a couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B with random numbers. Jeff visits each index i (1 <= i <= N) in random order. When at i, he selects another random indexj such that j is greater or equal to i. He then increments A[i], A[i+1], A[i+2] ... A[j] by 1. Finally, if for any index i, A[i] is greater than B[i], he then throws away that array A. For a given B, calculate the number of different arrays A, that Jeff can end up with. Two arrays are called different if there exists an index where the arrays have different values. Help Jeff in creating a C++ code that prints a single line containing the required answer modulo 109 + 7. Sample Test Case: 1 3 111 Result: 2

A cryptarithm is a mathematical puzzle for which the goal is to find the correspondence between letters and digits, such that the given arithmetic equation consisting of letters holds true when the letters are converted to digits. You have an array of strings crypt, the cryptarithm, and an an array containing the mapping of letters and digits, solution. The array crypt will contain three non-empty strings that follow the structure: [word1, word2, word3], which should be interpreted as the word1 + word2 = word3 cryptarithm. If crypt, when it is decoded by replacing all of the letters in the cryptarithm with digits using the mapping in solution, becomes a valid arithmetic equation containing no numbers with leading zeroes, the answer is true. If it does not become a valid arithmetic solution, the answer is false. Note that number 0 doesn't contain leading zeroes (while for example 00 or 0123 do).