SYSC-4101_Lab6

public static int[] goodResize(int[] list, int newSize)                         {           assert list != null && newSize >= 0 : "failed precondition";                                     int[] result = new int[newSize];                                     int limit = Math.min(list.length, newSize);                                     for(int i = 0; i < limit; i++)                                     {           result[i] = list[i];                                     }                                     return result;                         }                 **Note: Software testing & quality assurance Question: Create a control flow graph based on the coding above and find all these paths: Statement coverage Branch coverage Predicate coverage

public static int[] goodResize(int[] list, int newSize)                         {           assert list != null && newSize >= 0 : "failed precondition";                                     int[] result = new int[newSize];                                     int limit = Math.min(list.length, newSize);                                     for(int i = 0; i < limit; i++)                                     {           result[i] = list[i];                                     }                                     return result;                         }                 **Note: Software testing & quality assurance Question: Create a control flow graph (CFG) based on the coding above and find all these paths Statement coverage Branch coverage Predicate coverage

Create a java for loop that maps denotational semantics Please walk me through this step by step!!!

Write a complete Program in Java to implement circular queue using array for the following tasks: 1. Method to insert the new element in the circular queue 2. Method to delete an element from the circular queue 3. Method to display all the elements of the circular queue 4. Create the test class to perform the operations on circular queue in the following sequence: a. Add a new element 10 b. Add a new element 20 c. Add a new element 30 d. Add a new element 40 e. Display all elements f. Delete from the circular queue g. Delete from the circular queue h. Add a new element 50 i. Add a new element 60 j. Add a new element 70 Please screenshot of the output

Computer Science JAVA!!!!!!!! Use the class MyArrayList to implement the interface MyList listed below using parallel streams and write a test program to test the methods. The class should be thread safe.   interface MyList{ public void add(E x); public void add(List lst); public boolean forAll(Predicate pr); public boolean exists(Predicate pr); public long count(Predicate pr); public List map(Function fn); public List filter(Predicate pr); public List mapFilter(Function fn, Predicate pr); } class MyArrayList implements MyList{ private ArrayList data = new ArrayList<>(); … }

Q1: Given the following code segment, please draw (a) the context sensitivity interprocedural control-flow graph, and (b) the context insensitivity interprocedural control-flow graph.   void main () {     int x = 0;     int y = foo(x);     x = x + 3;     int z = foo (x); }   int foo (int n) {     int ret = 0;     if (n < 0) {         ret = ret – n;     }     return ret; }

write a java code for the following uml diagram. only provide the signatures of the method. No need to write the body code.

This section is divided into two subsections. Each subsection contains a problem to be solved using both recursive and non-recursive approaches. You need to implement the solution in one of your preferred languages ( C++, or JAVA). In addition, you need to provide the order growth analysis and plot the input size vs. run-time graph for both approaches. The n th Triangle Problem Write a code for finding the n th triangle number of triangle sequences: 1, 3, 6, 10, ..., n. That is, your code should accept an integer number, which indicates the triangle levels, and returns how many dots we need to form a triangle with respect to the given level. For example, consider the Fig 1. For n = 3 (can be also written as T3), your code should returns 6. Provide a single program consists of the following: • Write a function called TriangularRecursive for the recursive version that takes number of level as an int argument. Hints: 1) Identify the base case for the TriangularRecursive function. 2) Let…

The language must be in python. Just do numbers 5-7 Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative?  is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples

A JAVA code following a recursive divide-and-conquer approach. Please comment on the Asymptotic running time.

A C++ Program Make necessary changes to the Class Definition Graph ADT so that it can store data in the following way (as seen in the attach images) Create the following operations and include a menu-driven main program that will demonstrate your operations. The program will only stop when the user chooses 5 Exit Program. 1. Create Grapha. Adjacency Listb. Adjacency Matrix 2. Traversala. BFS (Breadth First Search)b. DFS (Depth First Search) 3. Find Path (Given Source and Destination) 4. Path Cost (Given Source and Destination) 5. Exit Program NOTE: Users will input name of places as string and your program will do the manipulation to convert it to an integer vertex. Also, you will have to convert integer vertex back to string when displaying back output to users. Cost will the basis on what vertex to take in BFS and DFS. Cost will only be displayed in option 4.

In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy:  100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at the attached figure on and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11

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…

Java program to implement constraint satisfaction using graph coloring. Using backtracking and without backtracking

Create two stacks in java  which store initial and goal state of block world problem. Display these state to user and then create   a heuristic value which give +1/-1 to each block correct position with respect its goal state.

Book: Java Software Structures Author: John Lewis; Joe Chase Javascript 1. Create a generic type java interface StackADT<T>with the following methods: a.public void push(T element);//Push an element at the top of a stack b.public T pop();//Remove and return an element from the top of a stack c.public T peek();//return the top element without removing it d.public booleanisEmpty();//Return True if a stack is emptye.public int size();//Return the number of elements in a stack f.public String toString();//Print all the elements of a stack 2. Define ArrayStack<T>class which will implementStackADT<T>interface 3. Use your ArrayStack<T>class to compute a postfix expression, for instance, 3 4 * will yield12;3 4 6 + *will yield 30 etc. During computing a postfix expression: a.While you perform a push operation, if the stack is full, generate an exception b.While you perform a pop operation, if the stack is empty, generate an exception c.If two operands are not available…

Computer Science Write a Scheme program to reverse a web link graph so that for each web site considered, we know those web sites that contain links to it. Use a list to represent the given web link graph where each of its element contains all the links of a same host. For example, [a, b, c] means that from a, we have a link to b and a link to c. Represent the reversed web link graph in a similar way. For example, [a, b, c] means that {b, c} is the set of web sites that contain links to a. If the input is [[a, b, c], [b, c, e], [c, b, a]], for example, your Scheme program should produce this list: [[a, c], [b, a, c], [c, a, b], [e, b]].

Hi, help me with this problem, please. Also, please follow the skeleton code provided to find the output. Here's the skeleton code: package graph; import java.util.*; public class Graph2 { public int n; //number of vertice public int[][] A; //the adjacency matrix public Graph2 () { n = 0; A = null; } public Graph2 (int _n, int[][] _A) { this.n = _n; this.A = _A; } public int prim (int r) { } /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int n = 9; int A[][] = { {0, 4, 0, 0, 0, 0, 0, 8, 0}, {4, 0, 8, 0, 0, 0, 0, 11, 0}, {0, 8, 0, 7, 0, 4, 0, 0, 2}, {0, 0, 7, 0, 9, 14, 0, 0, 0}, {0, 0, 0, 9, 0, 10, 0, 0, 0}, {0, 0, 4, 14, 10, 0, 2, 0, 0}, {0, 0, 0, 0, 0, 2, 0, 1, 6}, {8, 11, 0, 0, 0, 0, 1, 0, 7}, {0, 0, 2, 0, 0, 0, 6, 7, 0} }; Graph2 g = new Graph2(n, A); System.out.println(g.prim(0)); } } Here is the prim function: package graph; public class PrimNode implements Comparable<PrimNode> { public int id; public int key; public…

Use c++ language Implement the isNeighbor(int u, int v) method. This method should return true if v is a neighbor of u and false otherwise. bool Graph::isNeighbor(int u, int v) { code here... }

Modify the Java class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. class StackClass {private int [] stackRef;private int maxLen,topIndex;public StackClass() { // A constructorstackRef = new int [100];maxLen = 99;topIndex = -1;}public void push(int number) {if (topIndex == maxLen)System.out.println("Error in push–stack is full");else stackRef[++topIndex] = number;}public void pop() {if (empty())System.out.println("Error in pop–stack is empty"); else --topIndex;}public int top() {if (empty()) {System.out.println("Error in top–stack is empty");return 9999;}elsereturn (stackRef[topIndex]);}public boolean empty() {return (topIndex == -1);}}An example class that uses StackClass follows:public class TstStack {public static void main(String[] args) {StackClass myStack = new StackClass();myStack.push(42);myStack.push(29);System.out.println("29 is: " + myStack.top());myStack.pop();System.out.println("42 is:…

Question5: Write a python program to train neural network to classify two clusters in a 2-dimensional space for implementing XOR, where the weight is -0.50 and x>-0.5. Also name the class by your name

java program to implement constraint satisfaction through graph coloring using backtracking

Java Very important: As a COMMENT IN CODE, please DO Test-Cases on how you would test your solution assumptions and hence your code explore a specific way to perform a Breadth First Search (BFS) of a given Graph [Ref : Figure 1].

: Draw a stack diagram showing all invocations of Power recursive method. public static void main (String [] args) { System.out.println(" power(3, 4));  } // end main public static long power(int x, int n) { if (n == 0) return 1; return x* power(x, n-1); } // end power method

In java pls! here is some starter code for this problem: public class ThreadingDivisors {     public static void main(String[] args) {         long start = System.currentTimeMillis();                 int maxDivisors = 0;         int answer = 0;                 for (int n=1; n<100000; n++) {             int divisors = getNumDivisors(n);             if (divisors > maxDivisors) {                 maxDivisors = divisors;                 answer = n;             }         }                 System.out.println(answer + " has the most divisors (" +                 maxDivisors + ")");                 long end = System.currentTimeMillis();         System.out.println(end - start + " milliseconds");     }         public static int getNumDivisors(int n) {         int numDivisors = 0;         for (int i=1; i<=n; i++) {             if (n % i == 0) {                 numDivisors++;             }         }         return numDivisors;     } }

In Python, Given the following 3 lists:fruitName = [’Apples’, ’Oranges’, ’Cherries’, ’Watermelon’]fruitQuantity_2020 = [25, 25, 10, 18]fruitQuantity_2021 = [22, 18, 9, 19]Create 4 subplots, plot, scatter, stack, and pieplots. The x-axis is the list: fruitName while the y-axes consist of fruitQuantity_2020 andfruitQuantity_2021

In Java,  Complete the incomplete method of ExpressionTree.java. The incomplete methods are private Node parsePrefix(Scanner input) // Required public void parseInfix(String string) // Optional public void parsePostfix(String string) // Optional Implementations of parseInfix and parsePostfix require use of a stack. Implementation of parsePrefix does not. Read all of the ExpressionTree.java file before starting your implementation, so that you see the helper methods that are provided and get an idea of the context for your implementation.  Although not needed for your implementation, you should be sure you understand how the toStringPrefix, toStringInfix, and toStringPostfix methods work. Note: The main() method accepts a single String as its argument. The String should be a prefix, infix, or postfix mathematical expression with no characters other than operators (+, -, *, and /) and operands (single characters a-z).  As written, the main() method calls parsePrefix() to create an…