Write a Python function: def second (A) which takes as input an array A of integers and returns the second smallest element of A If A has less than two elements, the function should return None. The array A should not be changed. You can assume all elements of A are different. your solution should be efficient and run in linear time. For example, second([1,-5,3,4]) should return 1. On the other hand, second([1]) should return None.
Q: Write a program that reads two matrices of integers. It then generates the sum and difference of the…
A: A = [[5,7,3], [1 ,8,6], [4 ,2,9]] B = [[5,1,7], [9,2,4], [8,3,6]] sum = [[0,0,0],…
Q: write a python function that replaces the None values with the average from that column. example:…
A: Step 1: In this function, I have created a list to store the result. Step 2: Next, I have iterated…
Q: You are asked to write a C function that finds the longest sequence of increasing numbers in an…
A: Given The answer is given below: #include<stdio.h> void printSubArray(int array[], int start,…
Q: Consider an array of size n. Write a function that takes n values as input for the array, swaps…
A: Consider an array of size n. Write a function that takes n values as input for the array, swaps…
Q: consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user,…
A: ALGORITHM:- 1. Make a character or string array out of the string. 2. Compare the letters; if the…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: Algorithm - Take input from user. Now use the below logic - nums.map(function(el){…
Q: Write a program that reads two matrices of integers. It then generates the sum, difference and…
A: Actually, program is an executable software that runs on a computer.
Q: Write a program that creates an array of size 6 and input values to it through user input. It turns…
A: Explanation: So we have an array in which values are biased Let understand it by example Let take an…
Q: Implement the following function, without using any data structure or #include /* Given two…
A: we are given two vectors of characters and need to determine of they are permutations of each other.…
Q: Write a program, which reads two arrays from the console and checks whether they are equal (two…
A: Objective: This program reads two arrays from the console and checks whether they are equal or not.…
Q: Complete the below function which takes the coefficients of a polynomial P(x) as a tuple, and a list…
A: #function def polynomial(coefficients, values): #list to store computed values of P(x)…
Q: Write a program that reads two matrices of integers. It then generates the sum, difference and…
A: // As the language is not mentioned in the question writing the program in C // Initialized the…
Q: Write a program to print the reverse of a given array. Make a function reverse(int a[l) which prints…
A: Java program to implement a function that prints the array in reverse order.
Q: write a python function that replaces the None values with the average from that column. example:…
A: Here I have defined the function named replace_with_mean(). In this function, I have created a list…
Q: Write a functional Python program that takes the integer array given below as a parameter and…
A: Summary This is basically a python program in which we are given a list of numbers. There are…
Q: PYTHON!!!! Complete the below function which takes the coefficients of a polynomial P(x) as a…
A: #function which takes the coefficients of a polynomial P(x) as a tuple, and a list of values,#and…
Q: Write in Java. Given an array of integers A, find the Majority Element. Majority Element in an…
A: Code: import java.util.Scanner;class DriverMain {public static void main(String args[]) {//main…
Q: Let multidimensional array a with size 3 x 4 be {1,2,3,4,5,6,7,8,9,10,11,12} and b be the last digit…
A: Required: Required code with comments for explanation and screenshot of both code and output…
Q: Write a program that reads two matrices of integers. It then generates the sum and difference of the…
A: The solution to the given problem is below. **Note: As programing language is not mentioned in the…
Q: Program in python There is function F. Give an integern (n 2 2), consider the prime factorization n…
A: A prime range is a fine integer, that is divisible on 1 and itself. the alternative integers,…
Q: Write a Python function def excludeSum(A,f) that takes as input an array of integers A and a…
A: Algorithm 0.Start 1.sum = 0 2.For i = 0 to n-1 where n is length of array A 2.1if f(A[i]) is false…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: Algorithm - Take input from user. Now use the below logic - nums.map(function(el){…
Q: Write a Python code implementing naïve LCS recursive, LCS DP, and LCS bottom-up versions. Then…
A: import time def lcs_recursive(i,j,X,Y): #If one of X,Y completed if i==-1 or j==-1: return…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: The above question is solved in step 2 :-
Q: Implement a Cfunction that return1 if a two-dimensional array of characters has your first four…
A: As mentioned I will not use string.h library. I am solving the problem in 2 parts First I will…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: Algorithm - Take input from user. Now use the below logic - nums.map(function(el){…
Q: Solution in Java Create a function that takes an array of increasing letters and return the missing…
A: - We are solving the missing character using ascii code value by comparing the ascii code of the…
Q: Write a Python function: def second (A) which takes as input an array A of integers and returns the…
A: Solution: Given,
Q: Create a python function that will return the array in the form of [x1,y1,x2,y2,…,xn,yn] from an…
A: Required: Create a python function that will return the array in the form of [x1,y1,x2,y2,…,xn,yn]…
Q: A number is Zygodrome if it can be partitioned into clusters of repeating digits with a length…
A: Step-1: Start Step-2: function isZygodrome(num) Step-2.1: Convert num into string and strore into…
Q: A number is Zygodrome if it can be partitioned into clusters of repeating digits with a length…
A: function isZygodrome(num) { let chars = num.toString().split(''); let uniques = new Set(chars); let…
Q: if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 =…
A: Lets see the solution.
Q: Write a Java program that implements the function named zeroEnd so that it returns an array that…
A: Need to write program for zeroEnd which returns : And array which contains the exact same numbers as…
Q: Write a function that gets an array of ints of length n, and a number k, and returns the longest…
A: #include <stdio.h>//method to find and return the longest subsequence of consecutive k's in…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: In this problem, we need to design the code in the JS programming language. Input - Array Output…
Q: Solution in Java Create a function that takes an array of increasing letters and return the missing…
A: Algorithm - Take input from user. Now use the below logic - for(int i = 1; i < arr.length;…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: In this problem, we need to design the code in the JS programming language. Input - Array Output…
Q: Let multidimensional array a with size 3x4 be {1,2,3,4,5,6,7,8,9,10,11,12} and b be the last digit…
A: Given:
Q: consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user,…
A: A string made up of the letters A, M, and T is provided to us. We must sort that string using the…
Q: Given a sequence like [1, 2, 3, 4, 5], and an array of sub sequences like [[1,2], [3, 4], [5]],…
A: - We have to check if the subsequences can create the sequence provided or not.
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: In this problem, we need to design the code in the JS programming language. Input - Array Output…
Q: Write a program that has a function that returns the index of the smallest element in an array of…
A: In this question, we are asked to write a C++ program which return the minimum element in the array…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: Algorithm - Take input from user. Now use the below logic - nums.map(function(el){…
Q: D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of…
A: CODE import randomfrom collections import Counterimport numpy as np def diceSim(D1,D2,trials):…
Q: Write a function that takes in an array of integers and returns the integers that are either…
A: The above question is solved in step 2 :-
Q: In python, Problem Description: Sheldon and Leonard are physicists who are fixated on the BIG BANG…
A: #python program k=int(input()) s=input() res="" for i in range(0,len(s)): x=ord(s[i])-65 for…
Q: Solution in Java Create a function that takes an array of increasing letters and return the missing…
A: Input - Array of String Output - missing letter logic - for(int i = 1; i < arr.length; i++){…
Q: Write a python function that computes an interpolating polynomial through a set of points (xi , yi )…
A: The solution code for the above problem can be found below, for the polynomial coefficients numpy…
Step by step
Solved in 2 steps with 1 images
- Write a function that gets an array of points and sorts the array using qsort(). Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next because 32+22 = 13 is the second smallest Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so…Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first array is a (contiguous) subarray of the second array, otherwise it returns False. You may solve this problem using recursion or iteration or a mixture of recursion and iteration. For an array to be a subarray of another, it must occur entirely within the other one without other elements in between. For example: [31,7,25] is a subarray of [10,20,26,31,7,25,40,9] [26,31,25,40] is not a subarray of [10,20,26,31,7,25,40,9] A good way of solving this problem is to make use of an auxiliary function that takes two arrays and returns True if the contents of the first array occur at the front of the second array, otherwise it returns False. Then, A is a subarray of B if it occurs at the front of B, or at the front of B[1:], or at the front of B[2:], etc. Note you should not use A == B for arrays.
- Using recursion, write a Python function def countOdds(A) which which takes an array of integers A as input and returns the number of elements in the array that are odd. For example, if A is [1,2,5,3,6,5,3,5,5,4] the the function should return 7. If A is empty then it should return 3. Hint: To check if n is odd it suffices to check if dividing it by 2 gives remainder 1 (in Python, this remainder is calculated by n%2).Using recursion, write a Python function def before(k,A) which takes an integer k and an array A of integers as inputs and returns a new array consisting of all the integers in A which come before the last occurrence of k in A, in the same order they are in A. For example, if A is [1,2,3,6,7,2,3,4] then before(3,A) will return [1,2,3,6,7,2]. If k does not occur in A, the function should return None.Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
- Implement a C function, named median, that receives two arrays as parameters passed and returns the median of the values stored in these two arrays. The two arrays are sorted. The prototype of the function MUST be: double median(int a[], int b[], int sizeA, int sizeB);For example, if I have int a[] = {1, 2, 10, 12, 100}; and int b[] = {3, 11, 20, 500, 600}; then the median is (11+12)/2 = 11.5.Write a program that creates an array of size 6 and input values to it through user input. It turnsout that these values that the user inputs were biased, and had an offset relative to the index ofthe array (for example, the first value had no bias since index = 0, the second value had a bias of 1since index = 1, and so on...).Pass this array to a function, that should remove the bias from each value by subtracting the biasfrom the original value. You need to subtract values using a for loop.Print the updated values of the array in the main function after the call to this bias removerfunction.in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);
- Write a Python code for this: Complete the below function which takes the coefficients of a polynomial P(x) as a tuple, and a list of values, and returns a list of computed values of P(x). Note that P() can be of any order. For example, P((2,-1,1), [1,2,3]) shall compute P(x) for x=1,2,3 P(x)=2x^2 -x +1 where x^2 denotes the square of x. Hence, the function must return [2,7,16], because P(1) is 2, P(2) is 7, and P(3) is 16.Implement a function GetMinimumCutSegments(int[] arr, int k) that takes in an array arr of positive integers and an integer k, and returns the minimum number of contiguous segments of the array that must be concatenated to form an array of size k. The function should return -1 if it is not possible to create an array of size k by concatenating contiguous segments of the input array. Example: Input: [1, 2, 3, 4], 6 Output: 2 Explanation: The minimum number of contiguous segments that must be concatenated to form an array of size 6 is 2. The two segments that can be concatenated are [1, 2] and [3, 4]. Input: [1, 2, 3, 4], 7 Output: -1 Explanation: It is not possible to create an array of size 7 by concatenating contiguous segments of the input array. Constraints: The input array arr will have at most length 100. The integer k will be at least 1 and at most 10^6. Can you write a C# function that solves this problem? public int GetMinimumCutSegments(int[] arr, int k) { // Your code…Write a function using python: diceSim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.diceSim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281]