Write an algorithm called MatrixRowMultiple(A[0...n – 1, 0... n – 1]) which takes an n x n matrix A and outputs if true, if each element in the first row is twice the value of the corresponding element of row 2. Otherwise, it returns false. (ii) Determine the worst case complexity of the algorithm which you have developed.

Consider the following algorithm that uses a sorted list of n elements (alist). What is the worst case runtime of this algorithm? for each element in alist 1. ask the user for an input, call it value 2. search value in alist using the binary search algorithm 3. if value exists in alist, print "successful" otherwise print "unsuccessful" Question 10 options: O(2^n) O(n log n) O(log n) O(n^2) O(n) O(1)

in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:

What's the output of the code below? library(ggplot2) p <- ggplot(data = gapminder, %3D mapping = aes(x = year, y = profit)) %3D %3D p + geom_point(alpha = 0.15) + geom_smooth (method %3D = "1m") Select one: O A. Creating a scatter plot with a MASS model В. Creating a scatter plot with an Ordinary Least Squares (OLS) model О с. Creating a scatter plot with a Polynomial Curve D. Creating a scatter plot with a robust regression model

Consider the following algorithm that uses a list of n elements (alist). What is the worst case runtime of this algorithm? for each element in alist 1. ask the user for an input, call it value 2. search value in alist using linear search 3. if value exists in alist, print "successful" otherwise print "unsuccessful" Question options: a. O(log n) b. O(n log n) c. O(2^n) d. O(1) e. O(n) f. O(n^2)

Suppose you have m sorted arrays, each with n elements, and you want to combine them into a single sorted array with mn elements. 1. If you do this by merging the first two arrays, next with the third, then with the fourth, until in the end with the last one. What is the time complexity of this algorithm, in terms of m and n? 2. Give a more efficient solution to this problem, using divide-and-conquer. What is the running time?

solve

Question A: Mapping. The two-sum problem is a popular algorithm problem. Given an array of integers and an integer target, return indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. For example, suppose we have an array arr = [1,10,100]. If the target is 11, you should return [0,1] because arr[0] + arr[1] = 1+ 10 = 11. If the target is 101, you should return [0,2] because arr[0] + arr[2] = 1+ 100 = 101. Complete this problem in O(n). Hint: using a hash table.

Consider a variation of the Bucket Sort algorithm which uses an unknown number of buckets. We're given that the worst-case runtime of the algorithm is O(n.), Let the number of buckets be n* (n to the power of x). Fill in the following box with the proper numeric value of x such that the algorithm has the given runtime. For example, you could fill in 0, 1, 2, 3, 3.14 4.2, etc. Recall that we use Insertion Sort to sort each bucket. Answer:

For part A, how what would the pseudo-code visually be when trying to visualize an efficient algorithm? As for Part B, what would determine the space and complexity?

Question: Design an algorithm for this problem with worst-case runtime of O(n).

Problem 2. Suppose we have an array A[1 : n] which consists of numbers {1,...,n} written in some arbitrary order (this means that A is a permutation of the set {1,...,n}). Our goal in this problem is to design a very fast randomized algorithm that can find an index i in this array such that A[i] mod 8 € {1,2}, i.e., the reminder of dividing A[i] by 8 is either 1 or 2. For simplicity, in the following, we assume that n itself is a multiple of 8 and is at least 8 (so a correct answer always exist). For instance, if n = 8 and the array is A = [8,7, 2,5, 4, 6,3, 1], we want to output either of indices 3 or 8. (a) Suppose we sample an index i from {1,...,n} uniformly at random. What is the probability that i is a correct answer, i.e., A[i] mod 8 E {1,2}? (b) Suppose we sample m indices from {1,...,n} uniformly at random and with repetition. What is the probability that none of these indices is a correct answer? Now, consider the following simple algorithm for this problem: Find-Index-1(A[1:...

PLEASE USE PYTHONGiven a jungle matrix NxM:jungle = [ [1, 0, 0, 0], [1, 1, 0, 1], [0, 1, 0, 0], [1, 1, 1, 1,]]Where 0 means the block is dead end and 1 means the block can be used in the path fromsource to destination.Task:Starting at position (0, 0), the goal is to reach position (N-1, M-1).Your program needs to build and output the solution matrix – a 4x4 matrix with 1’s inpositions used to get from the starting position (0,0) to the ending position (N-1,M-1)with the following constraints:You can only move one space at a timeYou can only in two directions: forward and down.You can only pass thru spaces on the jungle matrix marked ‘1’If you cannot reach the ending position – print a message that you’re trapped in thejungleAlgorithm:If destination is reachedprint the solution matrixElseMark current cell in the solution matrixMove forward horizontally and recursively check if this leads to a solution If there is no solution, move down and recursively check if this leads to a solution If...