Write codes to implement particle swarm algorithm with population size of 3 (set initial positions and velocities to x-[3.3],x-[8,8].x [6,6],[1,1]') and = = @=0.9,₁ =c₂=2.
Q: Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N)…
A: answer starts from step 2
Q: Write a Python program for applying CNN with considering the following requirements: Shuffle the…
A: Python program for applying CNN with considering thegiven requirements is given below:-
Q: entation for plotting class0, class1 with 96 points, where the low and high uniform of class0 for…
A: Write a python program of perceptron implementation for plotting class0, class1 with 96 points,…
Q: Write an implementation of “func(A)” that returns a peak in 2 dimensions -as defined by an entry…
A: A peak element is one that is bigger than or equal to its four neighbours (left, right, top, and…
Q: Write a JAVA program to find maximum sum subarray such that start and end values are same for…
A: The task is to locate a contiguous subarray (L-R) from an array of n positive integers in such a way…
Q: Given a function f_prime(), which represents the derivative of some loss function, learning rate Ir…
A: Given a function f_prime(), which represents the derivative of some lossfunction, learning rate Ir =…
Q: Wireless sensor networks (WSNs) refer to a domain of communication networks. In a WSN, small devices…
A: if we are talking about Wireless sensor networks in WSN , small devices called sensor nodes are used…
Q: PYTHON ASSIGNMENT ON 2D IMAGE MANIPULATION (i) Run the following: >>> import numpy as np…
A: Answer: I have run this code this is working. if you are facing problem like this module is not…
Q: Generate ten random numbers (s1-s10) using the linear congruently generator using the seed (s0) as…
A:
Q: Using simply Euler's method, solve the following IVP problem: dy = t - y², -1 ≤ t ≤ 4, y (0) = 2.5,…
A: dy/dt = t - y^2, -1 <= t <= 4, y(0) = 2.5 Using Euler's method, we can approximate the…
Q: I need a Clark and Wright Savings Algorithm in Python. Are there any templates already? I have the…
A: Algorithm: - The code starts by initializing the number of locations n and an empty list of routes.…
Q: Algorithm of Preis in Algebra The following steps make up the algorithm. A weighted graph G = as the…
A: Here's the algorithm of Preis in Algebra: Input: A weighted graph G = (V, E, w) Output: A maximum…
Q: Write a Python program for applying CNN with considering the following requirements: Shuffle the…
A: NOTE Below is the program for the given question. Hope you understand it well. If you have any…
Q: Use a computer programming language of your choice to implement the dynamic programming that allows…
A: For finding the shortest path, we must add the sum of edges of nodes and compare nodes values so as…
Q: Let L10 = {a"bmckI k = n + m and n,m,k2 0}. Design a CFG to generate L10.Then design a PDA to…
A:
Q: Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k…
A: In distance calculation, we find which codeword is closest to a received word. It is not a practical…
Q: CashOrNothingOption = function(S, k, Time, r, q, sigma) { d1 = (log(S / k) + (r - q + sigma ^ 2 / 2)…
A: #Added code to calculate and plot the changing values of sigma with respect to the given function.…
Q: Suppose x has values of 0.0, 1.5, 2.4, 4.2 and y has values 12.5, -3.0, 6.4, 32.1 Plot the x, y…
A: import matplotlib.pyplot as plt # x axis values x = [0.0, 1.5, 2.4, 4.2] # corresponding y axis…
Q: Implement a method public static double[] add(double[] a, double[] b) for the component-wise sum…
A: Use a loop to iterate for the indices of an array and keep on assigning sum for an element in new…
Q: How to use python code to plot linear regression 3D graph? x=[22, 25, 34, 41, 51,59] y=[0.65,…
A: There are many advanced machine learning methods with robust prediction accuracy. While complex…
Q: int sum, k, i, j; int x{4][4]={{5,1,7,8l,{1,4,3,4}, {9,6,7,3},{2,2,7,1}}; sum-0; for(i=1; i…
A: Required:
Q: def mystery (1st): for idx in range(1, len(1st)); tmp = 1st[idx) idx2 = idx while 1dx2 > 9 and…
A: def mystery(lst): # this is selection sort for idx in range(1,len(lst)): tmp = lst[idx] # select…
Q: A set of integers 0..MAX may be implemented using an array of boolean values. This particular…
A: Implemented Required Function in C programming as follows :
Q: Consider a function tetrahedral( ) that computes the n^th tetrahedral number for a given integer…
A: a) Sample Response: //C++ program to print tetrahedral number series by using recursive approach…
Q: Write a Python program for applying CNN with considering the following requirements: Shuffle the…
A: # import pandas as pdimport pandas as pdimport randomimport math # reading training datadata =…
Q: Implement Velocity Verlet • Bouncing test: Simulate two particles starting from some distance…
A: Implement Velocity Verlet • Bouncing test: Simulate two particles starting from some distance…
Q: Write a small piece of pseudo-code for generating a histogram H[L] for an intensity image…
A: histogram is a like bin count of intensity across the image
Q: Please answer it in Python Write a function pairsbypairslist that would return pair by pair from…
A: PROGRAM INTRODUCTION: Declare an empty list. Take the number of elements for the list from the…
Q: Consider an undirected graph G = (V,E), in which each node u 2 V may be colored with some color…
A: #include <iostream> #include <list> using namespace std; class Graph {…
Q: Write a Python program for applying CNN with considering the following requirements: Shuffle the…
A: Given: Write a Python program for applying CNN with considering the following requirements: Shuffle…
Q: a function called page_rank which will take as input a numpy array M, which will represent the…
A: Input : M: Transition matrix of a directed graph n: Number of iterations Output : Page rank after…
Q: Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) {…
A: Ans:The below diagram shows that flow chart of a program There are 11 blocks. The entry block and…
Q: Given A={1,2,3,4,56}, B= {2,4,5,6} and C= (1,6,7} 1. B' U C'=
A: A={1,2,3,4,56} B= {2,4,5,6} C= (1,6,7} B'= {1,3,7} C'= {2,3,4,5}
Step by step
Solved in 3 steps with 5 images
- This is JAVA ProgrammingProgram thisHow to use python code to plot linear regression 3D graph?x=[22, 25, 34, 41, 51,59]y=[0.65, 0.67,0.65,0.65,0.8,0.7]z=[182, 178, 147, 119, 111,95]A=np.transpose(np.array([[22, 25, 34, 41, 51,59],[0.65, 0.67,0.65,0.65,0.8,0.7],[1,1,1,1,1,1]]))Make x,y,z corresponding poing intercept at one point[eg point m(22,0.65,182)]
- You are given a N*N maze with a rat placed at maze[0][0]. Find whether any path exist that rat can follow to reach its destination i.e. maze[N-1][N-1]. Rat can move in any direction ( left, right, up and down).Value of every cell in the maze can either be 0 or 1. Cells with value 0 are blocked means rat cannot enter into those cells and those with value 1 are open.Input FormatLine 1: Integer NNext N Lines: Each line will contain ith row elements (separated by space)Output Format :The output line contains true if any path exists for the rat to reach its destination otherwise print false.Sample Input 1 :31 0 11 0 11 1 1Sample Output 1 :trueSample Input 2 :31 0 11 0 10 1 1Sample Output 2 : false Solution: //// public class Solution { public static boolean ratInAMaze(int maze[][]){ int n = maze.length; int path[][] = new int[n][n]; return solveMaze(maze, 0, 0, path); } public static boolean solveMaze(int[][] maze, int i, int j, int[][] path) {//…Coding in Python with NumPY and Matplotlib functions. Suppose x has values of 0.0, 1.5, 2.4, 4.2 and y has values 12.5, -3.0, 6.4, 32.1 Plot the x, y pairs on a graph as square markers of magenta color. Do not draw a curve through the data points.PYTHON ASSIGNMENT ON 2D IMAGE MANIPULATION (i) Run the following: >>> import numpy as np >>> import scipy as sp >>> import matplotlib.pyplot as plt >>> n = 10 >>> l = 256 >>> im = np.zeros((l, l)) >>> np.random.seed(1) >>> points = l*np.random.random((2, n**2)) >>> im[(points[0]).astype(np.int), (points[1]).astype(np.int)]= 1 >>> im = ndimage.gaussian_filter(im, sigma=l/(4.*n)) >>> mask = (im > im.mean()).astype(np.float) >>> mask += 0.1 * im >>> img = mask + 0.2*np.random.randn(*mask.shape) >>> hist, bin_edges = np.histogram(img, bins=60) >>> bin_centers = 0.5*(bin_edges[:-1] + bin_edges[1:]) >>> binary_img = img > 0.5 >>> plt.imshow(binary_img) >>> plt.show() (ii) Firstly, try and clean up the random noise with 2D filters, and create a subplot for each filter you try, with a descriptive title. i.e. Try a Gaussian…
- Implement boolean function f(A, B, C, D) =( 0,2,5,8,10, 14) B part :(A, B, C, D) =(2, 6,11)Algorithm of Preis in AlgebraThe following steps make up the algorithm.A weighted graph G = as the first input (V, E, w)A maximum weighted matching M of G as the output.While E =, choose any v V at random, let e E be the largest edge incident to v, and then perform the following calculations: 3. M e; 4. E e; 5. V V; 6.11. Two different Python implementations of this algorithm are shown by E, E, and all edges that are adjacent to e.Modeling the spread of a virus like COVID-19 using recursion. Let N = total population (assumed constant, disregarding deaths, births, immigration, and emigration). S n = number who are susceptible to the disease at time n (n is in weeks). I n = number who are infected (and contagious) at time n. R n = number who are recovered (and not contagiuous) at time n. The total population is divided between these three groups: N = S n + I n + R n There are several hidden assumptions here that may or may not apply to COVID-19, such as a recovered person is assumed to not be able to get the disease a second time, at least within the time window being examined. On week 0 (the start), you assume a certain small number of people have the infection (just to get things going). Everyone else is initially susceptible, and no one is recovered. There are two constants of interest: Let period = time period that it takes for an infected person to recover (recover meaning they become not infectious to…
- Implement/ Draw this function with the use of a 2-var MUX. f(C, B, A) = CB'A + C'B'A + CBAProgram should be in JAVAGenerate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) { int i,j,p,t; for(i=0;i<N-1;i++) { p=i; for(j=i+1;j<N;j++) if(a[j]>a[p]) p=j; if(p!=i) { t=a[p]; a[p]=a[i]; a[i]=t; } } } a) Draw CFG. b) How many basic paths for the CFG? c) List the basic paths. d) Generate test cases from it.