cs 2130 - to be written in Java. Below the question part A I will provide the code that is needed to complete the questions. Thank you so much for your help !
// Boolean Matrix Class
public class BMat
{
// Instance variables
public int M[][];
public int SIZE;
// Boolean matrix constructors
public BMat(int s)
{
SIZE = s;
M = new int[SIZE][SIZE];
// Fill M with zeros
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
M[r][c] = 0;
}
}
}
public BMat(int[][] B)
{
SIZE = B.length;
M = new int[SIZE][SIZE];
// Copy matrix B values into M
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
if(B[r][c] == 0)
M[r][c] = 0;
else
M[r][c] = 1;
}
}
}
// Boolean matrix methods
public void show()
{
// Display matrix
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
System.out.print(" " + M[r][c]);
}
System.out.println();
}
return;
}
public boolean isEqual(BMat M2)
{
// Check if current matrix equals matrix M2
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
if(this.M[r][c] != M2.M[r][c])
return false;
}
}
return true;
}
public int trace()
{
// Sum of main diagonal values
int diag = 0;
for(int r = 0; r < SIZE; r++)
diag = diag + M[r][r];
return diag;
}
public int arrows()
{
// No. of 1's in matrix
int narrows = 0;
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
narrows = narrows + M[r][c];
}
}
return narrows;
}
public int indegree(int K)
{
// Number of arrows INTO node K of digraph
// Nodes are numbered 0,1,2,...,SIZE-1
int colsum = 0;
for(int r = 0; r < SIZE; r++)
colsum = colsum + M[r][K];
return colsum;
}
public BMat complement()
{
// Logical NOT of current matrix
BMat W1 = new BMat(SIZE);
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
if(this.M[r][c] == 0)
W1.M[r][c] = 1;
else
W1.M[r][c] = 0;
}
}
return W1;
}
public BMat join(BMat M2)
{
// Logical OR of current matrix with matrix M2
BMat W1 = new BMat(SIZE);
for(int r = 0; r < SIZE; r++){
for(int c = 0; c < SIZE; c++){
W1.M[r][c] = this.M[r][c] | M2.M[r][c];
}
}
return W1;
}
public BMat power(int N)
{
// Raise current matrix to Boolean Nth power (N >= 1)
BMat W1 = new BMat(this.M);
BMat W2 = new BMat(this.M);
for(int k = 2; k <= N; k++){
W1 = W1.product(W2);
}
return W1;
}
public BMat rclosure()
{
// Reflexive closure of current matrix
BMat W1 = new BMat(this.M);
// Put 1's on main diagonal
for(int r = 0; r < SIZE; r++)
W1.M[r][r] = 1;
return W1;
}
public BMat sclosure()
{
// Symmetric closure of current matrix
BMat W1 = new BMat(this.M);
BMat W2 = W1.transpose();
W1 = W1.join(W2);
return W1;
}
// *********************************
// Project #4 functions to add
// *********************************
public int outdegree(int K)
{
// Number of arrows FROM node K of digraph
// Nodes are numbered 0,1,2,...,SIZE-1
// Put code here...
}
public BMat meet(BMat M2)
{
// Logical AND of current matrix with matrix M2
// Put code here...
}
public BMat transpose()
{
// Transpose of current matrix
// Put code here...
}
public BMat product(BMat M2)
{
// Boolean product of current matrix with matrix M2
// Put code here...
}
public BMat tclosure()
{
// Transitive closure of current matrix (Warshall's algorithm)
// Put code here...
}
public int rootnode()
{
// Root node number (if any) of current matrix
// Nodes are numbered 0,1,2,...,SIZE-1
// Put code here...
}
} // end class
Homework Answers
The added lines are highlighted...
-----------------------------------------------------------------------
Copyable code:
public class BMat {
// Instance variables
public int M[][];
public int SIZE;
// Boolean matrix constructors
public BMat(int s) {
SIZE = s;
M = new int[SIZE][SIZE];
// Fill M with zeros
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
M[r][c] = 0;
}
}
}
public BMat(int[][] B) {
SIZE = B.length;
M = new int[SIZE][SIZE];
// Copy matrix B values into M
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
if (B[r][c] == 0) {
M[r][c] = 0;
} else {
M[r][c] = 1;
}
}
}
}
// Boolean matrix methods
public void show() {
// Display matrix
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
System.out.print(" " + M[r][c]);
}
System.out.println();
}
return;
}
public boolean isEqual(BMat M2) {
// Check if current matrix equals matrix M2
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
if (this.M[r][c] != M2.M[r][c]) {
return false;
}
}
}
return true;
}
public int trace() {
// Sum of main diagonal values
int diag = 0;
for (int r = 0; r < SIZE; r++) {
diag = diag + M[r][r];
}
return diag;
}
public int arrows() {
// No. of 1's in matrix
int narrows = 0;
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
narrows = narrows + M[r][c];
}
}
return narrows;
}
public int indegree(int K) {
// Number of arrows INTO node K of digraph
// Nodes are numbered 0,1,2,...,SIZE-1
int colsum = 0;
for (int r = 0; r < SIZE; r++) {
colsum = colsum + M[r][K - 1];
}
return colsum;
}
public BMat complement() {
// Logical NOT of current matrix
BMat W1 = new BMat(SIZE);
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
if (this.M[r][c] == 0) {
W1.M[r][c] = 1;
} else {
W1.M[r][c] = 0;
}
}
}
return W1;
}
public BMat join(BMat M2) {
// Logical OR of current matrix with matrix M2
BMat W1 = new BMat(SIZE);
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
W1.M[r][c] = this.M[r][c] | M2.M[r][c];
}
}
return W1;
}
public BMat power(int N) {
// Raise current matrix to Boolean Nth power (N >= 1)
BMat W1 = new BMat(this.M);
BMat W2 = new BMat(this.M);
for (int k = 2; k <= N; k++) {
W1 = W1.product(W2);
}
return W1;
}
public BMat rclosure() {
// Reflexive closure of current matrix
BMat W1 = new BMat(this.M);
// Put 1's on main diagonal
for (int r = 0; r < SIZE; r++) {
W1.M[r][r] = 1;
}
return W1;
}
public BMat sclosure() {
// Symmetric closure of current matrix
BMat W1 = new BMat(this.M);
BMat W2 = W1.transpose();
W1 = W1.join(W2);
return W1;
}
// *********************************
// Project #4 functions to add
// *********************************
public int outdegree(int K) {
// Number of arrows FROM node K of digraph
// Nodes are numbered 0,1,2,...,SIZE-1
int sum = 0;
for (int r = 0; r < SIZE; r++) {
sum = sum + M[K - 1][r];
}
return sum;
}
public BMat meet(BMat M2) {
// Logical AND of current matrix with matrix M2
// Put code here...
BMat W1 = new BMat(SIZE);
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
W1.M[r][c] = this.M[r][c] & M2.M[r][c];
}
}
return W1;
}
public BMat transpose() {
// Transpose of current matrix
// Put code here...
for (int r = 0; r < SIZE; r++) {
for (int c = 0; c < SIZE; c++) {
if (r == c) {
continue;
}
this.M[r][c] = this.M[c][r];
}
}
return this;
}
public BMat product(BMat M2) {
// Boolean product of current matrix with matrix M2
// Put code here...
BMat W1 = new BMat(SIZE);
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
for (int k = 0; k < SIZE; k++) {
W1.M[i][j] = W1.M[i][j] + this.M[i][k] * M2.M[k][j];
}
}
}
return W1;
}
public BMat tclosure() {
// Transitive closure of current matrix (Warshall's algorithm)
// Put code here...
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
if (this.M[j][i] == 1) {
for (int k = 0; k < SIZE; k++) {
if (this.M[j][i] == 1 && this.M[i][k] == 1) {
this.M[j][k] = 1;
} else {
this.M[j][k] = 0;
}
}
}
}
}
return this;
}
public int rootnode() {
// Root node number (if any) of current matrix
// Nodes are numbered 0,1,2,...,SIZE-1
// Put code here...
int noRootNode = 0;
//Storing the root node
int node = -1;
//for loop to check all Node
for (int i = 0; i < SIZE; i++)
{
int count = 0;
//for loop to check how many inedge is there for ith Node
for (int j = 0; j < SIZE; j++)
{
if (this.M[j][i] == 0) {
count = count + 1;
}
}
//Condition to check there is no InEdge
if (count == SIZE)
{
noRootNode = noRootNode + 1;
node = i;
}
}
//Condition to check no of root node in graph is exactly one
if (noRootNode == 1)
{
//return Node number
return node + 1;
}
return -1;
}
} // end class
Add Answer to:
cs 2130 - to be written in Java. Below the question part A I
will provide...
please make a pretty JAVA GUI for this code this is RED BLACK TREE and i...
please make a pretty JAVA GUI for this code
this is RED BLACK TREE and i Finished code
already
jus need a JAVA GUI for this code ... if poosible make
it pretty to look thanks and
please make own GUI code base on my code
thanks
ex:
(GUI only have to show RBTree)
----------------------------------------
RBTree.java
import java.util.Stack;
public class RBTree{
private Node current;
private Node parent;
private Node grandparent;
private Node header;
private Node...
Java - I need help creating a method that removes a node at the specific index...
Java - I need help creating a method that removes a node at the specific index position. The * first node is index 0. public boolean delAt(int index) { src code 2 different classes ******************************************** public class Node { private String data; private Node next; public Node(String data, Node next) { this.data = data; this.next = next; } public Node() { } public String getData() { return data; } public void setData(String data) { this.data = data; } public void...
Java help! Please help complete the min method below in bold. import java.util.Arrays; import java.util.ArrayList; import...
Java help! Please help complete the min method below in bold. import java.util.Arrays; import java.util.ArrayList; import java.util.Collections; import java.util.Iterator; import java.util.List; /** * Provides an implementation of a binary search tree * with no balance constraints, implemented with linked nodes. * * * */ public class Bst<T extends Comparable<T>> implements Iterable<T> { ////////////////////////////////////////////////////////////////// // I M P L E M E N T T H E M I N M E T H O D B E L O W...
JAVA QUESTION: *******THE QUESTION:******** /** numberOfNodesAtDepth * * Returns the number of nodes with...
JAVA QUESTION: *******THE QUESTION:******** /** numberOfNodesAtDepth * * Returns the number of nodes with depth == d * Precondition: none * * param: d the depth to search for * * hint: use a recursive helper function * * ToDo 4 */ public int numNodesAtDepth(int d) { return -1; } **********USEFUL CODE FROM THE ASSIGNMENT:*********** public class simpleBST<Key extends Comparable<Key>, Value> { private Node root; ...
Please help with the codes for the implementation of java.util.List, specifically for the 3 below overridden...
Please help with the codes for the implementation of java.util.List, specifically for the 3 below overridden methods @Override public int lastIndexOf(Object arg0) { required code } @Override public ListIterator<R> listIterator() { required code } @Override public ListIterator<R> listIterator(int arg0) { required code } PLEASE NOTE: Below are some of other overridden methods that are already implemented, they are meant to be examples of what the answers to the above questions for the 3 methods should...
Hi! Can someone can convert this java code to c++. ASAP thanks I will thumbs up Here's the code: ...
Hi! Can someone can convert this java code to c++. ASAP thanks I will thumbs up Here's the code: package lists; import bookdata.*; public class DoublyLinkedList { int size; //Variable que define el tamano de la lista. Node head, tail; //Nodos que definen el Head y Tail en la lista. //Constructor public DoublyLinkedList(){ this.head = null; this.tail = null; this.size = 0; } //Insert a new book in alphabetic order. public void insert(Book nb){ //Creamos uno nuevo nodo con el...
PROMPT: Consider a graph G. A connected component is a maximal subset of nodes that induces a connected sub graph. It’s maximal in the sense that you cannot add a node with the resulting induced sub g...
PROMPT:
Consider a graph G. A connected component is a maximal subset of
nodes that induces a connected sub graph. It’s maximal in the sense
that you cannot add a node with the resulting induced sub graph
remaining connected.The following function
numComponents returns the number of connected
components in an undirected graph.
QUESTION:
What is the time complexity for this function? The time
complexity should be a function of the number of nodes |V| and the
number of edges |E|....
package hw3; import java.util.LinkedList; /* *********************************************************************** * A simple BST with int keys and no values...
package hw3; import java.util.LinkedList; /* *********************************************************************** * A simple BST with int keys and no values * * Complete each function below. * Write each function as a separate recursive definition (do not use more than one helper per function). * Depth of root==0. * Height of leaf==0. * Size of empty tree==0. * Height of empty tree=-1. * * TODO: complete the functions in this file. * DO NOT change the Node class. * DO NOT change the name...
Does not pass the testcase testDTreeAdvancedReRootchangesParent Java I'm trying to extend the implementation of a general...
Does not pass the testcase
testDTreeAdvancedReRootchangesParent
Java
I'm trying to extend the implementation of a general tree with
new operations that change the structure of the tree.
I've created 5 classes: Node.java, SimpleNode.java, Tree.java,
RerootableTree.java and SimpleTree.java(which is the main java
class that I need to change).
The code does not pass ONE TESTCASE :
testDTreeAdvancedReRootchangesParent
The code passes all the other testcases except theone mentioned
above. This is because in the SimpleTree.java the method
"reRoot(Node newRoot)" is most likely...
Instructions Write a program in Java that implements the A* algorithm to find a path from...
Instructions Write a program in Java that implements the A* algorithm to find a path from any two given nodes. Problem Overview & Algorithm Description In a fully-observable environment where there are both pathable and blocked nodes, an agent must find a good path from their starting node to the goal node. The agent must use the A* algorithm to determine its path. For this program, you must use the Manhattan method for calculating the heuristic. Remember: your heuristic function...
please make a pretty JAVA GUI for this code
this is RED BLACK TREE and i Finished code
already
jus need a JAVA GUI for this code ... if poosible make
it pretty to look thanks and
please make own GUI code base on my code
thanks
ex:
(GUI only have to show RBTree)
----------------------------------------
RBTree.java
import java.util.Stack;
public class RBTree{
private Node current;
private Node parent;
private Node grandparent;
private Node header;
private Node...
PROMPT:
Consider a graph G. A connected component is a maximal subset of
nodes that induces a connected sub graph. It’s maximal in the sense
that you cannot add a node with the resulting induced sub graph
remaining connected.The following function
numComponents returns the number of connected
components in an undirected graph.
QUESTION:
What is the time complexity for this function? The time
complexity should be a function of the number of nodes |V| and the
number of edges |E|....
Does not pass the testcase
testDTreeAdvancedReRootchangesParent
Java
I'm trying to extend the implementation of a general tree with
new operations that change the structure of the tree.
I've created 5 classes: Node.java, SimpleNode.java, Tree.java,
RerootableTree.java and SimpleTree.java(which is the main java
class that I need to change).
The code does not pass ONE TESTCASE :
testDTreeAdvancedReRootchangesParent
The code passes all the other testcases except theone mentioned
above. This is because in the SimpleTree.java the method
"reRoot(Node newRoot)" is most likely...
Most questions answered within 3 hours.
-
An economy has a Cobb–Douglas production function:
Y=Kα(LE)1−αY=Kα(LE)1−α
The economy has a capital share of 0.30,...
asked 10 minutes ago -
60.0 mL of a silver chlorate solution with a concentration of
0.654 M is mixed with...
asked 15 minutes ago -
Asked if he has any regrets about the way he's handled the
coronavirus crisis so far,...
asked 26 minutes ago -
True or False?
Considering a door as a rigid body. Its angular motion happens
in a...
asked 30 minutes ago -
In
IUPAC naming, do we concider the prefix in alphabatizing?
In other words do we look...
asked 35 minutes ago -
If a trust has income required to be distributed of $11,500,
other amounts paid or required...
asked 51 minutes ago -
The degree of ionization of a weak acid
____________________.
Select all that are True.
a) varies...
asked 51 minutes ago -
Cereal for Breakfast. A cereal company claims
70% of Americans start the day with cereal for...
asked 52 minutes ago -
An elevator has a placard stating that the maximum capacity is
2400 lblong dash15 passengers. So,...
asked 55 minutes ago -
two charged proteins P1 and P2 are located at the positions
(1m,1m) and (-1m,1m) respectively on...
asked 1 hour ago -
eBook
Calculator
Job Order Cost Sheet
Remnant Carpet Company sells and installs commercial carpeting
for office...
asked 1 hour ago -
Using Kapustinskii equation, determine the lattice energy of a
hypothetical compound NaCl2 . Assume the sum...
asked 1 hour ago