PLEASE DO Q4 IN PYTHON def integrand(x, params):value = 0for coefficient, power in params:value += coefficient *x** powerreturn valuedef trapezoidal_rule(f, a, b, n):x = np.linspace (a, b, n+1) # a- Lower Limit, b-upper limit, n= number of trapezoidfx = f(x)weights=np.ones(n+1)weights[0] /= 2weights [-1] /= 2h (b a) n=integral h✶ np.sum(weightsreturn integral*fx)def plot_errors (x_values, y_values, labels, linestyles, title):plt.figure(figsize=(10, 6))for x, y, label, linestyle in zip(x_values, y_values, labels, linestyles):plt.loglog(x, y, linestyle, label-label)plt.xlabel('Number of Trapezoids (log scale)')plt.ylabel('Error (log scale)')plt.title(title)plt.legend()plt.show()def calculate_slope (x_values, y_values):coefficients = np. polyfit (np.log(x_values), np.log(y_values), 1)return coefficients[0] 4. Use Richardson extrapolation for the trapezoid rule to compute the integral for 15 ✓edx. Compute the 1st, 2nd, 3rd, 4th, and 5th bestapproximation. This is analagous to finding 121, 122, 123, 124, and 125. Once again, make use of the functions that you defined in 1.There is no graph for this exercise--just output the 5 numbers.

Approach to solving the question: Detailed explanation: Examples: Key references:Computer Science

Answered: def integrand(x, params): value = 0 for…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

1: |R|←|P| Reserve space for |P| = 13 values.2: x ← n3: for i ← 0 ...(|P| − 1) do4: c ← x div Pi Number of multiplicands Pi in x.5: Ri ← c6: x ← x − c · Pi7: end for8: return RA Java programmer could implement Algorithm by first modelling the primitivenumbers with the enumeration type RomanNumeral. Each enum constant (I, IV, ..., M) is declared with its decimal value, which can be accessed with the function getValue().
Fix the code below so that there is a function that calculate the height of the triangle. package recursion; import javax.swing.*;import java.awt.*; /** * Draw a Sierpinski Triangle of a given order on a JPanel. * * */public class SierpinskiPanel extends JPanel { private static final int WIDTH = 810; private static final int HEIGHT = 830; private int order; /** * Construct a new SierpinskiPanel. */ public SierpinskiPanel(int order) { this.order = order; this.setMinimumSize(new Dimension(WIDTH, HEIGHT)); this.setMaximumSize(new Dimension(WIDTH, HEIGHT)); this.setPreferredSize(new Dimension(WIDTH, HEIGHT)); } public static double height(double size) { double h = (size * Math.sqrt(3)) / 2.0; return h; } /** * Draw an inverted triangle at the specified location on this JPanel. * * @param x the x coordinate of the upper left corner of the triangle * @param y the y…
can you help me to draw the flow chart for the java code: import java.util.Scanner;class BinoNode {int data;int numNodes;BinoNode arr[];public BinoNode(int k) {data = -1;numNodes = k;arr = new BinoNode[numNodes];}}class BinomialTree {private BinoNode root; private int order, size;public BinomialTree(int k) {size = 0;order = k;root = new BinoNode(order);createTree(root);}private void createTree(BinoNode r) {int n = r.numNodes;if (n == 0) {return;}for (int i = 0; i < n; i++) {r.arr[i] = new BinoNode(i);createTree(r.arr[i]);}}public void clear() {size = 0;root = new BinoNode(order);createTree(root);}public void insert(int val) {try {insert(root, val);} catch (Exception e) {}}private void insert(BinoNode r, int val) throws Exception {if (r.data == -1) {r.data = val;size++;throw new Exception("inserted !");}int n = r.numNodes;for (int i = 0; i < n; i++) {insert(r.arr[i], val);}}public void printTree() {System.out.print("\nBinomial Tree =…
Java Code: Below are the methods for parser.java. Make sure to use the existing Parser.java file to add in all the methods and show the output. OperationNode: Has enum, left and Optional right members, good constructors and ToString is good VariableReferenceNode: Has name and Optional index, good constructors and ToString is good Constant & Node Pattern: Have name, good constructor and ToString is good ParseLValue - variables: Accepts a variable name and creates an appropriate Variable Reference Node ParseLValue - arrays: Accepts a name, appropriately gets an index and creates an appropriate Variable Reference Node ParseLValue - dollar: Creates an operation node, gets the value of the $ operator appropriately ParseBottomLevel – constants & patterns: Detects strings, numbers and patterns and creates appropriate nodes ParseBottomLevel – parenthesis: Creates an operation node AND gets the contents of the parenthesis appropriately ParseBottomLevel – unary operators: All…
Here you can find the java code and photo of challenge: import java.io.*;import java.math.*;import java.security.*;import java.text.*;import java.util.*;import java.util.concurrent.*;import java.util.function.*;import java.util.regex.*;import java.util.stream.*; public class Solution { public static class DirectedGraph {/* Adjacency List representation of the given graph */private Map<Integer, List<Integer>> adjList = new HashMap<Integer, List<Integer>>(); public String toString() {StringBuffer s = new StringBuffer();for (Integer v : adjList.keySet())s.append("\n " + v + " -> " + adjList.get(v));return s.toString();} public void add(Integer vertex) {if (adjList.containsKey(vertex))return;adjList.put(vertex, new ArrayList<Integer>());} public void add(Integer source, Integer dest) {add(source);add(dest);adjList.get(source).add(dest);} /* Indegree of each vertex as a Map<Vertex, IndegreeValue> */public Map<Integer, Integer> inDegree()…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Add unit testing to the textanalyzer class. Please perform this task using JUnit. import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.io.*; public class TextAnalyzer { public static void main(String[] args) throws Exception { String Word; URL poem = new URL("https://www.gutenberg.org/files/1065/1065-h/1065-h.htm"); BufferedReader in = new BufferedReader( new InputStreamReader(poem.openStream())); Map map = new HashMap(); while ((Word = in.readLine()) != null) { String[] words = Word.split("[\\s.;,?:!()\"]+"); for (String word : words) { word = word.trim(); if (word.length() > 0) { if (map.containsKey(word)) { map.put(word, map.get(word) + 1); } else { map.put(word, (int) 1L); } } } } // retrieving the map contents Set> set = map.entrySet(); // make an array list List> sortedList = new…
Answer must be solved Recursively neighbor(n, prev) Takes a positive integer n and a default argument prev and returns the number of digits in n that have the same digit to its left or to its right. Floor division (//) and modulo (%) operators are useful here. Forbidden methods, operators, and libraries: • You are not allowed to convert n to other data type such str() or list() • You are not allowed to use pow, the ** operator, or import any function (such as math.log) • You are not allowed to declare global variables • You are not allowed to use for/while loops in any form Preconditions n: int -> positive integer prev: int -> positive integer sequence of items Returns: int Examples: >>> neighbor(777) 3 >>> neighbor(469704) 0 >>> neighbor(411477) # 411477 4 >>> neighbor(7951452114587444436999) # 7951452114587444436999 9 >>> neighbor(22222222222222233) 17
Java // Complete the missing code in the main function in the Main class below import java.util.ArrayList; import java.util.Iterator; import java.util.List; class Student { private int studentId; private String studentName; private String course; public Student(int studentId, String studentName, String course) { super(); this.studentId = studentId; this.studentName = studentName; this.course = course; } @Override public String toString() { return "Student Details:\n" + "studentId:"+studentId + "\nstudentName:" + studentName + "\ncourse:" + course; } } public class Main { public static void main(String[] args) { List<Student> studentList =new ArrayList<>(); studentList.add(new Student(1,"Alex","Java with DS")); studentList.add(new Student(2,"Albert","Java with DS")); studentList.add(new Student(3,"Samson","Spring Api"));…
A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n): if (n < 0 ): return -1 else: return n fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2]) return fibonacci_numbers(n) # TODO: Write…
please help me with the following 1) make a sierpenski triangle using java and recursion. Make it similar to the code below. And please comment the code 2) Please make the follow code out put on the console. It a t square fractal import java.awt.image.*;import java.awt.Color;import java.io.*;import javax.imageio.*; public class Main{ static final int DIMENSION = 1000; static BufferedImage image = new BufferedImage(DIMENSION, DIMENSION, BufferedImage.TYPE_INT_RGB); static final int WHITE = Color.WHITE.getRGB(); static final int BLACK = Color.BLACK.getRGB(); private static void drawSquare(int x, int y, int side) { if (side <= 0) return; else { int left = x - side/2; int top = y - side/2; int right = x + side/2; int bottom = y + side/2; for (int i = left; i < right; i++) for (int j = top; j < bottom; j++) { image.setRGB(i, j, BLACK); }…
- Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials - In order to add 2 polynomials, traverse both lists, If a particular exponent value is present in either one, it should also be present In the resulting polynomial unless its coefficient is zero. java submit as a text dont use others answers please attach screenshot of output Thank you!!!

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning