Explain how first graph Changes to the second and then third graph. heat.py## heat.py#import matplotlib.pyplot as pltimport numpy as npsize = 10b = np.zeros((size, size))# Create heat sourcefor i in range (size):b[i,0] = 10Heat Diffusion Simulationprint ('\nHEAT DIFFUSION SIMULATION\n')print (Initial array...')print (b)#Temp array for storing calculationsnp.zeros((size, size))b2 =Fundamentals Lectures2626 heat.py# Calculate heat diffusionfor timestep in range (5):for r in range (1, size-1):for c in range (1, size-1 )b2 [r,c]Fundamentals Lecture3(b[r-1,c-11*0.1 + b[r-1,c]*0.1.+ b[r-1,c+i]*0.1 + b[r,c-i] *0.1+ b[r, c) *0.2 + b[r, c+1] *0.1for i in range (size):b2 [1,0] 10b = b2.copy ()plt.title('Heat Diffusion Simulation')plt.imshow (b2, cmap-plt.cm.hot)plt.colorbar ()plt.show()+ b[r+1, c-1]*0.1 + b[r+1,c] *0.1+ b[r+1, c+1] *0.1)heat.py#Calculate heat diffusionfor timestep in range (5):Hest Diffusion Simulationfor r in range (1, size-1):for c in range (1, size-1):b2 [x, c]Heat Diffusion Simulation(b[r-1,c-11*0.1 + b[r-1, c) *0.1+ b[r-1,c+i] 0.1 + b[r,c-11 0.1+ b[r,c] 0.2 + b[r,c+1] 0.1for i in range (size):b2 [1,01 10bb2.copy ()+ b[r+1,c-11*0.1 + b[r+1,c] *0.1+ b[r+1, c+1] *0.1)plt.title ('Heat Diffusion Simulation')plt.imshow (b2, cmap-plt.cm.hot, interpolation='bilinear')plt.colorbar ()plt.show()2727/5

Let's get started with the first graph. and then second and finally the third one.

heat.py # Calculate heat diffusion for timestep in range (5): for r in range (1, size-1): for c in range (1, size-1 ) b2 [r, c] Fundamentals Lecture (b[r-1, c-1] *0.1 + b[r-1, c) *0.1 + b[r-1,c+i] 0.1 + b[r, c-11*0.1 + b[r,c] *0.2 + b[r, c+1] *0.1 for i in range (size): b2 [1,0] = 10 bb2.copy () plt.title('Heat Diffusion Simulation') plt.imshow (b2, cmap-plt.cm.hot) plt.colorbar () plt.show() + b[r+1, c-1]*0.1 + b[r+1, c) *0.1 + b[r+1, c+1] *0.1) heat.py # Calculate heat diffusion for timestep in range (5): for r in range (1, size-1): Heat Diffusion Simulation for c in range (1, size-1 ): b2 [r,c] Heat Diffusion Simulation (blr-1, c-11*0.1 + b[r-1,c] 0.1 + b[r-1,c+i] 0.1 + b[r,c-i1*0.1 + b[r,c] *0.2 + b[r, c+1]*0.1 for i in range (size): 10 b2 [1,0] bb2.copy() + b[r+1,c-11*0.1 + b[r+1,c] 0.1 + b[r+1,c+1] *0.1) plt.title('Heat Diffusion Simulation') plt.imshow (b2, cmap-plt.cm. hot, interpolation='bilinear') plt.colorbar () plt.show() 27 27/5

heat.py # Calculate heat diffusion for timestep in range (5): for r in range (1, size-1): for c in range (1, size-1 ) b2 [r, c] Fundamentals Lecture (b[r-1, c-1] 0.1 + b[r-1, c) 0.1 + b[r-1,c+i] 0.1 + b[r, c-110.1 + b[r,c] 0.2 + b[r, c+1] 0.1 for i in range (size): b2 [1,0] = 10 bb2.copy () plt.title('Heat Diffusion Simulation') plt.imshow (b2, cmap-plt.cm.hot) plt.colorbar () plt.show() + b[r+1, c-1]0.1 + b[r+1, c) 0.1 + b[r+1, c+1] 0.1) heat.py # Calculate heat diffusion for timestep in range (5): for r in range (1, size-1): Heat Diffusion Simulation for c in range (1, size-1 ): b2 [r,c] Heat Diffusion Simulation (blr-1, c-110.1 + b[r-1,c] 0.1 + b[r-1,c+i] 0.1 + b[r,c-i10.1 + b[r,c] 0.2 + b[r, c+1]0.1 for i in range (size): 10 b2 [1,0] bb2.copy() + b[r+1,c-110.1 + b[r+1,c] 0.1 + b[r+1,c+1] 0.1) plt.title('Heat Diffusion Simulation') plt.imshow (b2, cmap-plt.cm. hot, interpolation='bilinear') plt.colorbar () plt.show() 27 27/5

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

package edu.luc.cs.cs271.mazesolver; import java.util.ArrayList;import java.util.Scanner; public class Main { public static void main(final String[] args) { // create scanner for data input final var input = new Scanner(System.in); // TODO read row and column for the starting point final var startRow = -1; final var startCol = -1; // TODO read maze data one row (line) at a time into rawData final var rawData = new ArrayList<String>(); // attempt to solve the maze and print the result final var maze = new Maze(rawData); final var result = maze.solve(startRow, startCol); maze.print(System.out); System.out.println(); System.out.println(result ? "We're so out of here!" : "Bummer, we're stuck..."); }}
Given an array of numbers, and an integer, find the last index that that integer appears in the array. If the number is not found, return -1. import java.util.ArrayList;public class LastIndexFound{public static int solution(ArrayList<Integer> nums, int numToFind){// ↓↓↓↓ your code goes here ↓↓↓↓return 0;}}
The rotateLeft method takes an array of integers, and an integer number of places, and returns a new copy of the array that contains a "rotated" version of the input array. Rotation means that elements have been shifted leftwards by that number of places, moving elements off one end of the array and onto the other end. For example, [11, 12, 13, 14, 15] rotated left by 2 places results in [13, 14, 15, 11, 12].
Programming exercise (in java eclipse, please add comments for each step). Write a complete Java program named FindProduct that contains the following: a. A main method asks the user to provide the number of rows and columns for a 2-dimensional array of integers. b. A main method calls the getArray() method that creates the 2D array of specified size and populates it with random values from 0 to 100. c. A main method prints the elements of the 2D array created by getArray(). d. A main method calls the printProduct method that will: i. Receive the two-dimensional array as input ii. Calculate the product of elements in each row of the array iii. Display the product on the Console. The product of all elements in each row should be formatted as "Row 1 Product XXXX"
Given an ArrayList of Integers, find a subarray with the maximum sum of any potential subarray within the ArrayList. A subarray is any combination of consecutive numbers. The subarray can be of any length n, where the size of n >= 0. import java.util.ArrayList;public class MaxSubArray{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
A prime integer is any integer greater than 1 that can be divided evenly only by itself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It works as follows:a) Create an array with all elements initialized to 1 (true). Array elements with prime subscripts will remain 1. All other array elements will eventually be set to zero.b) Starting with array subscript 2 (subscript 1 is not prime), every time an array element is found whose value is 1, loop through the remainder of the array and set to zero every element whose subscript is a multiple of the subscript for the element with value 1. For array subscript 2, all elements beyond 2 in the array that are multiples of 2 will be set to zero (subscripts 4, 6, 8, 10, and so on.). For array subscript 3, all elements beyond 3 in the array that are multiples of 3 will be set to zero (subscripts 6, 9, 12, 15, and so on)When this process is complete, the array elements that are still set to 1 indicate that the subscript is a…
Please keep the simulation neat and well organized. It is a request. Perform QuickSort on the given array. You need to show the whole simulation. A = [10,3,9,18,21,26,30,8,15,6,17].
How do I sort tiles from least valuable to most valuable? import java.util.ArrayList;class Rack{private ArrayList<Tile> Tile;public Rack(){Tile = new ArrayList<Tile>();}public void addTile(Tile t){Tile.add(t);}public String toString(){String str = "";for(int i=0; i < Tile.size() ; i++)str = str + Tile.get(i);return str;}public void sortHighToLow(){int i, j, min;int n = Tile.size();for (i = 0; i < n-1; i++){min = i;for (j = i+1; j < n; j++){if(Tile.get(j).compareTo(Tile.get(min)) < 0)min = j;}//Swap.Tile t = Tile.get(min);Tile t1 = Tile.get(i);Tile.set(min, t1);Tile.set(i, t);}}}class Main{public static void main(String[] args){Rack craigTiles = new Rack();craigTiles.addTile(new Tile('H', 4));craigTiles.addTile(new Tile('E', 1));craigTiles.addTile(new Tile('L', 1));craigTiles.addTile(new Tile('L', 1));craigTiles.addTile(new Tile('O', 1));craigTiles.addTile(new Tile('Z', 10));craigTiles.addTile(new Tile('Y',…
(Using Java in eclipse) Suppose we have to declare a two dimensional array called matrix with each dimension having some length. Write a message to initialize this array with random values between zero and 99. Hint: set each individual element of the right to random value
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> finalList = new ArrayList<>();int index = 0;for (int i = 0; i < nums.size(); i++) {if (nums.get(i) % 2 == 1) {finalList.add(index, nums.get(i));index++;} elsefinalList.add(nums.get(i));}return finalList;} This is my failing code. for [1.-3.3] where [1,3,-3] is being returned
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. import java.util.ArrayList;public class EvenAfterOdds{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}